文件名称:12.7
介绍说明－－下载内容均来自于网络，请自行研究使用
设计一个算法，按照深度优先遍历的思想找出从指定结点出发，长度为M的所有简单路径。并将此算法用于邻接表类，在邻接表类中定义一个共有成员函数find(start, m)。-In adjlink to class with negative right value realization monosource shortest path function. Design an algorithm, according to traverse the depth first thoughts from specified node to find out, based on all of the simple length for M path. This algorithm is used for adjlink to class, defined in the class in adjlink to a mutual member function find (start, m).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
12.7\adjListGraph.h
....\graph.h
....\main.cpp
....\实验报告.docx
12.7
....\graph.h
....\main.cpp
....\实验报告.docx
12.7