Boost logo

Boost Users :

Subject: [Boost-users] Regarding dijkstra_shortest_path() in boost graph library
From: Rohith Reddy (rohithrockzzz_at_[hidden])
Date: 2015-08-20 13:45:18

Hello there,
        I started using Boost graph library recently for one of my
projects.I was trying to implement dijkstra's shortest path algorithm with
the help of the following function,

    (G, vertex(a, G),
     distance_map(make_iterator_property_map(distance.begin(), vertex_id,
     predecessor_map(make_iterator_property_map(parent.begin(), vertex_id,
     visitor(make_dijkstra_visitor(copy_graph(G_copy, on_examine_edge()))));

But while comparing the definition of the function as in,
to the above written function,it doesnt make sense,

especially the third argument of the above written function.Can anyone
help me with this?

Thanks in advance.

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at