boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-22 05:12:33 +00:00
Code Issues Projects Releases Wiki Activity

Merged Boost.Graph, Boost.Graph.Parallel, and Boost.PropertyMap changes from Boost trunk

Browse Source 
[SVN r85813]
This commit is contained in:
Jeremiah Willcock
2013-09-21 20:17:00 +00:00
parent 5e88d92265
commit 5922324c2b
115 changed files with 3392 additions and 321 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
example/implicit_graph.cpp
View File

@@ -527,10 +527,16 @@ int main (int argc, char const *argv[]) {
vertex_descriptor source = 0;
std::vector<vertex_descriptor> pred(num_vertices(g));
std::vector<edge_weight_map_value_type> dist(num_vertices(g));
iterator_property_map<std::vector<vertex_descriptor>::iterator,
property_map<ring_graph, vertex_index_t>::const_type>
pred_pm(pred.begin(), get(vertex_index, g));
iterator_property_map<std::vector<edge_weight_map_value_type>::iterator,
property_map<ring_graph, vertex_index_t>::const_type>
dist_pm(dist.begin(), get(vertex_index, g));
dijkstra_shortest_paths(g, source,
predecessor_map(&pred[0]).
distance_map(&dist[0]) );
predecessor_map(pred_pm).
distance_map(dist_pm) );
std::cout << "Dijkstra search from vertex " << source << std::endl;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) {