Hi all, my apologies if the answer is in the doc, I did not find it. What
is the output of graph_tool.topology.shortest_path when several shortest
path are available between two vertices?
Best,
F.
attachment.html (262 Bytes)
Hi all, my apologies if the answer is in the doc, I did not find it. What
is the output of graph_tool.topology.shortest_path when several shortest
path are available between two vertices?
Best,
F.
attachment.html (262 Bytes)
In that case, only the first path found via BFS/Dijkstra is returned.
Best,
Tiago