ScholarLens Back to search
2009•Unpublished venueRequires access

The Breadth First Search Traversing Algorithm of the Graphs

Chunde Yang Guohui Wei, Jun Tan, Jingbo Xie

Open publisher page 0 citations

Abstract

The design of a graph data structure, the memory structure and the breadth first search traversing algorithm are proposed. This algorithm can make the graph implement traversing in DNA computer. Finally, in order to prove the feasibility of the method, an actual example describes the implementing of the algorithm is given out. On the basis of the experimental theory of bio-molecular, the algorithm is an effective and feasible method. Keywords-DNA computer; Graph; Breadth_First Search; Traversing

About this research paper

What this paper is about

The design of a graph data structure, the memory structure and the breadth first search traversing algorithm are proposed. This algorithm can make the graph implement traversing in DNA computer. Finally, in order to prove the feasibility of the method, an actual example describes the implementing of the algorithm is given out. On the basis of the experimental theory of bio-molecular, the algorithm is an effective and feasible method. Keywords-DNA computer; Graph; Breadth_First Search; Traversing

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The design of a graph data structure, the memory structure and the breadth first search traversing algorithm are proposed. This algorithm can make the graph implement traversing in DNA computer. Finally, in order to prove the feasibility of the method, an actual example describes the implementing of the algorithm is given out. On the basis of the experimental theory of bio-molecular, the algorithm is an effective and feasible method. Keywords-DNA computer; Graph; Breadth_First Search; Traversing

Key concepts: Traverse, Algorithm, Computer science, Breadth-first search, Graph, Search algorithm, Basis (linear algebra), Theoretical computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Breadth First Search Traversing Algorithm of the Graphs — Research Paper | ScholarLens