New-WinRAR-ZIP-archive
于 2011-04-04 发布
文件大小:1KB
0 81
下载积分: 1
下载次数: 33
代码说明：
Bellman-Ford Shortest Path Algorithm (C) 2004 by Yu Hen Hu find shortest path from a fixed point U to any node V clear all n=input( Total number of nodes = ) echo on starting from a fixed point U, you enter the weight to each node as the weight on the edge from U to that node V if there is no such edge, enter inf when enter a vector, put all number within brackets [ ] echo off
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
