数学建模实战8 (图论最短路径问题)
图论最短路径问题一.题目一.题目s=[1,1,1,2,3,3,5,5,5,5,6,6,7,9,9];t=[2,4,3,5,2,4,4,6,7,8,5,7,8,5,8];w=[6,1,3,1,2,2,6,4,3,6,10,2,4,2,3]; G=digraph(s,t,w); plot(G,'EdgeLabel',G.Edges.Weight,'linewidth',2) [p,d]=shortestpath(G,1,8)额。。。。。没啥技术含量...
复制链接