This repository has been archived by the owner on Oct 8, 2021. It is now read-only.
"undirected" mode for shortest paths with directed graphs #1584
Comments
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Hi,
This is a follow up of this discussion.
Is there a way to efficiently find shortest paths in a directed graph while ignoring the direction of the edges ? (so without casting to a directed graph)
R seems to have an "undirected" mode for this.
The text was updated successfully, but these errors were encountered: