Representing a Tree in Python

[Piet van Oostrum]

>>>>> godshorse <chinthakawk at gmail.com> (g) wrote:

>g> Hello,
>g> I want to find out the shortest path tree from a root to several nodes
>g> in a graph data structure. I found a Dijkstra code from internet that
>g> finds shortest path between only two nodes. How can i extend it to a
>g> tree?. And what is the best way to represent a tree in Python?.

http://networkx.lanl.gov/ has all kinds of Dijkstra's algorithms.
-- 
Piet van Oostrum <piet at cs.uu.nl>
URL: http://pietvanoostrum.com [PGP 8DAE142BE17999C4]
Private email: piet at vanoostrum.org