任意串并拓扑结构的数据结构及遍历算法

A Structure and Its Traversing for the Random Serial-parallel Topology

提出了一个能够表示任意具有串并关系特点的拓扑结构的数据结构及其遍历算法．实践表明，这种数据结构及其遍历算法具有面向结点，输入参数最少，串并关系明确，遍历算法简洁。

This paper presents a data structure and its traversing algorithm for random serial-parallel topology.The experiment shows that the data structure and the traversing algorithm have many advantages,such as node-oriented structure,minimum number of inputting parameter,clear serial and parallel relation of the nodes and brief traversing algorithm etc.