文件名称:The-shortest-path
介绍说明－－下载内容均来自于网络，请自行研究使用
用贪心法和动态规划两种算法求解有向图任意两个节点之间的最短路径，要求给出最短路径的值以及中间路径。-Greedy method and dynamic programming algorithm to solve the two have to figure the shortest path between any two nodes, required to give the value of the shortest path and the middle path.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
U200814557 龚伟
...............\~$实验报告.doc
...............\单源点.c
...............\算法实验- 动态规划.c