Hi,
given a vertex v, I want compute all shortest paths starting at v, i.e.,
I want a list of edge or vertex lists, or some kind of DAG. Of course
this can be easily solved by Dijkstra's Algorithm, but Graph-Tools
doesn't seem to provide the right interface for this problem.
Any ideas?
Best regards,
Chris