Does igraph has "has_path" function?

Question

I am trying to port code from python NetworkX to R igraph. In NetworkX there is a function with the name has_path that finds if two vertices have a path. I want to find in an efficient way all the vertices of a graph that don't have an edge between them but they have a path.

Answer 1

I think you can use the code below to check if there is a path from vertex V1 to V2 (the graph can be directed or undirected)

c(!is.infinite(distances(g, V1, V2, mode = "out")))