KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I want to replace the BGL iteration over vertexes or edges with pure C++11 equivalent. The BGL code (from: http://www.boost.org/doc/libs/1_52_0/libs/graph/doc/quick_tour.html ) is: typename boost::graph_traits<Graph>::out_edge_iterator out_i, out_end; typename boost::graph_traits<Graph>::edge_descriptor e; for (std::tie(out_i, out_end) = out_edges(v, g); out_i != out_end; ++out_i) { e = *out_i; Vertex src = source(e, g), targ = target(e, g); std::cout << "(" << name[get(vertex_id, src)] << "," << name[get(vertex_id, targ)] << ") "; } I tried several suggestions from here: Replace BOOST_FOREACH with "pure" C++11 alternative? but without luck. I want to be able to write something like: for (auto &e : out_edges(v, g)) { ... } or something like: for (std::tie(auto out_i, auto out_end) = out_edges(v, g); out_i != out_end; ++out_i) {...} Is it possible?
Tags (comma-separated)
Save Edits
Cancel