Computes shortest paths from every vertex to the given set of landmark vertices. Note that this takes edge direction into account.
gf_shortest_paths(x, landmarks, ...)
An object coercable to a GraphFrame (typically, a gf_graphframe).
gf_graphframe
IDs of landmark vertices.
Optional arguments, currently not used.
# NOT RUN { g <- gf_friends(sc) gf_shortest_paths(g, landmarks = c("a", "d")) # }
Run the code above in your browser using DataCamp Workspace