johnson_all_pairs_shortest_paths() doesn't take my graph

Hi, I'm using libbost1.28.0 (the one in Debian Sarge), with gcc version 
2.95.4 20011002 (Debian prerelease).

I can compile the libs/graph/example/johnson-eg.cpp example, or copy 
part of it's code to my function dnh.cpp and compile it. But if instead 
of the adjacency_list graph of the example, I try to pass my own Graph 
type to johnson's function, I get a large compiling error message. I'm 
quite new to this, but it seems to me as if the error is caused by the 
distance matrix, instead of the graph type.


The code has some files, and I use a Makefile for the compilation. I 
thought that maybe the best way of allowing whoever wants to help me to 
check the error is making a tarball with the involved files. My graph 
definition is in header file steiner.hpp.

steiner_io.hpp and steiner_io.cpp are read/write functions that can be 
compiled and seem to work well, and should be independent of the error. 
The compiling error is caused by line 117 of dnh.cpp. If the input 
variable g (my graph) is substituted by G (libboost example's graph), 
then the compilation goes fine.

The compilation error log is in file "makelog".

Regards,

Ramón Casero.

  ----------

/usr/include/boost/graph/graph_concepts.hpp: In method `void 
boost::BasicMatrixConcept<int[6][6],void *,int>::constraints()':
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::BasicMatrixConcept<int[6][6],void *,int> 
>(boost::type<boost::BasicMatrixConcept<int[6][6],void *,int> > *)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:66:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/graph_concepts.hpp:449: invalid types `int[6][6][void 
*]' for array subscript
/usr/include/boost/graph/graph_concepts.hpp: In method `void 
boost::BasicMatrixConcept<int[6][6],void *,int>::const_constraints(const int 
(&)[6][6])':
/usr/include/boost/graph/graph_concepts.hpp:450:   instantiated from 
`boost::BasicMatrixConcept<int[6][6],void *,int>::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::BasicMatrixConcept<int[6][6],void *,int> 
>(boost::type<boost::BasicMatrixConcept<int[6][6],void *,int> > *)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:66:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/graph_concepts.hpp:454: invalid types `const 
int[6][6][void *]' for array subscript
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool 
boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)':
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:72: warning: passing 
`void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast
/usr/include/boost/property_map.hpp: In method `void 
boost::ReadablePropertyMapConcept<int *,void *>::constraints()':
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::ReadablePropertyMapConcept<int *,void *> 
>(boost::type<boost::ReadablePropertyMapConcept<int *,void *> > *)'
/usr/include/boost/property_map.hpp:209:   instantiated from 
`boost::ReadWritePropertyMapConcept<int *,void *>::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::ReadWritePropertyMapConcept<int *,void *> 
>(boost::type<boost::ReadWritePropertyMapConcept<int *,void *> > *)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:117:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, 
boost::bellman_visitor<boost::null_visitor>)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated 
from 
`boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/property_map.hpp:157: warning: passing `void *' to argument 
2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/property_map.hpp: In method `void 
boost::WritablePropertyMapConcept<int *,void *>::constraints()':
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::WritablePropertyMapConcept<int *,void *> 
>(boost::type<boost::WritablePropertyMapConcept<int *,void *> > *)'
/usr/include/boost/property_map.hpp:210:   instantiated from 
`boost::ReadWritePropertyMapConcept<int *,void *>::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::ReadWritePropertyMapConcept<int *,void *> 
>(boost::type<boost::ReadWritePropertyMapConcept<int *,void *> > *)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:117:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, 
boost::bellman_visitor<boost::null_visitor>)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated 
from 
`boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/property_map.hpp:186: warning: passing `void *' to argument 
2 of `put<int, int>(int *, int, const int &)' lacks a cast
/usr/include/boost/graph/relax.hpp: In function `bool 
boost::relax<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int> 
>(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>)':
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:127:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, 
boost::bellman_visitor<boost::null_visitor>)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated 
from 
`boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/relax.hpp:69: warning: passing `void *' to argument 2 
of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/relax.hpp:69: warning: passing `void *' to argument 2 
of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:127:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, 
boost::bellman_visitor<boost::null_visitor>)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated 
from 
`boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/relax.hpp:73: warning: passing `void *' to argument 2 
of `put<int, int>(int *, int, const int &)' lacks a cast
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function `bool 
boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>, 
boost::bellman_visitor<boost::null_visitor>)':
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167:   instantiated 
from 
`boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181:   instantiated 
from 
`boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, unsigned int, int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, unsigned int, const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:134: warning: passing 
`void *' to argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/bellman_ford_shortest_paths.hpp:134: warning: passing 
`void *' to argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool 
boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)':
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:75: warning: passing 
`void *' to argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/dijkstra_shortest_paths.hpp: In function `void 
boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int, 
boost::dijkstra_visitor<boost::null_visitor>)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated from 
`boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated from 
`boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated from 
`boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:198: warning: passing 
`void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:201: warning: passing 
`void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast
/usr/include/boost/graph/relax.hpp: In function `bool 
boost::relax<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int> 
>(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, boost::dummy_property_map, int *, 
boost::closed_plus<int>, less<int>)':
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:103:   instantiated from 
`boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>::tree_edge<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> 
>(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:51:   instantiated from 
`boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> > 
>(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> > > *)'
/usr/include/boost/graph/breadth_first_search.hpp:75:   instantiated from 
`boost::breadth_first_visit<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, boost::mutable_queue<void *,vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> 
>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::mutable_queue<void 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type 
&>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:178:   instantiated from 
`boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int, 
boost::dijkstra_visitor<boost::null_visitor>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:204:   instantiated from 
`boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int, 
boost::dijkstra_visitor<boost::null_visitor>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated from 
`boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated from 
`boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated from 
`boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/relax.hpp:69: warning: passing `void *' to argument 2 
of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/relax.hpp:69: warning: passing `void *' to argument 2 
of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:103:   instantiated from 
`boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>::tree_edge<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> 
>(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:51:   instantiated from 
`boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> > 
>(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> > > *)'
/usr/include/boost/graph/breadth_first_search.hpp:75:   instantiated from 
`boost::breadth_first_visit<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, boost::mutable_queue<void *,vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> 
>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::mutable_queue<void 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type 
&>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:178:   instantiated from 
`boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int, 
boost::dijkstra_visitor<boost::null_visitor>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:204:   instantiated from 
`boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int, 
boost::dijkstra_visitor<boost::null_visitor>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated from 
`boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated from 
`boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated from 
`boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/relax.hpp:73: warning: passing `void *' to argument 2 
of `put<int, int>(int *, int, const int &)' lacks a cast
/usr/include/boost/pending/indirect_cmp.hpp: In method `bool 
boost::indirect_cmp<int *,less<int> >::operator ()<void *, void *>(void *const 
&, void *const &) const':
/usr/include/boost/graph/detail/array_binary_tree.hpp:183:   instantiated from 
`adstl::compare_array_node<vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> > >::operator 
()<adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > 
>(const adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, 
const adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &)'
/usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/stl_algo.h:2520:   
instantiated from `min_element<adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>::children_type::iterator, adstl::compare_array_node<vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> > > 
>(adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>::children_type::iterator, adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>::children_type::iterator, adstl::compare_array_node<vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >)'
/usr/include/boost/pending/mutable_heap.hpp:62:   instantiated from 
`boost::down_heap<adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, 
adstl::compare_array_node<vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> > >, vector<unsigned 
int,allocator<unsigned int> > >(adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, 
adstl::compare_array_node<vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> > >, vector<unsigned 
int,allocator<unsigned int> > &)'
/usr/include/boost/pending/mutable_heap.hpp:75:   instantiated from 
`boost::update_heap<adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, 
adstl::compare_array_node<vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> > >, vector<unsigned 
int,allocator<unsigned int> > >(adstl::array_binary_tree_node<void 
**,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, 
adstl::compare_array_node<vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> > >, vector<unsigned 
int,allocator<unsigned int> > &)'
/usr/include/boost/pending/mutable_queue.hpp:119:   instantiated from 
`boost::mutable_queue<void *,vector<void *,allocator<void *> 
>,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>::update(void *const &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:114:   instantiated from 
`boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>::gray_target<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> 
>(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/usr/include/boost/graph/breadth_first_search.hpp:53:   instantiated from 
`boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> >::constraints()'
/usr/include/boost/concept_check.hpp:46:   instantiated from 
`boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> > 
>(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> 
>,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> > > *)'
/usr/include/boost/graph/breadth_first_search.hpp:75:   instantiated from 
`boost::breadth_first_visit<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, boost::mutable_queue<void *,vector<void 
*,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> 
>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::mutable_queue<void 
*,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, 
boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void
 *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> 
>,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::dummy_property_map,int 
*,boost::closed_plus<int>,less<int> >, 
boost::iterator_property_map<boost::default_color_type 
*,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int 
&,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type 
&>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:178:   instantiated from 
`boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int, 
boost::dijkstra_visitor<boost::null_visitor>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:204:   instantiated from 
`boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int>(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
less<int>, boost::closed_plus<int>, int, int, 
boost::dijkstra_visitor<boost::null_visitor>)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:237:   instantiated from 
`boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:259:   instantiated from 
`boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, int *, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, 
const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:278:   instantiated from 
`boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> >(const 
boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, void *, const 
boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int
 &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int 
*,boost::vertex_distance_t,boost::no_property> > &)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80:   instantiated from 
`boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/pending/indirect_cmp.hpp:59: warning: passing `void *const' 
to argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/pending/indirect_cmp.hpp:59: warning: passing `void *const' 
to argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool 
boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, 
int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int 
*, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void 
*,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight2_t>, int)':
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112:   instantiated 
from 
`boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, boost::no_property, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> 
>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, 
boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void 
*,const 
boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::edge_weight_t>, 
boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)'
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129:   instantiated 
from 
`boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS>, int[6][6], int *, 
boost::vertex_distance_t, 
boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &, int (&)[6][6], const 
boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)'
/datos/uni/pfc/c++/dnh.cpp:117:   instantiated from 
`steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property>
 
>,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property>
 >,boost::no_property,boost::listS> &)'
/datos/uni/pfc/c++/dnh.cpp:50:   instantiated from here
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:82: warning: passing 
`void *' to argument 2 of `get<int>(const int *, int)' lacks a cast
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:82: invalid types 
`int[6][6][void *]' for array subscript


[Non-text portions of this message have been removed]


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

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