Graph - compiling with gcc-4.1.1
I have code utilizing the boost graph library. It has compiled fine for some time under gcc-3.x and fails on gcc-4.1.1 (x86-32). Pasted at the end of this message are the relevant compile errors. A quick google search reveals that two other folks have reported this same error (in different boost graph-using applications) with gcc-4.1 using different Linux distributions. My questions are: 1) Has this been reported here before? 2) If yes, has a patch been posted? My graph code lies beneath several layers of application code, so I wanted to check here before spending the time trying to build a simple test case which reproduces the error. Thanks. -TAG Todd A. Gibson /usr/include/boost/graph/depth_first_search.hpp: In function ‘void boost::depth_first_search(const VertexListGraph&, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<unsigned int, std::allocator<unsigned int> >, std::allocator<std::vector<unsigned int, std::allocator<unsigned int> > > >, P = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<unsigned int, std::allocator<unsigned int> > > >, T = boost::graph_visitor_t, R = boost::bgl_named_params<boost::identity_property_map, boost::vertex_index_t, boost::no_property>]’: /usr/include/boost/graph/topological_sort.hpp:64: instantiated from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<unsigned int, std::allocator<unsigned int> >, std::allocator<std::vector<unsigned int, std::allocator<unsigned int> > > >, OutputIterator = std::back_insert_iterator<std::vector<unsigned int, std::allocator<unsigned int> > >, P = boost::identity_property_map, T = boost::vertex_index_t, R = boost::no_property]’ /usr/include/boost/graph/transitive_closure.hpp:120: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::mapS, boost::vecS, boost::bidirectionalS, pygraph_templates::VertexAttrs, boost::property<boost::edge_index_t, int, pygraph_templates::EdgeAttrs>, boost::no_property, boost::listS>, GraphTC = boost::adjacency_list<boost::mapS, boost::vecS, boost::bidirectionalS, pygraph_templates::VertexAttrs, boost::property<boost::edge_index_t, int, pygraph_templates::EdgeAttrs>, boost::no_property, boost::listS>, G_to_TC_VertexMap = boost::iterator_property_map<unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, pygraph_templates::VertexAttrs, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, pygraph_templates::VertexAttrs, boost::no_property>, unsigned int>]’ /usr/include/boost/graph/transitive_closure.hpp:263: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = pygraph::DirAdjList, GraphTC = pygraph::DirAdjList]’ src/DirectedGraph.cpp:392: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:324: error: no matching function for call to ‘vertices(const std::vector<std::vector<unsigned int, std::allocator<unsigned int> >, std::allocator<std::vector<unsigned int, std::allocator<unsigned int> > > >&)’
participants (1)
-
Todd A. Gibson