Talk:Dijkstra's algorithm: Difference between revisions

== Single path / Path Tree ==

WP mentions the algorithm can produce a path tree, but discussions and examples tend to talk about single paths. I think it's fine for the task to ask for a single path solution, but now while it's in draft is the time for people to speak up for path trees if they like. Interestingly, Dijkstra's '59 paper doesn't mention path trees, but only the single path problem. (Problem 1 in the paper is a minimal spaning tree, which is something different.) —[[User:Sonia|Sonia]] 21:25, 6 February 2012 (UTC)