DJ流程图
2018-11-26 14:33:44 0 举报
狄杰斯特拉算法流程图
作者其他创作
大纲/内容
Let U include Vi &delete Vi from S
less
Choose node that has the minimum weight.
no change
Initial：U={V0}，S={other nodes}
unfit
fit
end
no
If there is an edge from V0 to Vi in S
if set U includes all node
U=∅，S={all the nodes}
unless
update it's weight
0 条评论
回复 删除
下一页
