dijkstra_shortest_paths cannot manage <listS, listS...>?

21 Nov 2002

      ...
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, vertex_descriptor *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int>(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::n
o_property,boost::listS> &, void *, vertex_descriptor *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int, boost::dijkstra_visitorboost::null_visitor)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated 
from 
`boost::detail::dijkstra_dispatch2boost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated 
from 
`boost::detail::dijkstra_dispatch1boost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated 
from `boost::dijkstra_shortest_paths >(const 
steiner::SteinerGraph &, void *, const boost::bgl_named_params > &)'
/tmp/dijkstra-example.cpp:84:   instantiated from here
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:198: warning:
...
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, vertex_descriptor *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int>(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::n
o_property,boost::listS> &, void *, vertex_descriptor *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int, boost::dijkstra_visitorboost::null_visitor)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated 
from 
`boost::detail::dijkstra_dispatch2boost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated 
from 
`boost::detail::dijkstra_dispatch1boost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated 
from `boost::dijkstra_shortest_paths >(const 
steiner::SteinerGraph &, void *, const boost::bgl_named_params > &)'
/tmp/dijkstra-example.cpp:84:   instantiated from here
/usr/include/boost/property_map.hpp:133: warning: assignment to 
`unsigned int' from `void *const' lacks a cast
/usr/include/boost/graph/dijkstra_shortest_paths.hpp: In function `void 
boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, vertex_descriptor *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int>(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::n
o_property,boost::listS> &, void *, vertex_descriptor *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int, boost::dijkstra_visitorboost::null_visitor)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated 
from 
`boost::detail::dijkstra_dispatch2boost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated 
from 
`boost::detail::dijkstra_dispatch1boost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated 
from `boost::dijkstra_shortest_paths >(const 
steiner::SteinerGraph &, void *, const boost::bgl_named_params > &)'
/tmp/dijkstra-example.cpp:84:   instantiated from here
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:199: warning:
While trying to use this function, I got a large warning output (see the 
end of this message). The code is the same as in the 
dijkstra-example.cpp, but changing the adjacency_list to:

------------adjacency_list definition ------------------------

using namespace boost;

/* data structures definitions */
namespace boost {
   enum vertex_to_be_spanned_t { // used to mark vertices of W
     vertex_to_be_spanned
   };
   BOOST_INSTALL_PROPERTY(vertex, to_be_spanned);
}
namespace steiner {
   typedef std::pair Edge; // type of edges

   /* Steiner Problem Graph:
    *   - multigraph
    *   - add_edge(), ... stability and speed, bad space overhead
    *   - vertex indices, edge weights
    */
//   typedef int WeightType;
   typedef property  > 
VertexProperty;
   typedef property  EdgeProperty;
   typedef adjacency_list  SteinerGraph;
}

------------adjacency_list definition (end) ------------------------

Maybe I'm making some mistake that is obvious if you master the library, 
but I just don't understand what happens. I made some changes, to see 
what happended, and changing

   typedef adjacency_list boost::vertex_to_be_spanned_t,bool,boost::no_property 
