* Installing *source* package 'RBGL' ...
untarring boost include tree...
** libs
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c bbc.cpp -o bbc.o
boostIncl/boost/graph/dijkstra_shortest_paths.hpp: In function '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, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double, boost::no_property> >, boost::no_property, boost::listS>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, long unsigned int>, double, double&>, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double, boost::no_property> >, boost::edge_weight_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, long unsigned int>, Params = boost::bgl_named_params<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double, boost::no_property> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::graph_visitor_t, boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, long unsigned int>, boost::vertex_index_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double, boost::no_property> >, boost::edge_weight_t>, boost::edge_weight_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_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c cliques.cpp -o cliques.o
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c clusteringCoef.cpp -o clusteringCoef.o
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c dominatorTree.cpp -o dominatorTree.o
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c hcs.cpp -o hcs.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<boost::undirectedS, double>, OutputIterator = std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > >]':
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D99306$D99271$m_value$D97068$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D99306$D99271$m_value$D97068$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D99306$D99271$m_value$D97068$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D99306$D99271$m_value$D97068$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c incrConnComp.cpp -o incrConnComp.o
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c interfaces.cpp -o interfaces.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = Graph_ud, OutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]':
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D104096$D104061$m_value$D83947$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D104096$D104061$m_value$D83947$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D104096$D104061$m_value$D83947$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D104096$D104061$m_value$D83947$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c layout.cpp -o layout.o
layout.cpp: In function 'SEXPREC* BGL_layout_internal(E_LAYOUT_METHOD, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)':
layout.cpp:116: warning: unused variable 'r'
layout.cpp:117: warning: unused variable 'w'
layout.cpp:118: warning: unused variable 'h'
fruchterman_reingold.hpp: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, Dim, Dim, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, PositionMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::simple_point<double>, boost::simple_point<double>&, vertex_position_t>, Dim = double, AttractiveForce = boost::square_distance_attractive_force, RepulsiveForce = boost::square_distance_repulsive_force, ForcePairs = boost::grid_force_pairs<double, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::simple_point<double>, boost::simple_point<double>&, vertex_position_t> >, Cooling = boost::linear_cooling<double>, DisplacementMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::simple_point<double>*, std::vector<boost::simple_point<double>, std::allocator<boost::simple_point<double> > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, long unsigned int>, boost::simple_point<double>, boost::simple_point<double>&>]':
fruchterman_reingold.hpp:423: instantiated from 'static void boost::detail::fr_force_directed_layout<boost::detail::error_property_not_found>::run(const Graph&, PositionMap, Dim, Dim, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::detail::error_property_not_found, const boost::bgl_named_params<Param, Tag, Rest>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, PositionMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::simple_point<double>, boost::simple_point<double>&, vertex_position_t>, Dim = double, AttractiveForce = boost::square_distance_attractive_force, RepulsiveForce = boost::square_distance_repulsive_force, ForcePairs = boost::grid_force_pairs<double, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::simple_point<double>, boost::simple_point<double>&, vertex_position_t> >, Cooling = boost::linear_cooling<double>, Param = boost::square_distance_attractive_force, Tag = boost::attractive_force_t, Rest = boost::no_property]'
fruchterman_reingold.hpp:449: instantiated from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, Dim, Dim, const boost::bgl_named_params<P, T, R>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, PositionMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::simple_point<double>, boost::simple_point<double>&, vertex_position_t>, Dim = double, Param = boost::square_distance_attractive_force, Tag = boost::attractive_force_t, Rest = boost::no_property]'
fruchterman_reingold.hpp:470: instantiated from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, Dim, Dim) [with Graph = IndexGraph, PositionMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::simple_point<double>, boost::simple_point<double>&, vertex_position_t>, Dim = double]'
layout.cpp:112: instantiated from here
fruchterman_reingold.hpp:354: warning: suggest parentheses around assignment used as truth value
boostIncl/boost/graph/dijkstra_shortest_paths.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, DistanceMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >, VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::simple_point<double>, boost::no_property> >, long unsigned int>, Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, BinaryPredicate = std::less<double>, BinaryFunction = boost::closed_plus<double>, Infinity = double, DistanceZero = double]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c mincut.cpp -o mincut.o
boostIncl/boost/graph/push_relabel_max_flow.hpp: In member function 'void boost::detail::push_relabel<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue>::discharge(typename boost::graph_traits<Graph>::vertex_descriptor) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > >, boost::no_property, boost::listS>, EdgeCapacityMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > >, boost::edge_reverse_t>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, FlowValue = double]':
boostIncl/boost/graph/push_relabel_max_flow.hpp:340: warning: 'min_edge_iter$m_src' may be used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'SEXPREC* BGL_max_flow_internal(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*, E_MF_METHOD)':
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D82796$D82761$m_value$D80390$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D82796$D82761$m_value$D80390$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D82796$D82761$m_value$D80390$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D82796$D82761$m_value$D80390$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = Graph_ud, OutputIterator = std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > >]':
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D97030$D96995$m_value$D80390$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D97030$D96995$m_value$D80390$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D97030$D96995$m_value$D80390$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D97030$D96995$m_value$D80390$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c minST.cpp -o minST.o
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c ordering.cpp -o ordering.o
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c shortestPath.cpp -o shortestPath.o
boostIncl/boost/graph/dijkstra_shortest_paths.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>, DistanceMatrix = Basic2DMatrix<double>, VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>, long unsigned int>, Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, BinaryPredicate = std::less<double>, BinaryFunction = boost::closed_plus<double>, Infinity = double, DistanceZero = double]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c sna.cpp -o sna.o
boostIncl/boost/graph/dijkstra_shortest_paths.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>, DistanceMatrix = Basic2DMatrix<double>, VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>, long unsigned int>, Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, BinaryPredicate = std::less<double>, BinaryFunction = boost::closed_plus<double>, Infinity = double, DistanceZero = double]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'SEXPREC* lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)':
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D90684$D90649$m_value$D88988$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D90684$D90649$m_value$D88988$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D90684$D90649$m_value$D88988$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:263: warning: 'p$D90684$D90649$m_value$D88988$m_source' is used uninitialized in this function
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c transitive_closure.cpp -o transitive_closure.o
g++ -I/home/biocbuild/bbs-2.2-bioc/R/include -I/usr/local/include -IboostIncl -fpic -g -O2 -Wall -c wavefront.cpp -o wavefront.o
g++ -shared -L/usr/local/lib64 -o RBGL.so bbc.o cliques.o clusteringCoef.o dominatorTree.o hcs.o incrConnComp.o interfaces.o layout.o mincut.o minST.o ordering.o shortestPath.o sna.o transitive_closure.o wavefront.o
** R
** data
** inst
** preparing package for lazy loading
Loading required package: graph
** help
Note: removing empty section \value
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \note
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
Note: removing empty section \seealso
>>> Building/Updating help pages for package 'RBGL'
Formats: text html latex example
FileDep text html latex example
RBGL.overview text html latex
astarSearch text html latex example
bandwidth text html latex example
bccluster text html latex example
bellman.ford.sp text html latex example
betweenness text html latex example
bfs text html latex example
biConnComp text html latex example
clusteringCoef text html latex example
clusteringCoefAppr text html latex example
coloring text html latex example
connectedComp text html latex example
dag.sp text html latex example
dijkstra.sp text html latex example
dominatorTree text html latex example
edgeConn text html latex example
extractPath text html latex example
floyd.warshall.all.pairs.sp text html latex example
gprofile text html latex example
graphGenerator text html latex example
highlyConnSG text html latex example
incrConnComp text html latex example
is.triangulated text html latex example
isomorphism text html latex example
johnson.all.pairs.sp text html latex example
kCliques text html latex example
kCores text html latex example
lambdaSets text html latex example
layout text html latex example
maxClique text html latex example
maxFlow text html latex example
minCut text html latex example
mstree.kruskal text html latex example
mstree.prim text html latex example
ordering text html latex example
removeSelfLoops text html latex example
separates text html latex example
sp.between text html latex example
strongComp text html latex example
transClosure text html latex example
transitivity text html latex example
tsort text html latex example
wavefront text html latex example
** building package indices ...
* DONE (RBGL)