search

sbromberger / LightGraphs.jl

An optimized graphs package for the Julia programming language
Other
670 stars 185 forks source link

"undirected" mode for shortest paths with directed graphs #1584

Open etiennedeg opened 2 years ago

etiennedeg commented 2 years ago

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.