Re: [Boost-users] Undirected version of dijkstra shortest path on directed graph.

On Mon, 4 Feb 2013, Jupp Tscheak wrote:

Hello BGL specialists.

Is it possible to use an undirected version of dijkstra shortest path function on an adjacency_list which Directed template parameter is set to bidirectional?

Yes, as long as the edge weights are the same in both directions. If the weights match, the directed Dijkstra's algorithm will produce the same effect as the undirected one. -- Jeremiah Willcock