New subject: johnson_all_pairs_shortest_paths() doesn't take my graph (files)

20 Nov 2002

      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::constraints()':
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requires >(boost::type > *)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:66:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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::const_constraints(const int (&)[6][6])':
/usr/include/boost/graph/graph_concepts.hpp:450:   instantiated from `boost::BasicMatrixConcept::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requires >(boost::type > *)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:66:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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, const int &)' lacks a cast
/usr/include/boost/property_map.hpp: In method `void boost::ReadablePropertyMapConcept::constraints()':
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requires >(boost::type > *)'
/usr/include/boost/property_map.hpp:209:   instantiated from `boost::ReadWritePropertyMapConcept::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requires >(boost::type > *)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:117:   instantiated from `boost::bellman_ford_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated from `boost::detail::bellman_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, const boost::bgl_named_params &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated from `boost::bellman_ford_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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::constraints()':
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requires >(boost::type > *)'
/usr/include/boost/property_map.hpp:210:   instantiated from `boost::ReadWritePropertyMapConcept::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requires >(boost::type > *)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:117:   instantiated from `boost::bellman_ford_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated from `boost::detail::bellman_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, const boost::bgl_named_params &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated from `boost::bellman_ford_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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, const int &)' lacks a cast
/usr/include/boost/graph/relax.hpp: In function `bool boost::relaxboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::adj_list_edge_property_mapboost::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, const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, boost::adj_list_edge_property_mapboost::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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated from `boost::detail::bellman_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, const boost::bgl_named_params &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated from `boost::bellman_ford_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated from `boost::detail::bellman_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, const boost::bgl_named_params &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated from `boost::bellman_ford_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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, const int &)' lacks a cast
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function `bool boost::bellman_ford_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitorboost::null_visitor)':
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated from `boost::detail::bellman_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, int *, const boost::bgl_named_params &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated from `boost::bellman_ford_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated from `boost::detail::dijkstra_dispatch2boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated from `boost::detail::dijkstra_dispatch1boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated from `boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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, const int &)' lacks a cast
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:201: warning: passing `void *' to argument 2 of `put(int *, int, const int &)' lacks a cast
/usr/include/boost/graph/relax.hpp: In function `bool boost::relaxboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::adj_list_edge_property_mapboost::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, const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, boost::adj_list_edge_property_mapboost::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_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl, boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:51:   instantiated from `boost::BFSVisitorConceptboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requiresboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> > >(boost::typeboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_initboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:204:   instantiated from `boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated from `boost::detail::dijkstra_dispatch2boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated from `boost::detail::dijkstra_dispatch1boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated from `boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl, boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:51:   instantiated from `boost::BFSVisitorConceptboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requiresboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> > >(boost::typeboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_initboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:204:   instantiated from `boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated from `boost::detail::dijkstra_dispatch2boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated from `boost::detail::dijkstra_dispatch1boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated from `boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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, const int &)' lacks a cast
/usr/include/boost/pending/indirect_cmp.hpp: In method `bool boost::indirect_cmp::operator ()(void *const &, void *const &) const':
/usr/include/boost/graph/detail/array_binary_tree.hpp:183:   instantiated from `adstl::compare_array_node >,boost::indirect_cmp >::operator ()boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > >(const adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, const adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_elementboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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 >,boost::indirect_cmp > >(adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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 >,boost::indirect_cmp >)'
/usr/include/boost/pending/mutable_heap.hpp:62:   instantiated from `boost::down_heapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node >,boost::indirect_cmp >, vector >(adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node >,boost::indirect_cmp >, vector &)'
/usr/include/boost/pending/mutable_heap.hpp:75:   instantiated from `boost::update_heapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node >,boost::indirect_cmp >, vector >(adstl::array_binary_tree_nodeboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node >,boost::indirect_cmp >, vector &)'
/usr/include/boost/pending/mutable_queue.hpp:119:   instantiated from `boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl, boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:53:   instantiated from `boost::BFSVisitorConceptboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from `boost::function_requiresboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> > >(boost::typeboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitorboost::null_visitor,boost::mutable_queue >,boost::indirect_cmp,boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_mapboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_initboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:204:   instantiated from `boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::dijkstra_visitorboost::null_visitor, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_visitorboost::null_visitor)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated from `boost::detail::dijkstra_dispatch2boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated from `boost::detail::dijkstra_dispatch1boost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated from `boost::dijkstra_shortest_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params >(const boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_paramsboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params > &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80:   instantiated from `boost::detail::johnson_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_implboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight2_t>, int>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_edge_property_mapboost::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_dispatchboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &, boost::adj_list_edge_property_mapboost::edge_weight2_t,int,boost::no_property >,boost::edge_weight_t>, boost::adj_list_vertex_property_mapboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_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_pathsboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::edge_weight2_t,int,boost::no_property >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from `steiner::dnh<WeightType>(boost::adjacency_listboost::vertex_to_be_spanned_t,bool,boost::no_property >,boost::propertyboost::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]

johnson_all_pairs_shortest_paths() doesn't take my graph

Ramón Casero Cañas

Ramón Casero Cañas

tags

participants (1)