graph_tool.topology.shortest_distance with disconnected graphs

graph-tool
1

Hi,|

how does dist_map of graph_tool.topology.shortest_distance indicate

that two vertices are not connected. Is the value simply set to 2147483647?|

attachment.html (3.74 KB)

2

Yes. More precisely, it is set to the largest possible "int32".

A simple check to test if two vertices are unreachable is:

    shortest_distance(g, u, v) >= g.num_vertices()

Best,
Tiago