bytenik

/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp: In function 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]':
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:208: error: no matching function for call to 'put(int*&, void*&, int&)'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:211: error: no matching function for call to 'put(int*&, void*&, int&)'
/usr/pkg/include/boost/pending/mutable_queue.hpp: In member function 'void boost::mutable_queue<IndexedType, RandomAccessContainer, Comp, ID>::push(const IndexedType&) [with IndexedType = void*, RandomAccessContainer = std::vector<void*, std::allocator<void*> >, Comp = boost::indirect_cmp<int*, std::less<int> >, ID = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>]':
/usr/pkg/include/boost/graph/breadth_first_search.hpp:82:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/pending/mutable_queue.hpp:109: error: no match for 'operator[]' in '((boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)this)->boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >::index_array[boost::get [with PropertyMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Reference = const boost::detail::error_property_not_found&, K = void*](((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >&)((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)((boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)(&((boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)this)->boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >::id)))), ((void* const&)((void* const*)x)))]'
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_vector.h:479: note: candidates are: typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::reference std::vector<_Tp, _Alloc>::operator[](size_t) [with _Tp = unsigned int, _Alloc = std::allocator<unsigned int>]
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_vector.h:494: note:                 typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::const_reference std::vector<_Tp, _Alloc>::operator[](size_t) const [with _Tp = unsigned int, _Alloc = std::allocator<unsigned int>]
/usr/pkg/include/boost/pending/mutable_queue.hpp: In member function 'void boost::mutable_queue<IndexedType, RandomAccessContainer, Comp, ID>::pop() [with IndexedType = void*, RandomAccessContainer = std::vector<void*, std::allocator<void*> >, Comp = boost::indirect_cmp<int*, std::less<int> >, ID = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>]':
/usr/pkg/include/boost/graph/breadth_first_search.hpp:84:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/pending/mutable_queue.hpp:96: error: cannot convert 'const boost::detail::error_property_not_found' to 'size_t' in initialization
/usr/pkg/include/boost/pending/mutable_queue.hpp:97: error: cannot convert 'const boost::detail::error_property_not_found' to 'size_t' in initialization
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp: In member function 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate>::examine_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::undirected_tag, void*>, Graph = const boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, BinaryFunction = boost::closed_plus<int>, BinaryPredicate = std::less<int>]':
/usr/pkg/include/boost/graph/breadth_first_search.hpp:86:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:136: error: no match for call to '(std::less<int>) (const boost::detail::error_property_not_found&, int&)'
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_function.h:226: note: candidates are: bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
/usr/pkg/include/boost/property_map.hpp: In member function 'R boost::iterator_property_map<RandomAccessIterator, IndexMap, T, R>::operator[](typename boost::property_traits<IndexMap>::key_type) const [with RandomAccessIterator = boost::default_color_type*, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, T = boost::default_color_type, R = boost::default_color_type&]':
/usr/pkg/include/boost/property_map.hpp:319:   instantiated from 'void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, Reference = boost::default_color_type&, K = void*, V = boost::default_color_type]'
/usr/pkg/include/boost/graph/breadth_first_search.hpp:81:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/property_map.hpp:349: error: no match for 'operator+' in '((const boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>*)this)->boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>::iter + boost::get [with PropertyMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Reference = const boost::detail::error_property_not_found&, K = void*](((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >&)((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)(&((const boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>*)this)->boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>::index))), ((void* const&)((void* const*)(& v))))'
/usr/pkg/include/boost/graph/relax.hpp: In function 'bool boost::relax(typename boost::graph_traits<G>::edge_descriptor, const Graph&, const WeightMap&, PredecessorMap&, DistanceMap&, const BinaryFunction&, const BinaryPredicate&) [with Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, BinaryFunction = boost::closed_plus<int>, BinaryPredicate = std::less<int>]':
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:107:   instantiated from 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate>::tree_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::undirected_tag, void*>, Graph = const boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, BinaryFunction = boost::closed_plus<int>, BinaryPredicate = std::less<int>]'
/usr/pkg/include/boost/graph/breadth_first_search.hpp:88:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/graph/relax.hpp:71: error: no matching function for call to 'get(int*&, void*&)'
/usr/pkg/include/boost/graph/relax.hpp:71: error: no matching function for call to 'get(int*&, void*&)'
/usr/pkg/include/boost/graph/relax.hpp:74: error: no match for call to '(const boost::closed_plus<int>) (int&, boost::detail::error_property_not_found&)'
/usr/pkg/include/boost/graph/relax.hpp:48: note: candidates are: T boost::closed_plus<T>::operator()(const T&, const T&) const [with T = int]
/usr/pkg/include/boost/graph/relax.hpp:75: error: no match for call to '(const boost::closed_plus<int>) (int&, boost::detail::error_property_not_found&)'
/usr/pkg/include/boost/graph/relax.hpp:48: note: candidates are: T boost::closed_plus<T>::operator()(const T&, const T&) const [with T = int]
/usr/pkg/include/boost/graph/relax.hpp:78: error: no match for call to '(const boost::closed_plus<int>) (int&, boost::detail::error_property_not_found&)'
/usr/pkg/include/boost/graph/relax.hpp:48: note: candidates are: T boost::closed_plus<T>::operator()(const T&, const T&) const [with T = int]
/usr/pkg/include/boost/graph/relax.hpp:79: error: no match for call to '(const boost::closed_plus<int>) (int&, boost::detail::error_property_not_found&)'
/usr/pkg/include/boost/graph/relax.hpp:48: note: candidates are: T boost::closed_plus<T>::operator()(const T&, const T&) const [with T = int]
/usr/pkg/include/boost/pending/mutable_queue.hpp: In member function 'void boost::mutable_queue<IndexedType, RandomAccessContainer, Comp, ID>::update(const IndexedType&) [with IndexedType = void*, RandomAccessContainer = std::vector<void*, std::allocator<void*> >, Comp = boost::indirect_cmp<int*, std::less<int> >, ID = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>]':
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:119:   instantiated from 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate>::gray_target(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::undirected_tag, void*>, Graph = const boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, BinaryFunction = boost::closed_plus<int>, BinaryPredicate = std::less<int>]'
/usr/pkg/include/boost/graph/breadth_first_search.hpp:92:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/pending/mutable_queue.hpp:115: error: no match for 'operator[]' in '((boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)this)->boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >::index_array[boost::get [with PropertyMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Reference = const boost::detail::error_property_not_found&, K = void*](((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >&)((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)((boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)(&((boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)this)->boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >::id)))), ((void* const&)((void* const*)x)))]'
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_vector.h:479: note: candidates are: typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::reference std::vector<_Tp, _Alloc>::operator[](size_t) [with _Tp = unsigned int, _Alloc = std::allocator<unsigned int>]
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_vector.h:494: note:                 typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::const_reference std::vector<_Tp, _Alloc>::operator[](size_t) const [with _Tp = unsigned int, _Alloc = std::allocator<unsigned int>]
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp: In member function 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate>::examine_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::undirected_tag, void*>, Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, BinaryFunction = boost::closed_plus<int>, BinaryPredicate = std::less<int>]':
/usr/pkg/include/boost/graph/breadth_first_search.hpp:50:   instantiated from 'void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>]'
/usr/pkg/include/boost/concept_check.hpp:48:   instantiated from 'void boost::function_requires(boost::mpl::identity<T>*) [with Concept = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS> >]'
/usr/pkg/include/boost/graph/breadth_first_search.hpp:75:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:136: error: no match for call to '(std::less<int>) (const boost::detail::error_property_not_found&, int&)'
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_function.h:226: note: candidates are: bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
/usr/pkg/include/boost/graph/detail/array_binary_tree.hpp: In member function 'void adstl::array_binary_tree_node<RandomAccessIterator, ID>::swap(adstl::array_binary_tree_node<RandomAccessIterator, ID>, ExternalData&) [with ExternalData = std::vector<unsigned int, std::allocator<unsigned int> >, RandomAccessIterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, ID = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>]':
/usr/pkg/include/boost/pending/mutable_heap.hpp:54:   instantiated from 'TreeNode boost::up_heap(TreeNode, const Compare&, ExternalData&) [with TreeNode = adstl::array_binary_tree_node<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, Compare = adstl::compare_array_node<std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> > >, ExternalData = std::vector<unsigned int, std::allocator<unsigned int> >]'
/usr/pkg/include/boost/pending/mutable_queue.hpp:111:   instantiated from 'void boost::mutable_queue<IndexedType, RandomAccessContainer, Comp, ID>::push(const IndexedType&) [with IndexedType = void*, RandomAccessContainer = std::vector<void*, std::allocator<void*> >, Comp = boost::indirect_cmp<int*, std::less<int> >, ID = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>]'
/usr/pkg/include/boost/graph/breadth_first_search.hpp:82:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/graph/detail/array_binary_tree.hpp:157: error: no match for 'operator[]' in 'edata[boost::get [with PropertyMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Reference = const boost::detail::error_property_not_found&, K = void*](((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >&)((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)((boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)(&((adstl::array_binary_tree_node<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)this)->adstl::array_binary_tree_node<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >::id)))), ((void* const&)((void* const*)(& tmp))))]'
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_vector.h:479: note: candidates are: typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::reference std::vector<_Tp, _Alloc>::operator[](size_t) [with _Tp = unsigned int, _Alloc = std::allocator<unsigned int>]
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_vector.h:494: note:                 typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::const_reference std::vector<_Tp, _Alloc>::operator[](size_t) const [with _Tp = unsigned int, _Alloc = std::allocator<unsigned int>]
/usr/pkg/include/boost/graph/detail/array_binary_tree.hpp:158: error: no match for 'operator[]' in 'edata[boost::get [with PropertyMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Reference = const boost::detail::error_property_not_found&, K = void*](((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >&)((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)((boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)(&((adstl::array_binary_tree_node<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)this)->adstl::array_binary_tree_node<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >::id)))), ((void* const&)((void* const*)((void**)adstl::array_binary_tree_node<RandomAccessIterator, ID>::value [with RandomAccessIterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, ID = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>]()))))]'
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_vector.h:479: note: candidates are: typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::reference std::vector<_Tp, _Alloc>::operator[](size_t) [with _Tp = unsigned int, _Alloc = std::allocator<unsigned int>]
/usr/local/gcc-4.1/lib/gcc/i386--netbsdelf2.1/4.1.0/../../../../include/c++/4.1.0/bits/stl_vector.h:494: note:                 typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::const_reference std::vector<_Tp, _Alloc>::operator[](size_t) const [with _Tp = unsigned int, _Alloc = std::allocator<unsigned int>]
/usr/pkg/include/boost/graph/detail/adjacency_list.hpp: In member function 'Ref boost::adj_list_edge_property_map<Directed, Value, Ref, Vertex, Property, Tag>::operator[](boost::detail::edge_desc_impl<Directed, Vertex>) const [with Directed = boost::undirected_tag, Value = boost::detail::error_property_not_found, Ref = const boost::detail::error_property_not_found&, Vertex = void*, Property = const boost::no_property, Tag = boost::edge_weight_t]':
/usr/pkg/include/boost/property_map.hpp:312:   instantiated from 'Reference boost::get(const boost::put_get_helper<Reference, PropertyMap>&, const K&) [with PropertyMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, Reference = const boost::detail::error_property_not_found&, K = boost::detail::edge_desc_impl<boost::undirected_tag, void*>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:136:   instantiated from 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate>::examine_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::undirected_tag, void*>, Graph = const boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, BinaryFunction = boost::closed_plus<int>, BinaryPredicate = std::less<int>]'
/usr/pkg/include/boost/graph/breadth_first_search.hpp:86:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/graph/detail/adjacency_list.hpp:2468: error: no matching function for call to 'get_property_value(const boost::no_property&, boost::edge_weight_t)'
/usr/pkg/include/boost/pending/indirect_cmp.hpp: In member function 'bool boost::indirect_cmp<ReadablePropertyMap, Compare>::operator()(const A&, const B&) const [with A = void*, B = void*, ReadablePropertyMap = int*, Compare = std::less<int>]':
/usr/pkg/include/boost/graph/detail/array_binary_tree.hpp:188:   instantiated from 'bool adstl::compare_array_node<RandomAccessContainer, Compare>::operator()(const node_type&, const node_type&) const [with node_type = adstl::array_binary_tree_node<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, RandomAccessContainer = std::vector<void*, std::allocator<void*> >, Compare = boost::indirect_cmp<int*, std::less<int> >]'
/usr/pkg/include/boost/pending/mutable_heap.hpp:53:   instantiated from 'TreeNode boost::up_heap(TreeNode, const Compare&, ExternalData&) [with TreeNode = adstl::array_binary_tree_node<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, Compare = adstl::compare_array_node<std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> > >, ExternalData = std::vector<unsigned int, std::allocator<unsigned int> >]'
/usr/pkg/include/boost/pending/mutable_queue.hpp:111:   instantiated from 'void boost::mutable_queue<IndexedType, RandomAccessContainer, Comp, ID>::push(const IndexedType&) [with IndexedType = void*, RandomAccessContainer = std::vector<void*, std::allocator<void*> >, Comp = boost::indirect_cmp<int*, std::less<int> >, ID = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>]'
/usr/pkg/include/boost/graph/breadth_first_search.hpp:82:   instantiated from 'void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<void*, std::vector<void*, std::allocator<void*> >, boost::indirect_cmp<int*, std::less<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<boost::default_color_type*, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:187:   instantiated from 'void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:213:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:234:   instantiated from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:265:   instantiated from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, void*, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Params = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
/usr/pkg/include/boost/graph/dijkstra_shortest_paths.hpp:283:   instantiated from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = connectivity_graph_t, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::no_property]'
linkstaterouter.cpp:89:   instantiated from here
/usr/pkg/include/boost/pending/indirect_cmp.hpp:59: error: no matching function for call to 'get(int* const&, void* const&)'
/usr/pkg/include/boost/pending/indirect_cmp.hpp:59: error: no matching function for call to 'get(int* const&, void* const&)'