The Breadth First Search Traversing Algorithm of the Graphs in DNA Computer

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.