Boost-users

Download

boost-users@lists.preview.boost.org

28291 discussions

What is wrong with the GLPL?
by Markus Werle 22 Nov '02

22 Nov '02

Hi! I just came across http://www.boost.org/more/lib_guide.htm#License where it is stated that any boost library license - Must be simple to read and understand. - Must grant permission to copy, use and modify the software for any use (commercial and non-commercial) for no fee. - Must require that the license appear on all copies of the software source code. - Must not require that the license appear with executables or other binary uses of the library. - Must not require that the source code be available for execution or other binary uses of the library. - May restrict the use of the name and description of the library to the standard version found on the Boost web site. At the same place one can find "Restricted licenses like the GPL and LGPL are not acceptable." I may have overlooked something, but I feel like the LGPL meets the requirements above. Could You please explain or point to further information about this issue. This is not intended as a political discussion (though it might turn to that) I am just trying to find the best free license model for my own yet-to-publish Expression Template Library. Thanks, Markus

1 0

Boost, VC++5 and PThreads-Win32 [newbee]
by Regis Desgroppes 22 Nov '02

22 Nov '02

Hello, I have to use Boost with VC++5 even if it this compiler isn't supposed to be supported. That's because we have a quite huge software developped with VC++5 and we don't have enough time to re-pass the entire test book (several hundreds of pages with 10 pixel-sized fonts). By disabling the #error directive in the compiler configuration hpp file, I'm surprised to see all seem to work fine. So my 1st question is : - Why such a #error directive ? Moreover, I have a POSIX.1c compliant threads implementation under WIN32 (PThreads Win32 downloaded from the RedHat site) that I want to use. So my 2nd question is : - What are the right minimum set of #define's I have to put (_REENTRANT, _POSIX_THREADS, BOOST_DISABLE_WIN32, etc.) ? Thank you very, very, much in advance, Best regards, Regis.

3 5

dijkstra_shortest_paths cannot manage <listS, listS...>?
by Ramón Casero Cañas 21 Nov '02

21 Nov '02

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

1 0

RE: [Boost-Users] more then 254 threads?
by Randy Bowen 21 Nov '02

21 Nov '02

The quote from the documentation on CreateThread for Windows 2000 is: The number of threads a process can create is limited by the available virtual memory. By default, every thread has one megabyte of stack space. Therefore, you can create at most 2028 threads. If you reduce the default stack size, you can create more threads. However, your application will have better performance if you create one thread per processor and build queues of requests for which the application maintains the context information. A thread would process all requests in a queue before processing requests in the next queue. For Windows operating systems, the design pattern suggested here is definitely preferable. Randy Bowen -----Original Message----- From: Eske Christiansen [mailto:eske@greennet.gl] Sent: Thursday, November 21, 2002 4:44 AM To: Boost-Users(a)yahoogroups.com Subject: SV: [Boost-Users] more then 254 threads? I came to to the same conclusion and it set me back a little. My ideer to create that many threads was to code a kind of AI Life, where each life square lives in its own thread. It was only to test how well the linux kernel handle the creation and delettion of many threads each second. So I will insted try to make a micro-thread system inside 255 threads and se how well the kernel scale. Does windows 2k and after have the same problems? yours eske > > Eske Christiansen said: >> Hej boost-users. >> >> I'm compiling a test thread program where I create 255 thread but I >> get an "Program received signal SIGABRT, Aborted." after thread 254 I >> running redhat 7.3 and using boost 1.28.00. Is it an OS problem or a >> boost problem? > > I find it strange that it stopped at 255 threads. Maximum number of > threads in linux is 1024 as defined by PTHREAD_THREADS_MAX in > /usr/include/bits/local_lim.h. With default stacksize you would have > allocated 500M of virtual memory, but I am not too sure if that would > result in thread creation failure. To quote the FAQ I posted a link to in my response: "D.10: My application needs to create thousands of threads, or maybe even more. Can I do this with LinuxThreads? No. You're going to run into several hard limits: * Each thread, from the kernel's standpoint, is one process. Stock Linux kernels (version 2.2 and earlier) are limited to at most 512 processes for the super-user, and half this number for regular users. This can be changed by changing NR_TASKS in include/linux/tasks.h and recompiling the kernel. On the x86 processors at least, architectural constraints seem to limit NR_TASKS to 4090 at most. (It seems that 2.4 kernels have higher limits, though.) * LinuxThreads contains a table of all active threads. This table has room for 1024 threads at most. To increase this limit, you must change PTHREAD_THREADS_MAX in the LinuxThreads/glibc sources and recompile. * By default, each thread reserves 2M of virtual memory space for its stack. This space is just reserved; actual memory is allocated for the stack on demand. But still, on a 32-bit processor, the total virtual memory space available for the stacks is on the order of 1G, meaning that more than 500 threads will have a hard time fitting in. You can overcome this limitation by moving to a 64-bit platform, or by allocating smaller stacks yourself using the setstackaddr attribute. * Finally, the Linux kernel contains many algorithms that run in time proportional to the number of process table entries. Increasing this number drastically will slow down the kernel operations noticeably. (Other POSIX threads libraries have similar limitations, by the way.) For all these reasons, you'd better restructure your application so that it doesn't need more than, say, 100 threads. For instance, in the case of a multithreaded server, instead of creating a new thread for each connection, maintain a fixed-size pool of worker threads that pick incoming connection requests from a queue." I can't begin to explain why PTHREADS_THREADS_MAX is set to 1024 by default, when there's either a 512 or 256 hard limit in the OS by default, but that's not really relevant. It appears he hit the 256 limit on the number of processes allowed for user accounts (since a thread in Linux is actually a process). William E. Kempf Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ Yahoo! Groups Sponsor ADVERTISEMENT Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

