Description: 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).
To Search:
File list (Check if you may need any files):
12.7\adjListGraph.h
....\graph.h
....\main.cpp
....\实验报告.docx
12.7
Download