
13 Oct
2009
13 Oct
'09
8:18 p.m.
On Tue, 13 Oct 2009, Shyamendra Solanki wrote:
I would think it would pick the first edge with the same weight as the edge on the optimal path; does it do something else?
well, it can pick any edge if that is the shortest path to its endpoint vertex. this edge need not be in shortest paths to all vertex.
What do you mean? I think the algorithm I suggested would give a shortest path tree from each source vertex. Is there something I'm misunderstanding?
I think I'll use a patched version as you suggested. Thanks Jeremiah.
OK. -- Jeremiah Willcock