|
Boost Users : |
Subject: [Boost-users] Dijkstra example
From: David Doria (daviddoria_at_[hidden])
Date: 2011-06-06 18:32:33
I tried to modify this example:
http://www.boost.org/doc/libs/1_34_0/libs/graph/example/dijkstra-example.cpp
to create the graph in a clearer fashion:
http://codepad.org/DDKs45oe
However, I now get compiler errors inside dijkstra_shortest_paths.hpp
Can anyone see where I have gone wrong?
Also, I don't really understand the "distances and parents" output - I
just want to know the shortest path between two vertices. In fact I
don't even see the start and end vertices specified in the original
example?
Thanks,
David
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