boost_mirror/graph
1
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2025-05-11 13:24:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

replaced use of iterators with the use of pointers to avoid problems when the iterators

Browse Source 
are STLport iterators


[SVN r9976]
This commit is contained in:
Jeremy Siek 2001-04-24 14:19:07 +00:00
parent d869963bf3
commit 1f8de0f4da
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
example/vector_as_graph.cpp
View File

@ -60,14 +60,14 @@ int main()
g[y].push_back(u);
vector<default_color_type> color(N, white(default_color_type()));
vector<int> discover(N), finish(N);
typedef vector<int>::iterator iter_t;
vector<Graph::size_type> discover(N), finish(N);
typedef Graph::size_type* ptr_t;
int time = 0;
breadth_first_search
(g, int(s),
visitor(make_bfs_visitor(make_pair(stamp_times(discover.begin(), time,
visitor(make_bfs_visitor(make_pair(stamp_times(&discover[0], time,
on_discover_vertex()),
stamp_times(finish.begin(), time,
stamp_times(&finish[0], time,
on_finish_vertex())))).
color_map(&color[0]));
@ -79,7 +79,7 @@ int main()
boost::integer_range<int> ir(0,N);
copy(ir.begin(), ir.end(), discover_order.begin());
sort(discover_order.begin(), discover_order.end(),
indirect_cmp<iter_t, less<int> >(discover.begin()));
indirect_cmp<ptr_t, less<int> >(&discover[0]));
for (int i = 0; i < N; ++i)
std::cout << name[ discover_order[i] ] << " ";
@ -91,7 +91,7 @@ int main()
vector<Graph::size_type> finish_order(N);
copy(ir.begin(), ir.end(), finish_order.begin());
sort(finish_order.begin(), finish_order.end(),
indirect_cmp<iter_t, less<int> >(finish.begin()));
indirect_cmp<ptr_t, less<int> >(&finish[0]));
for (int j = 0; j < N; ++j)
std::cout << name[ finish_order[j] ] << " ";