has_path equivalent in Graph-Tool

Question

Does graph-tool have any equivalent function to NetworkX's has_path? I'd like to return True if there's a valid path between any given nodes.

I did, but I couldn't find anything unfortunately. – ofey Sep 19 '18 at 21:43 — ofey, Sep 19 '18 at 21:43

score 1 · Accepted Answer · answered Sep 24 '18 at 08:33

1

This is trivially achieved by checking if there is a finite distance between two vertices:

   has_path = shortest_distance(g, u, v) < g.num_vertices()

answered Sep 24 '18 at 08:33

Tiago Peixoto

1 Answers1