path=[]
ifparent(d)~=0%ifthereisapath!
%path=[]
t=d
path=[d]
whilet~=s
p=parent(t)
path=[ppath]ifnetCostMatrix(t,farthestPreviousHop(t))<netCostMatrix(t,p)
farthestPreviousHop(t)=p
欢迎分享,转载请注明来源:内存溢出
path=[]
ifparent(d)~=0%ifthereisapath!
%path=[]
t=d
path=[d]
whilet~=s
p=parent(t)
path=[ppath]ifnetCostMatrix(t,farthestPreviousHop(t))<netCostMatrix(t,p)
farthestPreviousHop(t)=p
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)