Description: Single-source shortest path problem requires the dynamic programming algorithm input: the number of nodes n, the adjacency table node data output requirements: the first line: the origin of t s to the end of the second line of the shortest path length: one of the shortest path, such as : 6 5 3 1 0 third line: the shortest path of the second, ...
To Search:
File list (Check if you may need any files):
动态规划-130572\Debug\算法2.1.exe
...............\.....\算法2.1.ilk
...............\.....\算法2.1.pdb
...............\算法2.1\2.3.cpp
...............\.......\Debug\2.3.obj
...............\.......\.....\BuildLog.htm
...............\.......\.....\mt.dep
...............\.......\.....\vc90.idb
...............\.......\.....\vc90.pdb
...............\.......\.....\算法2.1.exe.intermediate.manifest
...............\.......\算法2.1.vcproj
...............\.......\算法2.1.vcproj.MOMO-PC.MOMO.user
...............\算法2.1.ncb
...............\算法2.1.sln
...............\算法2.1.suo
...............\.......\Debug
...............\Debug
...............\算法2.1
动态规划-130572
Download