Hello,

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

Thank you,
-- 
http://mail.python.org/mailman/listinfo/python-list

Reply via email to