/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, unsigned int>, Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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:90:   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/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::vecS, boost::vecS, 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&, unsigned int, 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, unsigned int>, Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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:90:   instantiated from here
/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/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, unsigned int>, Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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::vecS, boost::vecS, 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<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, const boost::no_property, boost::edge_weight_t>, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, boost::adjacency_list<boost::vecS, boost::vecS, 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::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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:90:   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/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 = unsigned int, 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&, unsigned int, 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, unsigned int>]'
/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, unsigned int>, Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, Buffer = boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::mutable_queue<unsigned int, std::vector<unsigned int, std::allocator<unsigned int> >, boost::indirect_cmp<int*, std::less<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, unsigned int, 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::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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::vecS, boost::vecS, 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&, unsigned int, const boost::no_property, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, unsigned int>, 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:90:   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)'