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

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<int,int> 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 <vertex_index_t, int,
                     property <vertex_to_be_spanned_t, bool> > 
VertexProperty;
   typedef property <edge_weight_t, int> EdgeProperty;
   typedef adjacency_list <listS, listS, undirectedS,
                           VertexProperty, EdgeProperty > 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 <listS, listS, undirectedS,

for

   typedef adjacency_list <listS, vecS, undirectedS,


seems to work. At least, the warning messages disappear when compiling.

Regards,

Ramón Casero.

PS. I copied the dijkstra-example.cpp file to /tmp, edited it to change 
the adjacency_list definition, and compiled with
g++ -o /tmp/dijkstra -pedantic -Wall -g -ftemplate-depth-50 -O2 
-lboost_thread -lstlport -lm -lefence -g /tmp/dijkstra-example.cpp

I'm using gcc version 2.95.4 20011002 (Debian prerelease) in Debian Sarge.


------------------ warning ---------------------
/tmp/dijkstra-example.cpp: In function `int main(int, char **)':
/tmp/dijkstra-example.cpp:73: warning: initialization to 
`vertex_descriptor' from `void *' lacks a cast 
/usr/include/boost/graph/dijkstra_shortest_paths.hpp: In function `void 
boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > boost::dijkstra_visitor<boost::null_visitor>, vertex_descriptor *, int *, 
 >boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::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_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::n
 
o_property,boost::listS> &, void *, vertex_descriptor *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_visitor<boost::null_visitor>)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated 
from 
`boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int 
 >&,void *,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t>, boost::bgl_named_params<int 
 >*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
 >*,boost::vertex_predecessor_t,boost::no_property> > >(const 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t
 
,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t>, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated 
from 
`boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int 
 >&,void *,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t>, boost::bgl_named_params<int 
 >*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
 >*,boost::vertex_predecessor_t,boost::no_property> > >(const 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t
 
,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t>, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated 
from `boost::dijkstra_shortest_paths<steiner::SteinerGraph, int *, 
boost::vertex_distance_t, boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> >(const 
steiner::SteinerGraph &, void *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/tmp/dijkstra-example.cpp:84:   instantiated from here
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:198: warning: 
passing `void *' to argument 2 of `put<int, int>(int *, int, const int 
&)' lacks a cast
/usr/include/boost/property_map.hpp: In function `void 
put<vertex_descriptor, void *>(vertex_descriptor *, int, void *const &)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:199:   instantiated 
from 
`boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > boost::dijkstra_visitor<boost::null_visitor>, vertex_descriptor *, int *, 
 >boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::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_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::n
 
o_property,boost::listS> &, void *, vertex_descriptor *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_visitor<boost::null_visitor>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated 
from 
`boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int 
 >&,void *,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t>, boost::bgl_named_params<int 
 >*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
 >*,boost::vertex_predecessor_t,boost::no_property> > >(const 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t
 
,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t>, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated 
from 
`boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int 
 >&,void *,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t>, boost::bgl_named_params<int 
 >*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
 >*,boost::vertex_predecessor_t,boost::no_property> > >(const 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t
 
,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t>, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated 
from `boost::dijkstra_shortest_paths<steiner::SteinerGraph, int *, 
boost::vertex_distance_t, boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> >(const 
steiner::SteinerGraph &, void *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/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_paths<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > boost::dijkstra_visitor<boost::null_visitor>, vertex_descriptor *, int *, 
 >boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::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_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::n
 
o_property,boost::listS> &, void *, vertex_descriptor *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_visitor<boost::null_visitor>)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated 
from 
`boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int 
 >&,void *,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t>, boost::bgl_named_params<int 
 >*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
 >*,boost::vertex_predecessor_t,boost::no_property> > >(const 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t
 
,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t>, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated 
from 
`boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int 
 >&,void *,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 > 
 >boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t>, boost::bgl_named_params<int 
 >*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
 >*,boost::vertex_predecessor_t,boost::no_property> > >(const 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t
 
,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,
 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t>, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated 
from `boost::dijkstra_shortest_paths<steiner::SteinerGraph, int *, 
boost::vertex_distance_t, boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> >(const 
steiner::SteinerGraph &, void *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)'
/tmp/dijkstra-example.cpp:84:   instantiated from here
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:199: warning: 
passing `void *' to argument 2 of `put<vertex_descriptor, void 
*>(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>(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<steiner::SteinerGraph, int 
*, boost::vertex_distance_t, boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> >(const 
steiner::SteinerGraph &, void *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::bgl_named_params<unsigned int 
*,boost::vertex_predecessor_t,boost::no_property> > &)' lacks a cast
/tmp/dijkstra-example.cpp:48: warning: unused variable `char name[6]'
/usr/include/boost/graph/relax.hpp: In function `bool 
boost::relax<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::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<boost::directed_tag,void *>, const 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > &, boost::adj_list_edge_property_map<boost::directed_tag,int,const int 
 >&,void *,const 
 >boost::property<boost::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_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>::tree_edge<boost::detail::edge_desc_impl<boost::directed_tag,void *>, 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > >(boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost::a
 
djacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 &)'
/usr/include/boost/graph/breadth_first_search.hpp:51:   instantiated 
from 
`boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > > 
 >>(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_qu
 
eue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int 
*,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 int *,int *,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_visit<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > boost::mutable_queue<void *,vector<void *,allocator<void *> 
 >>,boost::indirect_cmp<int *,less<int> 
 >>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> >, 
 >boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 > *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t,int,bo
 
ost::no_property>,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 int *,int *,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 >,boost::property<boost::ed
 
ge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &, void *, 
boost::mutable_queue<void *,vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t> > &, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 >,boost::property<boost::edge_weight_t,int,boost::no_property
 
>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
>*,const 
>boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
> int *,int *,boost::closed_plus<int>,less<int> >, 
>boost::iterator_property_map<boost::default_color_type 
>*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
> 
>>,boost::property<boost::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_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>::tree_edge<boost::detail::edge_desc_impl<boost::directed_tag,void *>, 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > >(boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost::a
 
djacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 &)'
/usr/include/boost/graph/breadth_first_search.hpp:51:   instantiated 
from 
`boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > > 
 >>(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_qu
 
eue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int 
*,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 int *,int *,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_visit<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > boost::mutable_queue<void *,vector<void *,allocator<void *> 
 >>,boost::indirect_cmp<int *,less<int> 
 >>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> >, 
 >boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 > *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t,int,bo
 
ost::no_property>,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 int *,int *,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 >,boost::property<boost::ed
 
ge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &, void *, 
boost::mutable_queue<void *,vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t> > &, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 >,boost::property<boost::edge_weight_t,int,boost::no_property
 
>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
>*,const 
>boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
> int *,int *,boost::closed_plus<int>,less<int> >, 
>boost::iterator_property_map<boost::default_color_type 
>*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
> 
>>,boost::property<boost::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>(int *, int, const int &)' lacks a cast
/usr/include/boost/graph/relax.hpp:74: warning: passing `void *' to 
argument 2 of `put<vertex_descriptor, void *>(vertex_descriptor *, int, 
void *const &)' lacks a cast
/usr/include/boost/pending/indirect_cmp.hpp: In method `bool 
boost::indirect_cmp<int *,less<int> >::operator ()<void *, void *>(void 
*const &, void *const &) const':
/usr/include/boost/graph/detail/array_binary_tree.hpp:183: 
instantiated from `adstl::compare_array_node<vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >::operator 
()<adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> > >(const adstl::array_binary_tree_node<void 
 >**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> > &, const adstl::array_binary_tree_node<void 
 >**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::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_element<adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::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<vector<void *,allocator<void *> 
 >>,boost::indirect_cmp<int *,less<int> > > 
 >>(adstl::array_binary_tree_node<void 
 >**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::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_node<void 
 >**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t,int,boost::no_prop
 
erty>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>::children_type::iterator, adstl::compare_array_node<vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >)' 
/usr/include/boost/pending/mutable_heap.hpp:62:   instantiated from 
`boost::down_heap<adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t> >, adstl::compare_array_node<vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >, vector<unsigned 
int,allocator<unsigned int> > >(adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<bo
 
ost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t> >, adstl::compare_array_node<vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >, vector<unsigned 
int,allocator<unsigned int> > &)'
/usr/include/boost/pending/mutable_heap.hpp:75:   instantiated from 
`boost::update_heap<adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> >, adstl::compare_array_node<vector<void 
 >*,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >, 
 >vector<unsigned int,allocator<unsigned int> > 
 >>(adstl::array_binary_tree_node<void 
 >**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> >, adstl::compare_array_node<vector<void 
 >*,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >, 
 >vector<unsigned int,allocator<unsigned int> > &)'
/usr/include/boost/pending/mutable_queue.hpp:119:   instantiated from 
`boost::mutable_queue<void *,vector<void *,allocator<void *> 
 >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::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_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>::gray_target<boost::detail::edge_desc_impl<boost::directed_tag,void *>, 
 >boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > >(boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost:
 
:adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 &)'
/usr/include/boost/graph/breadth_first_search.hpp:53:   instantiated 
from 
`boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> 
 >>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
 >*,const 
 >boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 > int *,int *,boost::closed_plus<int>,less<int> 
 >>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>
 > > 
 >>(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_qu
 
eue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int 
*,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 int *,int *,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_visit<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
 >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,
 > boost::mutable_queue<void *,vector<void *,allocator<void *> 
 >>,boost::indirect_cmp<int *,less<int> 
 >>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > 
 >>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 > int &,boost::vertex_index_t> >, 
 >boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 > *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
 >>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 > >,boost::property<boost::edge_weight_t,int,bo
 
ost::no_property>,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
 int *,int *,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::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_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 >,boost::property<boost::ed
 
ge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &, void *, 
boost::mutable_queue<void *,vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const
 int &,boost::vertex_index_t> > &, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 >,boost::property<boost::edge_weight_t,int,boost::no_property
 
>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>>,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void 
>*,const 
>boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned
> int *,int *,boost::closed_plus<int>,less<int> >, 
>boost::iterator_property_map<boost::default_color_type 
>*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
> 
>>,boost::property<boost::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





------------------------ Yahoo! Groups Sponsor ---------------------~-->
Get 128 Bit SSL Encryption!
http://us.click.yahoo.com/CBxunD/vN2EAA/xGHJAA/EbFolB/TM
---------------------------------------------------------------------~->

Info: <http://www.boost.org>
Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl>
Unsubscribe: <mailto:boost-users-unsubscribe@xxxxxxxxxxxxxxx>
 

Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/