Undirected version of dijkstra shortest path on directed graph.
4 Feb
2013
4 Feb
'13
5:39 p.m.
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? Thanks in advance :)
4 Feb
4 Feb
8:08 p.m.
New subject: 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
4402
Age (days ago)
4402
Last active (days ago)
1 comments
2 participants
participants (2)
-
Jeremiah Willcock -
Jupp Tscheak