passing `void *' to argument 2 of `put(int *, int, const int 
&)' lacks a cast
/usr/include/boost/property_map.hpp: In function `void 
put(vertex_descriptor *, int, void *const &)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:199:   instantiated 
from 
`boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property 
passing `void *' to argument 2 of `put(vertex_descriptor *, int, void *const &)' lacks a cast
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:201: warning: 
passing `void *' to argument 2 of `put(int *, int, const int 
&)' lacks a cast
/tmp/dijkstra-example.cpp: In function `int main(int, char **)':
/tmp/dijkstra-example.cpp:84: warning: passing `vertex_descriptor' to 
argument 2 of `boost::dijkstra_shortest_paths >(const 
steiner::SteinerGraph &, void *, const boost::bgl_named_params > &)' lacks a cast
/tmp/dijkstra-example.cpp:48: warning: unused variable `char name[6]'
/usr/include/boost/graph/relax.hpp: In function `bool 
boost::relaxboost::vertex_to_be_spanned_t,bool,boost::no_property
...
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, vertex_descriptor *, int *, boost::closed_plus<int>, less<int> >(boost::detail::edge_desc_impl, const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> &, boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>, vertex_descriptor *, int *, boost::closed_plus<int>, less<int>)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:103:   instantiated 
from 
`boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >::tree_edge, boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl, boost::a
djacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:51:   instantiated 
from 
`boost::BFSVisitorConceptboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requiresboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> > >(boost::typeboost::null_visitor,boost::mutable_qu
eue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> > > *)'
/usr/include/boost/graph/breadth_first_search.hpp:75:   instantiated 
from 
`boost::breadth_first_visitboost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:178:   instantiated 
from here
/usr/include/boost/graph/relax.hpp:69: warning: passing `void *' to 
argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/relax.hpp:69: warning: passing `void *' to 
argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:103:   instantiated 
from 
`boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >::tree_edge, boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl, boost::a
djacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:51:   instantiated 
from 
`boost::BFSVisitorConceptboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requiresboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> > >(boost::typeboost::null_visitor,boost::mutable_qu
eue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> > > *)'
/usr/include/boost/graph/breadth_first_search.hpp:75:   instantiated 
from 
`boost::breadth_first_visitboost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:178:   instantiated 
from here
/usr/include/boost/graph/relax.hpp:73: warning: passing `void *' to 
argument 2 of `put(int *, int, const int &)' lacks a cast
/usr/include/boost/graph/relax.hpp:74: warning: passing `void *' to 
argument 2 of `put(vertex_descriptor *, int, 
void *const &)' lacks a cast
/usr/include/boost/pending/indirect_cmp.hpp: In method `bool 
boost::indirect_cmp::operator ()(void 
*const &, void *const &) const':
/usr/include/boost/graph/detail/array_binary_tree.hpp:183: 
instantiated from `adstl::compare_array_node >,boost::indirect_cmp >::operator 
()boost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > >(const adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, const adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &)'
/usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/stl_algo.h:2520: 
   instantiated from `min_elementboost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >::children_type::iterator, adstl::compare_array_node >,boost::indirect_cmp > >(adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >::children_type::iterator, adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >::children_type::iterator, adstl::compare_array_node >,boost::indirect_cmp >)' /usr/include/boost/pending/mutable_heap.hpp:62:   instantiated from `boost::down_heapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node >,boost::indirect_cmp >, vector >(adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node >,boost::indirect_cmp >, vector &)'
/usr/include/boost/pending/mutable_heap.hpp:75:   instantiated from 
`boost::update_heapboost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node >,boost::indirect_cmp >, vector >(adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node >,boost::indirect_cmp >, vector &)'
/usr/include/boost/pending/mutable_queue.hpp:119:   instantiated from 
`boost::mutable_queue 
,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >::update(void *const &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:114:   instantiated 
from 
`boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >::gray_target, boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl, boost:
:adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:53:   instantiated 
from 
`boost::BFSVisitorConceptboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requiresboost::null_visitor,boost::mutable_queue >,boost::indirect_cmpboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> > >(boost::typeboost::null_visitor,boost::mutable_qu
eue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS> > > *)'
/usr/include/boost/graph/breadth_first_search.hpp:75:   instantiated 
from 
`boost::breadth_first_visitboost::vertex_to_be_spanned_t,bool,boost::no_property 
,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,boost::no_property,boost::listS> &, void *, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::property,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight_t,int,boost::no_property,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight_t,int,boost::no_property,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:178:   instantiated 
from here
/usr/include/boost/pending/indirect_cmp.hpp:59: warning: passing `void 
*const' to argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/pending/indirect_cmp.hpp:59: warning: passing `void 
*const' to argument 2 of `get<int>(const int *, int)' lacks a cast

dijkstra_shortest_paths cannot manage <listS, listS...>?

Ramón Casero Cañas