Label correcting algorithm for shortest path
2 次查看(过去 30 天)
显示 更早的评论
Can any body provide a code for label correcting algorithm for shortest path. Thankyou!
6 个评论
Walter Roberson
2013-5-27
LIST = [1]; %initialize
...
i = LIST(1); %take out element
LIST(1) = [];
...
if ~ismember(j, LIST); LIST(end+1) = j; end %add j if it is not there
回答(1 个)
Image Analyst
2013-5-26
Perhaps Steve's blog would be helpful to you: http://blogs.mathworks.com/steve/2011/11/01/exploring-shortest-paths-part-1/
0 个评论
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Logical 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!