实验一 求最短路径问题
求图14.9所示的有向网络中自点1到点6的最短有向图。
程序如下：
结果为
;
所以最短路径是10，路径为;1-4-5-6。
本文来源：https://www.2haoxitong.net/k/doc/fc2c23f959fafab069dc5022aaea998fcc224098.html
文档为doc格式
![](https://wkrtcs.bdimg.com/rtcs/image?w=509.33333333333&md5sum=acf5176ab0b92a1b8e1a7881dfb9180b&sign=360dcb98d6&rtcs_flag=1&rtcs_ver=4&l=webapp&bucketNum=160&ipr={"t":"img","w":"509.33333333333","h":"512","dataType":"gif","c":"word/media/image1.gif"})
![](https://wkrtcs.bdimg.com/rtcs/image?w=464.73333333333&md5sum=acf5176ab0b92a1b8e1a7881dfb9180b&sign=360dcb98d6&rtcs_flag=1&rtcs_ver=4&l=webapp&bucketNum=160&ipr={"t":"img","w":"464.73333333333","h":"364.86666666667","dataType":"png","c":"word/media/image2.png","imgOriW":481,"imgOriH":378})
结果为
