g++ -pedantic-errors -I/usr/boost_1_33_1 *.cpp -o assgn3
/usr/boost_1_33_1/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, size_t>, 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::relaxed_heap<size_t, 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>, size_t> >, WeightMap = int*, PredecessorMap = 
   boost::dummy_property_map, DistanceMap = int*, BinaryFunction = 
   boost::closed_plus<int>, BinaryPredicate = std::less<int>]':
/usr/boost_1_33_1/boost/graph/breadth_first_search.hpp:34:   instantiated from `void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::relaxed_heap<size_t, 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>, size_t> >, int*, 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/boost_1_33_1/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::relaxed_heap<size_t, 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>, size_t> >, int*, 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/boost_1_33_1/boost/graph/breadth_first_search.hpp:59:   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::relaxed_heap<size_t, 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>, size_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::relaxed_heap<size_t, 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>, size_t> >, int*, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:207:   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, ColorMap) [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 = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:256:   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, ColorMap) [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 = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:277:   instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&, ColorMap) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Params = boost::bgl_named_params<int*, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:314:   instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&, ColorMap) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Params = boost::bgl_named_params<int*, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property> >, ColorMap = boost::detail::error_property_not_found]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:335:   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::edge_weight_t, Rest = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
linkstaterouter.cpp:91:   instantiated from here
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:121: error: cannot 
   convert `boost::detail::edge_desc_impl<boost::undirected_tag, size_t>' to `
   int' for argument `2' to `const T& get(const T*, int) [with T = int]'
/usr/boost_1_33_1/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 = int*, PredecessorMap = 
   boost::dummy_property_map, DistanceMap = int*, BinaryFunction = 
   boost::closed_plus<int>, BinaryPredicate = std::less<int>]':
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:92:   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, size_t>, 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::relaxed_heap<size_t, 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>, size_t> >, WeightMap = int*, PredecessorMap = boost::dummy_property_map, DistanceMap = int*, BinaryFunction = boost::closed_plus<int>, BinaryPredicate = std::less<int>]'
/usr/boost_1_33_1/boost/graph/breadth_first_search.hpp:35:   instantiated from `void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::relaxed_heap<size_t, 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>, size_t> >, int*, 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/boost_1_33_1/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::relaxed_heap<size_t, 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>, size_t> >, int*, 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/boost_1_33_1/boost/graph/breadth_first_search.hpp:59:   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::relaxed_heap<size_t, 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>, size_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::relaxed_heap<size_t, 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>, size_t> >, int*, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:207:   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, ColorMap) [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 = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:256:   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, ColorMap) [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 = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:277:   instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&, ColorMap) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Params = boost::bgl_named_params<int*, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:314:   instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&, ColorMap) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Params = boost::bgl_named_params<int*, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property> >, ColorMap = boost::detail::error_property_not_found]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:335:   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::edge_weight_t, Rest = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
linkstaterouter.cpp:91:   instantiated from here
/usr/boost_1_33_1/boost/graph/relax.hpp:72: error: cannot convert `
   boost::detail::edge_desc_impl<boost::undirected_tag, size_t>' to `int' for 
   argument `2' to `const T& get(const T*, int) [with T = int]'
/usr/boost_1_33_1/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, size_t>, 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::relaxed_heap<size_t, 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>, size_t> >, WeightMap = int*, PredecessorMap = 
   boost::dummy_property_map, DistanceMap = int*, BinaryFunction = 
   boost::closed_plus<int>, BinaryPredicate = std::less<int>]':
/usr/boost_1_33_1/boost/graph/breadth_first_search.hpp:70:   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::relaxed_heap<size_t, 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>, size_t> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>, boost::relaxed_heap<size_t, 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>, size_t> >, int*, boost::dummy_property_map, int*, boost::closed_plus<int>, std::less<int> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:207:   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, ColorMap) [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 = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistZero = int, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:256:   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, ColorMap) [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 = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Compare = std::less<int>, Combine = boost::closed_plus<int>, DistInf = int, DistZero = int, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:277:   instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&, ColorMap) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Params = boost::bgl_named_params<int*, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, boost::default_color_type, boost::default_color_type&>]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:314:   instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&, ColorMap) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, node_t, boost::no_property, boost::no_property, boost::listS>, DistanceMap = int*, WeightMap = int*, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, node_t, boost::no_property>, size_t>, Params = boost::bgl_named_params<int*, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property> >, ColorMap = boost::detail::error_property_not_found]'
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:335:   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::edge_weight_t, Rest = boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>]'
linkstaterouter.cpp:91:   instantiated from here
/usr/boost_1_33_1/boost/graph/dijkstra_shortest_paths.hpp:121: error: cannot 
   convert `boost::detail::edge_desc_impl<boost::undirected_tag, size_t>' to `
   int' for argument `2' to `const T& get(const T*, int) [with T = int]'
*** Error code 1

Stop in /dev/fs/H/bytenik/Documents/Stevens/Spring 2007/CS 521A/assgn3 (line 4 of makefile).