Set up gcc environment - 3.3 Checking if your kit is complete... Looks good Checking if your kit is complete... Looks good Writing Makefile for Boost::Graph::Directed Checking if your kit is complete... Looks good Writing Makefile for Boost::Graph::Undirected Writing Makefile for Boost::Graph cp Graph.pm blib/lib/Boost/Graph.pm make[1]: Entering directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Directed' cp Directed.pm ../blib/lib/Boost/Graph/Directed.pm /export/home/cpanrun/build/5.10.0/bin/perl /mnt/nas0/monthly/cpanrun-machete/build/5.10.0/lib/ExtUtils/xsubpp -C++ -typemap /export/home/cpanrun/build/5.10.0/lib/ExtUtils/typemap -typemap perlobject.map -typemap typemap Directed.xs > Directed.xsc && mv Directed.xsc Directed.c Please specify prototyping behavior for Directed.xs (see perlxs manual) g++ -O -c -I. -I../include -I../include/boost -D_REENTRANT -DPRIVLIB_LAST_IN_INC -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -fno-strict-aliasing -pipe -O -DVERSION=\"1.1\" -DXS_VERSION=\"1.1\" -fPIC "-I/export/home/cpanrun/build/5.10.0/lib/CORE" Directed.c ../include/boost/graph/dijkstra_shortest_paths.hpp: In member function `void boost::detail::dijkstra_bfs_visitor::examine_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl, Graph = boost::adjacency_list, UniformCostVisitor = boost::dijkstra_visitor, UpdatableQueue = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]': ../include/boost/graph/breadth_first_search.hpp:34: instantiated from `void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, Graph = boost::adjacency_list]' ../include/boost/concept_check.hpp:48: instantiated from `void boost::function_requires(boost::mpl::identity*) [with Concept = boost::BFSVisitorConcept, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, boost::adjacency_list >]' ../include/boost/graph/breadth_first_search.hpp:59: instantiated from `void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, Buffer = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, ColorMap = boost::iterator_property_map, boost::default_color_type, boost::default_color_type&>]' ../include/boost/graph/dijkstra_shortest_paths.hpp:191: instantiated from `void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:217: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistInf = int, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:238: instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:269: instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:287: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::bgl_named_params]' ../include/BoostGraph_i.h:309: instantiated from `Path BoostGraph_i::dijkstraShortestPath(int, int) [with G = DirectedGraph]' Directed.xs:99: instantiated from here ../include/boost/graph/dijkstra_shortest_paths.hpp:121: warning: passing `const double' for argument 1 of `bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]' ../include/boost/graph/relax.hpp: In function `bool boost::relax(typename boost::graph_traits::edge_descriptor, const Graph&, const WeightMap&, PredecessorMap&, DistanceMap&, const BinaryFunction&, const BinaryPredicate&) [with Graph = boost::adjacency_list, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]': ../include/boost/graph/dijkstra_shortest_paths.hpp:92: instantiated from `void boost::detail::dijkstra_bfs_visitor::tree_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl, Graph = boost::adjacency_list, UniformCostVisitor = boost::dijkstra_visitor, UpdatableQueue = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]' ../include/boost/graph/breadth_first_search.hpp:35: instantiated from `void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, Graph = boost::adjacency_list]' ../include/boost/concept_check.hpp:48: instantiated from `void boost::function_requires(boost::mpl::identity*) [with Concept = boost::BFSVisitorConcept, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, boost::adjacency_list >]' ../include/boost/graph/breadth_first_search.hpp:59: instantiated from `void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, Buffer = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, ColorMap = boost::iterator_property_map, boost::default_color_type, boost::default_color_type&>]' ../include/boost/graph/dijkstra_shortest_paths.hpp:191: instantiated from `void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:217: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistInf = int, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:238: instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:269: instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:287: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::bgl_named_params]' ../include/BoostGraph_i.h:309: instantiated from `Path BoostGraph_i::dijkstraShortestPath(int, int) [with G = DirectedGraph]' Directed.xs:99: instantiated from here ../include/boost/graph/relax.hpp:74: warning: passing `double' for argument 2 of `T boost::closed_plus::operator()(const T&, const T&) const [with T = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:92: instantiated from `void boost::detail::dijkstra_bfs_visitor::tree_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl, Graph = boost::adjacency_list, UniformCostVisitor = boost::dijkstra_visitor, UpdatableQueue = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]' ../include/boost/graph/breadth_first_search.hpp:35: instantiated from `void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, Graph = boost::adjacency_list]' ../include/boost/concept_check.hpp:48: instantiated from `void boost::function_requires(boost::mpl::identity*) [with Concept = boost::BFSVisitorConcept, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, boost::adjacency_list >]' ../include/boost/graph/breadth_first_search.hpp:59: instantiated from `void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, Buffer = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, ColorMap = boost::iterator_property_map, boost::default_color_type, boost::default_color_type&>]' ../include/boost/graph/dijkstra_shortest_paths.hpp:191: instantiated from `void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:217: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistInf = int, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:238: instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:269: instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:287: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::bgl_named_params]' ../include/BoostGraph_i.h:309: instantiated from `Path BoostGraph_i::dijkstraShortestPath(int, int) [with G = DirectedGraph]' Directed.xs:99: instantiated from here ../include/boost/graph/relax.hpp:75: warning: passing `double' for argument 2 of `T boost::closed_plus::operator()(const T&, const T&) const [with T = int]' ../include/boost/graph/relax.hpp:78: warning: passing `double' for argument 2 of `T boost::closed_plus::operator()(const T&, const T&) const [with T = int]' ../include/boost/graph/relax.hpp:79: warning: passing `double' for argument 2 of `T boost::closed_plus::operator()(const T&, const T&) const [with T = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp: In member function `void boost::detail::dijkstra_bfs_visitor::examine_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl, Graph = const boost::adjacency_list, UniformCostVisitor = boost::dijkstra_visitor, UpdatableQueue = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]': ../include/boost/graph/breadth_first_search.hpp:70: instantiated from `void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, Buffer = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, ColorMap = boost::iterator_property_map, boost::default_color_type, boost::default_color_type&>]' ../include/boost/graph/dijkstra_shortest_paths.hpp:191: instantiated from `void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:217: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistInf = int, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:238: instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:269: instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:287: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::bgl_named_params]' ../include/BoostGraph_i.h:309: instantiated from `Path BoostGraph_i::dijkstraShortestPath(int, int) [with G = DirectedGraph]' Directed.xs:99: instantiated from here ../include/boost/graph/dijkstra_shortest_paths.hpp:121: warning: passing `const double' for argument 1 of `bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]' Running Mkbootstrap for Boost::Graph::Directed () chmod 644 Directed.bs rm -f ../blib/arch/auto/Boost/Graph/Directed/Directed.so g++ -O -G -L/usr/lib -L/usr/ccs/lib -L/opt/SUNWspro/prod/lib Directed.o -o ../blib/arch/auto/Boost/Graph/Directed/Directed.so \ \ chmod 755 ../blib/arch/auto/Boost/Graph/Directed/Directed.so cp Directed.bs ../blib/arch/auto/Boost/Graph/Directed/Directed.bs chmod 644 ../blib/arch/auto/Boost/Graph/Directed/Directed.bs Manifying ../blib/man3/Boost::Graph::Directed.3 make[1]: Leaving directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Directed' make[1]: Entering directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Undirected' cp Undirected.pm ../blib/lib/Boost/Graph/Undirected.pm /export/home/cpanrun/build/5.10.0/bin/perl /mnt/nas0/monthly/cpanrun-machete/build/5.10.0/lib/ExtUtils/xsubpp -C++ -typemap /export/home/cpanrun/build/5.10.0/lib/ExtUtils/typemap -typemap perlobject.map -typemap typemap Undirected.xs > Undirected.xsc && mv Undirected.xsc Undirected.c Please specify prototyping behavior for Undirected.xs (see perlxs manual) g++ -O -c -I. -I../include -I../include/boost -D_REENTRANT -DPRIVLIB_LAST_IN_INC -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -fno-strict-aliasing -pipe -O -DVERSION=\"1.1\" -DXS_VERSION=\"1.1\" -fPIC "-I/export/home/cpanrun/build/5.10.0/lib/CORE" Undirected.c ../include/boost/graph/dijkstra_shortest_paths.hpp: In member function `void boost::detail::dijkstra_bfs_visitor::examine_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl, Graph = boost::adjacency_list, UniformCostVisitor = boost::dijkstra_visitor, UpdatableQueue = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]': ../include/boost/graph/breadth_first_search.hpp:34: instantiated from `void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, Graph = boost::adjacency_list]' ../include/boost/concept_check.hpp:48: instantiated from `void boost::function_requires(boost::mpl::identity*) [with Concept = boost::BFSVisitorConcept, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, boost::adjacency_list >]' ../include/boost/graph/breadth_first_search.hpp:59: instantiated from `void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, Buffer = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, ColorMap = boost::iterator_property_map, boost::default_color_type, boost::default_color_type&>]' ../include/boost/graph/dijkstra_shortest_paths.hpp:191: instantiated from `void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:217: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistInf = int, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:238: instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:269: instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:287: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::bgl_named_params]' ../include/BoostGraph_i.h:309: instantiated from `Path BoostGraph_i::dijkstraShortestPath(int, int) [with G = UndirectedGraph]' Undirected.xs:106: instantiated from here ../include/boost/graph/dijkstra_shortest_paths.hpp:121: warning: passing `const double' for argument 1 of `bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]' ../include/boost/graph/relax.hpp: In function `bool boost::relax(typename boost::graph_traits::edge_descriptor, const Graph&, const WeightMap&, PredecessorMap&, DistanceMap&, const BinaryFunction&, const BinaryPredicate&) [with Graph = boost::adjacency_list, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]': ../include/boost/graph/dijkstra_shortest_paths.hpp:92: instantiated from `void boost::detail::dijkstra_bfs_visitor::tree_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl, Graph = boost::adjacency_list, UniformCostVisitor = boost::dijkstra_visitor, UpdatableQueue = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]' ../include/boost/graph/breadth_first_search.hpp:35: instantiated from `void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, Graph = boost::adjacency_list]' ../include/boost/concept_check.hpp:48: instantiated from `void boost::function_requires(boost::mpl::identity*) [with Concept = boost::BFSVisitorConcept, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, boost::adjacency_list >]' ../include/boost/graph/breadth_first_search.hpp:59: instantiated from `void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, Buffer = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, ColorMap = boost::iterator_property_map, boost::default_color_type, boost::default_color_type&>]' ../include/boost/graph/dijkstra_shortest_paths.hpp:191: instantiated from `void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:217: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistInf = int, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:238: instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:269: instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:287: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::bgl_named_params]' ../include/BoostGraph_i.h:309: instantiated from `Path BoostGraph_i::dijkstraShortestPath(int, int) [with G = UndirectedGraph]' Undirected.xs:106: instantiated from here ../include/boost/graph/relax.hpp:74: warning: passing `double' for argument 2 of `T boost::closed_plus::operator()(const T&, const T&) const [with T = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:92: instantiated from `void boost::detail::dijkstra_bfs_visitor::tree_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl, Graph = boost::adjacency_list, UniformCostVisitor = boost::dijkstra_visitor, UpdatableQueue = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]' ../include/boost/graph/breadth_first_search.hpp:35: instantiated from `void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, Graph = boost::adjacency_list]' ../include/boost/concept_check.hpp:48: instantiated from `void boost::function_requires(boost::mpl::identity*) [with Concept = boost::BFSVisitorConcept, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, boost::adjacency_list >]' ../include/boost/graph/breadth_first_search.hpp:59: instantiated from `void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, Buffer = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, ColorMap = boost::iterator_property_map, boost::default_color_type, boost::default_color_type&>]' ../include/boost/graph/dijkstra_shortest_paths.hpp:191: instantiated from `void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:217: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistInf = int, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:238: instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:269: instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:287: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::bgl_named_params]' ../include/BoostGraph_i.h:309: instantiated from `Path BoostGraph_i::dijkstraShortestPath(int, int) [with G = UndirectedGraph]' Undirected.xs:106: instantiated from here ../include/boost/graph/relax.hpp:75: warning: passing `double' for argument 2 of `T boost::closed_plus::operator()(const T&, const T&) const [with T = int]' ../include/boost/graph/relax.hpp:78: warning: passing `double' for argument 2 of `T boost::closed_plus::operator()(const T&, const T&) const [with T = int]' ../include/boost/graph/relax.hpp:79: warning: passing `double' for argument 2 of `T boost::closed_plus::operator()(const T&, const T&) const [with T = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp: In member function `void boost::detail::dijkstra_bfs_visitor::examine_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl, Graph = const boost::adjacency_list, UniformCostVisitor = boost::dijkstra_visitor, UpdatableQueue = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, PredecessorMap = size_t*, DistanceMap = int*, BinaryFunction = boost::closed_plus, BinaryPredicate = std::less]': ../include/boost/graph/breadth_first_search.hpp:70: instantiated from `void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, Buffer = boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::relaxed_heap >, boost::vec_adj_list_vertex_id_map >, boost::adj_list_edge_property_map, boost::edge_weight_t>, size_t*, int*, boost::closed_plus, std::less >, ColorMap = boost::iterator_property_map, boost::default_color_type, boost::default_color_type&>]' ../include/boost/graph/dijkstra_shortest_paths.hpp:191: instantiated from `void boost::dijkstra_shortest_paths_no_init(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:217: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, DijkstraVisitor = boost::dijkstra_visitor, PredecessorMap = size_t*, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Compare = std::less, Combine = boost::closed_plus, DistInf = int, DistZero = int]' ../include/boost/graph/dijkstra_shortest_paths.hpp:238: instantiated from `void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:269: instantiated from `void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list, DistanceMap = int*, WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map, Params = boost::bgl_named_params >]' ../include/boost/graph/dijkstra_shortest_paths.hpp:287: instantiated from `void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list, Param = int*, Tag = boost::vertex_distance_t, Rest = boost::bgl_named_params]' ../include/BoostGraph_i.h:309: instantiated from `Path BoostGraph_i::dijkstraShortestPath(int, int) [with G = UndirectedGraph]' Undirected.xs:106: instantiated from here ../include/boost/graph/dijkstra_shortest_paths.hpp:121: warning: passing `const double' for argument 1 of `bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]' Running Mkbootstrap for Boost::Graph::Undirected () chmod 644 Undirected.bs rm -f ../blib/arch/auto/Boost/Graph/Undirected/Undirected.so g++ -O -G -L/usr/lib -L/usr/ccs/lib -L/opt/SUNWspro/prod/lib Undirected.o -o ../blib/arch/auto/Boost/Graph/Undirected/Undirected.so \ \ chmod 755 ../blib/arch/auto/Boost/Graph/Undirected/Undirected.so cp Undirected.bs ../blib/arch/auto/Boost/Graph/Undirected/Undirected.bs chmod 644 ../blib/arch/auto/Boost/Graph/Undirected/Undirected.bs Manifying ../blib/man3/Boost::Graph::Undirected.3 make[1]: Leaving directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Undirected' Manifying blib/man3/Boost::Graph.3 make[1]: Entering directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Directed' make[1]: Leaving directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Directed' make[1]: Entering directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Undirected' make[1]: Leaving directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Undirected' PERL_DL_NONLAZY=1 /export/home/cpanrun/build/5.10.0/bin/perl "-MExtUtils::Command::MM" "-e" "test_harness(1, 'blib/lib', 'blib/arch')" t/*.t t/Graph....ok 1 - Check _get_node_id ok 2 - check add_node() for insertion of new node ok 3 - check add_node() for insertion of existing node ok 4 - add_path 0-1 ok 5 - add_path 1-2 ok 6 - add_path 2-3 ok 7 - has_path 0-1-2-3 ok 8 - has_path sub path 1-2-3 ok 9 - has_path bad path # UNDIRECTED GRAPHS ok 10 - check add_edge() for insertion of new edge ok 11 - check add_edge() for proper node_id ok 12 - check add_edge() for proper node_id ok 13 - check add_edge for insertion of same edge with same objects ok 14 - check add_edge() for insertion of new edge ok 15 - check add_edge() for proper node_id ok 16 - check add_edge() for proper node_id ok 17 - check add_edge for insertion of same edge with same objects ok 18 - check get_nodes, recieve node 0 ok 19 - check get_nodes, recieve node 1 ok 20 - check get_nodes, recieve node 2 ok 21 - check get_edges, recieve edge 0-1 ok 22 - check get_edges, recieve edge 1-2 ok 23 - check get_edges, recieve edge 0-2 ok 24 - check neighbors, 1 is neighbor of 0 ok 25 - check neighbors, 1 is neighbor of 0 ok 26 - check that only two neighbors of 0 ok 27 - check node1 is hotspot ok 28 - check node4 is hotspot ok 29 - check only two hotspots returned ok 30 - Breadth First Search (0 root): 0 ok 31 - Breadth First Search (0 root): 1 ok 32 - Breadth First Search (0 root): 4 ok 33 - Breadth First Search (0 root): 2 ok 34 - Breadth First Search (0 root): 3 ok 35 - Breadth First Search (0 root): 5 ok 36 - Breadth First Search (0 root): 6 ok 37 - Breadth First Search (0 root): 7 ok 38 - Depth First Search (0 root): 0 ok 39 - Depth First Search (0 root): 1 ok 40 - Depth First Search (0 root): 2 ok 41 - Depth First Search (0 root): 3 ok 42 - Depth First Search (0 root): 4 ok 43 - Depth First Search (0 root): 5 ok 44 - Depth First Search (0 root): 7 ok 45 - Depth First Search (0 root): 6 ok 46 - Dijkstra weight 0->7: 3 ok 47 - Dijkstra path 0->7: 0 ok 48 - Dijkstra path 0->7: 4 ok 49 - Dijkstra path 0->7: 5 ok 50 - Dijkstra path 0->7: 7 ok 51 - All Pairs Shortest Path Johnson for 0->3: 2 ok 52 - All Pairs Shortest Path Floyd-Warshall for 0->3: 2 ok 53 - connected_components node0 in 0/1/4 cluster ok 54 - connected_components node1 in 0/1/4 cluster ok 55 - connected_components node4 in 0/1/4 cluster ok 56 - connected_components node2 in 2/5 cluster ok 57 - connected_components node5 in 2/5 cluster ok 58 - connected_components node3 from edge 3-3 # DIRECTED GRAPHS ok 59 - check children of node0 has node1 ok 60 - check children of node0 has node2 ok 61 - check children_of node1 has node3 ok 62 - chech children_of node1 has no more nodes ok 63 - Breadth First Search (0 root): 0 ok 64 - Breadth First Search (0 root): 1 ok 65 - Breadth First Search (0 root): 4 ok 66 - Breadth First Search (0 root): 2 ok 67 - Breadth First Search (0 root): 3 ok 68 - Breadth First Search (0 root): 5 ok 69 - Breadth First Search (0 root): 6 ok 70 - Breadth First Search (0 root): 7 ok 71 - Depth First Search (0 root): 0 ok 72 - Depth First Search (0 root): 1 ok 73 - Depth First Search (0 root): 2 ok 74 - Depth First Search (0 root): 3 ok 75 - Depth First Search (0 root): 4 ok 76 - Depth First Search (0 root): 5 ok 77 - Depth First Search (0 root): 7 ok 78 - Depth First Search (0 root): 6 ok 79 - Depth First Search Levels (0 root): 0 ok 80 - Depth First Search Levels (0 root) depth(0): 0 ok 81 - Depth First Search Levels (0 root): 4 ok 82 - Depth First Search Levels (0 root) depth(4): 1 ok 83 - Depth First Search Levels (0 root): 5 ok 84 - Depth First Search Levels (0 root) depth(5): 2 ok 85 - Depth First Search Levels (0 root): 7 ok 86 - Depth First Search Levels (0 root) depth(7): 3 ok 87 - Depth First Search Levels (0 root): 6 ok 88 - Depth First Search Levels (0 root) depth(6): 2 ok 89 - Depth First Search Levels (0 root): 1 ok 90 - Depth First Search Levels (0 root) depth(1): 1 ok 91 - Depth First Search Levels (0 root): 2 ok 92 - Depth First Search Levels (0 root) depth(2): 2 ok 93 - Depth First Search Levels (0 root): 3 ok 94 - Depth First Search Levels (0 root) depth(3): 2 ok 95 - Dijkstra weight 0->7: 3 ok 96 - Dijkstra path 0->7: 0 ok 97 - Dijkstra path 0->7: 4 ok 98 - Dijkstra path 0->7: 5 ok 99 - Dijkstra path 0->7: 7 ok 100 - All Pairs Shortest Path Johnson for 0->2: -3 ok 101 - All Pairs Shortest Path Johnson for (Altered graph) 0->6: 1 1..101 ok All tests successful. Files=1, Tests=101, 1 wallclock secs ( 0.64 cusr + 0.16 csys = 0.80 CPU) make[1]: Entering directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Directed' PERL_DL_NONLAZY=1 /export/home/cpanrun/build/5.10.0/bin/perl "-MExtUtils::Command::MM" "-e" "test_harness(1, '../blib/lib', '../blib/arch')" t/*.t t/1...........1..1 ok 1 - use Boost::Graph::Directed; ok t/Directed....1..1 ok 1 - use Boost::Graph::Directed; ok All tests successful. Files=2, Tests=2, 1 wallclock secs ( 0.59 cusr + 0.17 csys = 0.76 CPU) make[1]: Leaving directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Directed' make[1]: Entering directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Undirected' PERL_DL_NONLAZY=1 /export/home/cpanrun/build/5.10.0/bin/perl "-MExtUtils::Command::MM" "-e" "test_harness(1, '../blib/lib', '../blib/arch')" t/*.t t/1.............1..1 ok 1 - use Boost::Graph::Undirected; ok t/Undirected....1..1 ok 1 - use Boost::Graph::Undirected; ok All tests successful. Files=2, Tests=2, 1 wallclock secs ( 0.65 cusr + 0.13 csys = 0.78 CPU) make[1]: Leaving directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Undirected' make[1]: Entering directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Directed' make[1]: Leaving directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Directed' make[1]: Entering directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Undirected' make[1]: Leaving directory `/export/home/cpanrun/depot/main/contrib-patched/perl/CPAN/src/Boost-Graph/Undirected' Files found in blib/arch: installing files in blib/lib into architecture dependent library tree !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ERROR: Can't create '/export/home/cpanrun/build/5.10.0/html/site/lib/Boost' Do not have write permissions on '/export/home/cpanrun/build/5.10.0/html/site/lib/Boost' !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! at -e line 1 make: *** [pure_site_install] Error 2