...中有这样一个函数:[dist, path, pred] = graphshortestpath(G, S...答:0 path = 1 pred = 0 6 5 5 1 4 >> [dist,path,pred] = graphshortestpath(DG,1,2)dist = 1.3600 path = 1 5 4 6 2 pred = 0 6 5 5 1 4 >> [dist,path,pred] = graphshortestpath(DG,1,3)dist = 0.5300 path = 1 5...