Thanks. I added the vertex_color property to my graph and it works just fine. As a BGL (and not BCG :-)) novice I would like to understand why the breadth_first_search compiles for boost::adjacency_list with VertexType vecS, but not for boost::adjacency_list with VertexType listS (unless the colormap is passed as a parameter). Is there any piece of documentation I should have read and I did not? Or could anybody explain this for us, the big herd of users? Keep up the good work! Cristi --- In Boost-Users@y..., Jeremy Siek <jsiek@c...> wrote:

Hi Cristy,

On Wed, 21 Nov 2001 cristipp@i... wrote: cristi> I am trying to use the BCG as backbone for a ControlFlowGraph in a cristi> compiler project. It seems that I cannot use BCG for this task cristi> because of the follow contradicting (from BCG point of view) cristi> requirements:

What is BCG? I will assume you mean the boost::adjacency_list class.

cristi> 1. I want to be able to breadth_first_search through my graph. cristi> 2. I want to be able to keep descriptors to vertices 'for ever' so I cristi> can refer a specific vertex at any given time (for removal or cristi> whatever other reasons). cristi> cristi> To implement requirement 1 my adjacency_list should have its cristi> VertexList of type vecS.

This is not required. The VertexList can be listS. However, you do need to provide your own color map parameter if you use listS.

Cheers, Jeremy

-------------------------------------------------------------------- -- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@o... C++ Booster (http://www.boost.org) office phone: (812) 855-3608 -------------------------------------------------------------------- --

I've attached an example of using breadth_first_search with an adjacency_list where VertexList=listS. Cheers, Jeremy On Tue, 20 Nov 2001, Jeremy Siek wrote: jsiek> cristi> To implement requirement 1 my adjacency_list should have its jsiek> cristi> VertexList of type vecS. jsiek> jsiek> This is not required. The VertexList can be listS. However, you do need jsiek> to provide your own color map parameter if you use listS. ---------------------------------------------------------------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ---------------------------------------------------------------------- ---------- //======================================================================= // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee, // // This file is part of the Boost Graph Library // // You should have received a copy of the License Agreement for the // Boost Graph Library along with the software; see the file LICENSE. // If not, contact Office of Research, Indiana University, // Bloomington, IN 47405. // // Permission to modify the code and to distribute the code is // granted, provided the text of this NOTICE is retained, a notice if // the code was modified is included with the above COPYRIGHT NOTICE // and with the COPYRIGHT NOTICE in the LICENSE file, and that the // LICENSE file is distributed with the modified code. // // LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. // By way of example, but not limitation, Licensor MAKES NO // REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY // PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS // OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS // OR OTHER RIGHTS. //======================================================================= #include <boost/graph/adjacency_list.hpp> #include <boost/graph/breadth_first_search.hpp> #include <boost/pending/indirect_cmp.hpp> #include <boost/pending/integer_range.hpp> using namespace boost; template < typename TimeMap > class bfs_time_visitor:public default_bfs_visitor { typedef typename property_traits < TimeMap >::value_type T; public: bfs_time_visitor(TimeMap tmap, T & t):m_timemap(tmap), m_time(t) { } template < typename Vertex, typename Graph > void discover_vertex(Vertex u, const Graph & g) const { put(m_timemap, u, m_time++); } TimeMap m_timemap; T & m_time; }; int main() { using namespace boost; // Select the graph type we wish to use typedef adjacency_list < listS, listS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_discover_time_t, std::size_t> > > graph_t; // Set up the vertex IDs and names enum { r, s, t, u, v, w, x, y, N }; const char *name = "rstuvwxy"; // Specify the edges in the graph typedef std::pair < int, int >E; E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t), E(w, x), E(x, t), E(t, u), E(x, y), E(u, y) }; // Create the graph object const int n_edges = sizeof(edge_array) / sizeof(E); #ifdef BOOST_MSVC // VC++ has trouble with the edge iterator constructor graph_t g; std::vector<graph_traits<graph_t>::vertex_descriptor> verts; for (std::size_t i = 0; i < N; ++i) verts.push_back(add_vertex(g)); for (std::size_t j = 0; j < n_edges; ++j) add_edge(verts[edge_array[j].first], verts[edge_array[j].second], g); #else typedef graph_traits<graph_t>::vertices_size_type v_size_t; graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); #endif // Typedefs typedef graph_traits<graph_t>::vertex_descriptor Vertex; typedef graph_traits<graph_t>::vertices_size_type Size; typedef Size* Iiter; Size time = 0; typedef property_map<graph_t, vertex_discover_time_t>::type dtime_map_t; dtime_map_t dtime_map = get(vertex_discover_time, g); bfs_time_visitor < dtime_map_t > vis(dtime_map, time); breadth_first_search(g, vertex(s, g), color_map(get(vertex_color, g)). visitor(vis)); // a vector to hold the discover time property for each vertex std::vector < Size > dtime(num_vertices(g)); graph_traits<graph_t>::vertex_iterator vi, vi_end; std::size_t c = 0; for (tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi, ++c) dtime[c] = dtime_map[*vi]; // Use std::sort to order the vertices by their discover time std::vector<graph_traits<graph_t>::vertices_size_type > discover_order(N); 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])); std::cout << "order of discovery: "; for (int i = 0; i < N; ++i) std::cout << name[discover_order[i]] << " "; std::cout << std::endl; return EXIT_SUCCESS; } [Non-text portions of this message have been removed]