boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-22 17:22:29 +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

11
example/bfs-example.cpp
View File

@@ -54,15 +54,18 @@ main()
#endif
// Typedefs
typedef graph_traits < graph_t >::vertex_descriptor Vertex;
typedef graph_traits < graph_t >::vertices_size_type Size;
typedef Size* Iiter;
// a vector to hold the discover time property for each vertex
std::vector < Size > dtime(num_vertices(g));
typedef
iterator_property_map<std::vector<Size>::iterator,
property_map<graph_t, vertex_index_t>::const_type>
dtime_pm_type;
dtime_pm_type dtime_pm(dtime.begin(), get(vertex_index, g));
Size time = 0;
bfs_time_visitor < Size * >vis(&dtime[0], time);
bfs_time_visitor < dtime_pm_type >vis(dtime_pm, time);
breadth_first_search(g, vertex(s, g), visitor(vis));
// Use std::sort to order the vertices by their discover time
@@ -70,7 +73,7 @@ main()
integer_range < int >range(0, N);
std::copy(range.begin(), range.end(), discover_order.begin());
std::sort(discover_order.begin(), discover_order.end(),
indirect_cmp < Iiter, std::less < Size > >(&dtime[0]));
indirect_cmp < dtime_pm_type, std::less < Size > >(dtime_pm));
std::cout << "order of discovery: ";
for (int i = 0; i < N; ++i)