Abstract: The design of a graph data structure, the memory structure and the depth_first search traversing algorithm are proposed. This algorithm can make the graph implement traversing in DNA computer. In order to prove the feasibility of the method, an actual example is given out, which describes the implementation of the algorithm. On the basis of the experimental theory of bio-molecular, the algorithm is an effective and feasible method.

Key words: DNA computer, graph, breadth_first search, traversing

摘要： 提出DNA计算机中图数据结构的一种设计方法，给出具体的存储结构以及深度优先搜索遍历的算法。该算法实现了在DNA计算机下图元素的遍历。为证明其可行性，给出一个具体的算法实例，描述了DNA计算机上的运行机制。依据分子生物学的理论，证明算法是有效且可行的。

关键词: DNA计算机, 图, 深度优先搜索, 遍历

CLC Number: 

• TP384