数据结构

在图G中求一条从顶点i到顶点s 的简单路径。

实验目的：

1、掌握图的各种存储结构，尤其熟练掌握邻接矩阵和邻接表存储结构；

2、熟练掌握图的深度优先遍历和广度优先遍历算法；

3、在遍历算法的基础上设计其他应用算法。

-Data structures and seek a graph G from vertex i to vertex s simple path. Experiment: a master chart of the various storage structures, especially proficient adjacency matrix and adjacency list storage structure　2, master graph depth-first traversal and breadth-first traversal algorithm　3, the traversal algorithm based on the design of other applications algorithms.