"undirected" mode for shortest paths with directed graphs

[etiennedeg]

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.