|
Boost Users : |
Subject: [Boost-users] Undirected version of dijkstra shortest path on directed graph.
From: Jupp Tscheak (jupp.tscheak_at_[hidden])
Date: 2013-02-04 12:39:13
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 :)
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net