文件名称:data_struct7
介绍说明－－下载内容均来自于网络，请自行研究使用
数据结构课后设计题第七章
7.22③ 试基于图的深度优先搜索策略写一算法，
判别以邻接表方式存储的有向图中是否存在由顶
点vi到顶点vj的路径(i≠j)。 注意：算法中涉及
的图的基本操作必须在此存储结构上实现。
实现下列函数：
Status DfsReachable(ALGraph g, int i, int j) -Data structure design question after class Chapter 7.22 ③ test graph-based depth-first search strategy to write an algorithm to judge by adjacency list stored in a directed graph for the presence of from vertex vi to vertex vj of the path (i ≠ j). Note: The algorithm that the basic operations involved in the storage structure must be realized. To achieve the following functions: Status DfsReachable (ALGraph g, int i, int j)
7.22③ 试基于图的深度优先搜索策略写一算法，
判别以邻接表方式存储的有向图中是否存在由顶
点vi到顶点vj的路径(i≠j)。 注意：算法中涉及
的图的基本操作必须在此存储结构上实现。
实现下列函数：
Status DfsReachable(ALGraph g, int i, int j) -Data structure design question after class Chapter 7.22 ③ test graph-based depth-first search strategy to write an algorithm to judge by adjacency list stored in a directed graph for the presence of from vertex vi to vertex vj of the path (i ≠ j). Note: The algorithm that the basic operations involved in the storage structure must be realized. To achieve the following functions: Status DfsReachable (ALGraph g, int i, int j)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
data_struct7.txt