Hi,
thank you very much. Is it somehow possible to obtain a successor
relation instead of a predecessor relation?
Best regards,
Chris
Am 16.08.2015 um 16:17 schrieb Tiago de Paula Peixoto:
Hi,
A much faster way is to use shortest_distance() to return a predecessor
map:
dist, pred = shortest_distance(g, source=v, pred_map=True)
The "pred" map contains for each vertex reachable from v the predecessor
node in the BFS (or Dijkstra if weighted) tree.
Best,
Tiago
On 16.08.2015 16:00, Christopher Morris wrote:
Okay, I'm sorry, seems to be solved by dijkstra_search(...).
On 16.08.2015 15:56, Christopher Morris wrote:
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
_______________________________________________
graph-tool mailing list
[email protected]
http://lists.skewed.de/mailman/listinfo/graph-tool
_______________________________________________
graph-tool mailing list
[email protected]
http://lists.skewed.de/mailman/listinfo/graph-tool
_______________________________________________
graph-tool mailing list
[email protected]
http://lists.skewed.de/mailman/listinfo/graph-tool
_______________________________________________
graph-tool mailing list
[email protected]
http://lists.skewed.de/mailman/listinfo/graph-tool
