On 02.10.2015 12:06, Christopher Morris wrote: > how does dist_map of graph_tool.topology.shortest_distance indicate > that two vertices are not connected. Is the value simply set to > 2147483647?
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
--
Tiago de Paula Peixoto <[email protected]>
signature.asc
Description: OpenPGP digital signature
_______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
