diff --git a/include/boost/graph/graph_test.hpp b/include/boost/graph/graph_test.hpp index eb822719..6ccec19b 100644 --- a/include/boost/graph/graph_test.hpp +++ b/include/boost/graph/graph_test.hpp @@ -3,12 +3,13 @@ #include #include -#include #include #include #include #include // for connects +#include + // UNDER CONSTRUCTION namespace boost { @@ -321,7 +322,14 @@ namespace boost { typedef typename property_map::const_type const_Map; const_Map pmap = get(PropertyTag(), g); typename std::vector::const_iterator i = vertex_prop.begin(); - BGL_FORALL_VERTICES_T(v, g, Graph) { + + for (typename boost::graph_traits::vertex_iterator + bgl_first_9 = vertices(g).first, bgl_last_9 = vertices(g).second; + bgl_first_9 != bgl_last_9; bgl_first_9 = bgl_last_9) + for (typename boost::graph_traits::vertex_descriptor v; + bgl_first_9 != bgl_last ? (v = *bgl_first_9, true) : false; + ++bgl_first_9) { + //BGL_FORALL_VERTICES_T(v, g, Graph) { typename property_traits::value_type pval1 = get(pmap, x), pval2 = get(Property(), g, x); BOOST_TEST(pval1 == pval2); @@ -336,7 +344,13 @@ namespace boost { typedef typename property_map::type PMap; PMap pmap = get(PropertyTag(), g); typename std::vector::const_iterator i = vertex_prop.begin(); - BGL_FORALL_VERTICES_T(v, g, Graph) + for (typename boost::graph_traits::vertex_iterator + bgl_first_9 = vertices(g).first, bgl_last_9 = vertices(g).second; + bgl_first_9 != bgl_last_9; bgl_first_9 = bgl_last_9) + for (typename boost::graph_traits::vertex_descriptor v; + bgl_first_9 != bgl_last ? (v = *bgl_first_9, true) : false; + ++bgl_first_9) + // BGL_FORALL_VERTICES_T(v, g, Graph) put(pmap, x, *i++); test_readable_vertex_property_graph(vertex_prop, tag, g);