1 0

RE: [Boost-Users] more then 254 threads?
by schalk_cronje＠nai.com 21 Nov '02

21 Nov '02

Eske Christiansen said: > Hej boost-users. > > I'm compiling a test thread program where I create 255 thread but I get > an "Program received signal SIGABRT, Aborted." after thread 254 I > running redhat 7.3 and using boost 1.28.00. Is it an OS problem or a > boost problem? I find it strange that it stopped at 255 threads. Maximum number of threads in linux is 1024 as defined by PTHREAD_THREADS_MAX in /usr/include/bits/local_lim.h. With default stacksize you would have allocated 500M of virtual memory, but I am not too sure if that would result in thread creation failure.

3 2

stupid question
by acarsac 21 Nov '02

21 Nov '02

Hi, Just wondering the difference between library builded with Jam and library builded with specifics target compiler's makefiles. For sample I think about the regex lib under VC6 which gives with nmake -f vc6.mak : boost_regex_vc6_mss.lib boost_regex_vc6_sssd.lib boost_regex_vc6_sssd.pdb boost_regex_vc6_mssd.lib boost_regex_vc6_mssd.pdb boost_regex_vc6_mdid.lib boost_regex_vc6_mdid.dll boost_regex_vc6_mdid.pdb boost_regex_vc6_mdi.lib boost_regex_vc6_mdi.dll boost_regex_vc6_mds.lib boost_regex_vc6_mdsd.lib boost_regex_vc6_mdsd.pdb and Jam that will give us : boost_regex.dll boost_regex.lib boost_regex_debug.dll boost_regex_debug.lib This is because the boost config/*.hpp file does not let me the choice. only the makefiles library seems to work. Thanks in advance. Alex

3 2

bjam
by Chris Southern 21 Nov '02

21 Nov '02

hi, sorry if this is a really dumb question, but is bjam supposed to be useable to build things *with* boost as well as building boost itself? I can't spot the info on how to start that in the Boost.Build docs. Setting the path to the boost headers and the built boost libraries is what I'm stumbling over. TIA ChrisS.

2 1

johnson_all_pairs_shortest_paths() doesn't take my graph
by Ramón Casero Cañas 20 Nov '02

20 Nov '02

