摘要
本文给出了应用计算机寻找加权有向图中任意两点间的路径总数、每一条路径顺次经过的结点序号及每一条路径的权的求解方法。
A computer solution of paths on the graph with direction and weight is presented in this paper, finding all paths between arbitrary two nodes, the ordinal number of the nodes passed in order and the weight of the paths.
