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.
On 16.03.2015 08:43, Flavien Lambert wrote:
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?
In that case, only the first path found via BFS/Dijkstra is returned. Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>
Thanks, F. On Mon, 16 Mar 2015 at 15:49 Tiago de Paula Peixoto <tiago@skewed.de> wrote:
On 16.03.2015 08:43, Flavien Lambert wrote:
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?
In that case, only the first path found via BFS/Dijkstra is returned.
Best, Tiago
-- Tiago de Paula Peixoto <tiago@skewed.de>
_______________________________________________ graph-tool mailing list graph-tool@skewed.de http://lists.skewed.de/mailman/listinfo/graph-tool
participants (2)
-
Flavien Lambert -
Tiago de Paula Peixoto