Hi, I'm using libbost1.28.0 (the one in Debian Sarge), with gcc version 2.95.4 20011002 (Debian prerelease). I can compile the libs/graph/example/johnson-eg.cpp example, or copy part of it's code to my function dnh.cpp and compile it. But if instead of the adjacency_list graph of the example, I try to pass my own Graph type to johnson's function, I get a large compiling error message. I'm quite new to this, but it seems to me as if the error is caused by the distance matrix, instead of the graph type. The code has some files, and I use a Makefile for the compilation. I thought that maybe the best way of allowing whoever wants to help me to check the error is making a tarball with the involved files. My graph definition is in header file steiner.hpp. steiner_io.hpp and steiner_io.cpp are read/write functions that can be compiled and seem to work well, and should be independent of the error. The compiling error is caused by line 117 of dnh.cpp. If the input variable g (my graph) is substituted by G (libboost example's graph), then the compilation goes fine. The compilation error log is in file "makelog". Regards, Ramón Casero. ---------- /usr/include/boost/graph/graph_concepts.hpp: In method `void boost::BasicMatrixConcept<int[6][6],void *,int>::constraints()': /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::BasicMatrixConcept<int[6][6],void *,int> >(boost::type<boost::BasicMatrixConcept<int[6][6],void *,int> > *)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:66: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/graph_concepts.hpp:449: invalid types `int[6][6][void *]' for array subscript /usr/include/boost/graph/graph_concepts.hpp: In method `void boost::BasicMatrixConcept<int[6][6],void *,int>::const_constraints(const int (&)[6][6])': /usr/include/boost/graph/graph_concepts.hpp:450: instantiated from `boost::BasicMatrixConcept<int[6][6],void *,int>::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::BasicMatrixConcept<int[6][6],void *,int> >(boost::type<boost::BasicMatrixConcept<int[6][6],void *,int> > *)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:66: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/graph_concepts.hpp:454: invalid types `const int[6][6][void *]' for array subscript /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:72: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /usr/include/boost/property_map.hpp: In method `void boost::ReadablePropertyMapConcept<int *,void *>::constraints()': /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::ReadablePropertyMapConcept<int *,void *> >(boost::type<boost::ReadablePropertyMapConcept<int *,void *> > *)' /usr/include/boost/property_map.hpp:209: instantiated from `boost::ReadWritePropertyMapConcept<int *,void *>::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::ReadWritePropertyMapConcept<int *,void *> >(boost::type<boost::ReadWritePropertyMapConcept<int *,void *> > *)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:117: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/property_map.hpp:157: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/property_map.hpp: In method `void boost::WritablePropertyMapConcept<int *,void *>::constraints()': /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::WritablePropertyMapConcept<int *,void *> >(boost::type<boost::WritablePropertyMapConcept<int *,void *> > *)' /usr/include/boost/property_map.hpp:210: instantiated from `boost::ReadWritePropertyMapConcept<int *,void *>::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::ReadWritePropertyMapConcept<int *,void *> >(boost::type<boost::ReadWritePropertyMapConcept<int *,void *> > *)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:117: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/property_map.hpp:186: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /usr/include/boost/graph/relax.hpp: In function `bool boost::relax<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>)': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:127: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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/bellman_ford_shortest_paths.hpp:127: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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/bellman_ford_shortest_paths.hpp: In function `bool boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:134: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:134: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:75: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' 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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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/graph/dijkstra_shortest_paths.hpp:201: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /usr/include/boost/graph/relax.hpp: In function `bool boost::relax<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::dummy_property_map, 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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >::tree_edge<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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 `boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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:204: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >::tree_edge<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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 `boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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:204: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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/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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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> > >)' /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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >::gray_target<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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 `boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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:204: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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 /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:82: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:82: invalid types `int[6][6][void *]' for array subscript [Non-text portions of this message have been removed]

1 1

more then 254 threads?
by Eske Christiansen 20 Nov '02

20 Nov '02

Hej boost-users. I'm compiling a test thread program where I create 255 thread but I get an "Program received signal SIGABRT, Aborted." after thread 254 I running redhat 7.3 and using boost 1.28.00. Is it an OS problem or a boost problem? yours eske

2 1

[Regex] Maybe bug?
by Yaroslav Govorunov 20 Nov '02

20 Nov '02

Hello, All! For example consider expression: (www\.)?(.+?)\.com When using match algorithm and try to match "www.somesite.com" $1 gets "www.somesite" but I thought it should be "somesite". Why (www\.)? is ignored even when non greedy repeats are used? With best regards, Yaroslav Govorunov, E-mail: slov(a)rsdn.ru http://www.rsdn.ru http://www.isapirewrite.com

2 1

Jump to page: