INSTALLATION WITH 'R CMD INSTALL --library=RBGL.buildbin-libdir RBGL_1.18.0.tar.gz'
* Installing *source* package 'RBGL' ...
untarring boost include tree...
** libs
** arch - i386
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -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> >, size_t>, double, double&>, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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> >, size_t>, 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&, size_t, 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, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, size_t>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >&>, 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> >, size_t>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int, std::allocator<long 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> >, size_t>, long long unsigned int, long 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> >, size_t>, 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> >, size_t>, boost::vertex_index_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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> >, size_t>, 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++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c cliques.cpp -o cliques.o
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c clusteringCoef.cpp -o clusteringCoef.o
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c dominatorTree.cpp -o dominatorTree.o
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c hcs.cpp -o hcs.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D104711$D104676$m_value$D102484$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D104711$D104676$m_value$D102484$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<Cluster>]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c incrConnComp.cpp -o incrConnComp.o
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c interfaces.cpp -o interfaces.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D109378$D109343$m_value$D88699$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D109378$D109343$m_value$D88699$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<BGL_edge_connectivity_U(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Edge, std::allocator<BGL_edge_connectivity_U(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Edge> > >]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -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> >, size_t>, 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> >, size_t>, Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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: 'dvis' is used uninitialized in this function
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c minST.cpp -o minST.o
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c mincut.cpp -o mincut.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D87720$D87685$m_value$D85188$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D87720$D87685$m_value$D85188$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D102540$D102505$m_value$D85188$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D102540$D102505$m_value$D85188$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<BGL_min_cut_U::Vertex, std::allocator<BGL_min_cut_U::Vertex> > >]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, EdgeCapacityMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, size_t, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, size_t, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, const boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc&, size_t, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_reverse_t>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, size_t>, FlowValue = double]':
boostIncl/boost/graph/push_relabel_max_flow.hpp:340: warning: 'min_edge_iter$m_src' may be used uninitialized in this function
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c ordering.cpp -o ordering.o
In file included from boostIncl/boost/graph/detail/sparse_ordering.hpp:25,
from boostIncl/boost/graph/cuthill_mckee_ordering.hpp:15,
from ordering.cpp:3:
boostIncl/boost/graph/iteration_macros.hpp:43:1: warning: "BGL_FORALL_VERTICES_T" redefined
In file included from boostIncl/boost/graph/isomorphism.hpp:21,
from ordering.cpp:2:
boostIncl/boost/graph/iteration_macros.hpp:43:1: warning: this is the location of the previous definition
In file included from boostIncl/boost/graph/detail/sparse_ordering.hpp:25,
from boostIncl/boost/graph/cuthill_mckee_ordering.hpp:15,
from ordering.cpp:3:
boostIncl/boost/graph/iteration_macros.hpp:75:1: warning: "BGL_FORALL_ADJ_T" redefined
In file included from boostIncl/boost/graph/isomorphism.hpp:21,
from ordering.cpp:2:
boostIncl/boost/graph/iteration_macros.hpp:75:1: warning: this is the location of the previous definition
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c shortestPath.cpp -o shortestPath.o
boostIncl/boost/graph/dijkstra_shortest_paths.hpp: In function 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, size_t, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, size_t>, Compare = std::less<double>, Combine = boost::closed_plus<double>, DistInf = double, DistZero = double]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c sna.cpp -o sna.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D96149$D96114$m_value$D94453$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D96149$D96114$m_value$D94453$m_source' is used uninitialized in this function
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>, size_t>, Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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: 'dvis' is used uninitialized in this function
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c transitive_closure.cpp -o transitive_closure.o
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/i386 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c wavefront.cpp -o wavefront.o
g++-4.2 -arch i386 -dynamiclib -Wl,-headerpad_max_install_names -undefined dynamic_lookup -single_module -multiply_defined suppress -L/usr/local/lib -o RBGL.so bbc.o cliques.o clusteringCoef.o dominatorTree.o hcs.o incrConnComp.o interfaces.o layout.o minST.o mincut.o ordering.o shortestPath.o sna.o transitive_closure.o wavefront.o -F/Library/Frameworks/R.framework/.. -framework R -Wl,-framework -Wl,CoreFoundation
** R
** data
** inst
** preparing package for lazy loading
Loading required package: graph
** help
>>> Building/Updating help pages for package 'RBGL'
Formats: text html latex example
FileDep text html latex example
RBGL.overview text html latex
Note: removing empty section \value in file 'astarSearch.Rd'
Note: removing empty section \seealso in file 'astarSearch.Rd'
astarSearch text html latex example
Note: removing empty section \seealso in file 'bandwidth.Rd'
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
Note: removing empty section \seealso in file 'biConnComp.Rd'
biConnComp text html latex example
Note: removing empty section \value in file 'boyerMyrvoldPlanarityTest.Rd'
Note: removing empty section \details in file 'boyerMyrvoldPlanarityTest.Rd'
Note: removing empty section \examples in file 'boyerMyrvoldPlanarityTest.Rd'
boyerMyrvoldPlanarityTest text html latex
Note: removing empty section \value in file 'chrobakPayneStraightLineDrawing.Rd'
Note: removing empty section \details in file 'chrobakPayneStraightLineDrawing.Rd'
Note: removing empty section \examples in file 'chrobakPayneStraightLineDrawing.Rd'
chrobakPayneStraightLineDrawing text html latex
clusteringCoef text html latex example
clusteringCoefAppr text html latex example
Note: removing empty section \seealso in file 'coloring.Rd'
coloring text html latex example
connectedComp text html latex example
dag.sp text html latex example
dijkstra.sp text html latex example
Note: removing empty section \seealso in file 'dominatorTree.Rd'
dominatorTree text html latex example
edgeConn text html latex example
Note: removing empty section \value in file 'edmondsMaxCardinalityMatching.Rd'
Note: removing empty section \details in file 'edmondsMaxCardinalityMatching.Rd'
Note: removing empty section \examples in file 'edmondsMaxCardinalityMatching.Rd'
edmondsMaxCardinalityMatching text html latex
extractPath text html latex example
floyd.warshall.all.pairs.sp text html latex example
Note: removing empty section \seealso in file 'gprofile.Rd'
gprofile text html latex example
graphGenerator text html latex example
highlyConnSG text html latex example
incrConnComp text html latex example
Note: removing empty section \seealso in file 'is.triangulated.Rd'
is.triangulated text html latex example
Note: removing empty section \value in file 'isKuratowskiSubgraph.Rd'
Note: removing empty section \details in file 'isKuratowskiSubgraph.Rd'
Note: removing empty section \examples in file 'isKuratowskiSubgraph.Rd'
isKuratowskiSubgraph text html latex
Note: removing empty section \value in file 'isStraightLineDrawing.Rd'
Note: removing empty section \details in file 'isStraightLineDrawing.Rd'
Note: removing empty section \examples in file 'isStraightLineDrawing.Rd'
isStraightLineDrawing text html latex
Note: removing empty section \seealso in file 'isomorphism.Rd'
isomorphism text html latex example
Note: removing empty section \note in file 'johnson.all.pairs.sp.Rd'
johnson.all.pairs.sp text html latex example
Note: removing empty section \seealso in file 'kCliques.Rd'
kCliques text html latex example
Note: removing empty section \seealso in file 'kCores.Rd'
kCores text html latex example
Note: removing empty section \value in file 'kolmogorovMaxFlow.Rd'
Note: removing empty section \details in file 'kolmogorovMaxFlow.Rd'
Note: removing empty section \examples in file 'kolmogorovMaxFlow.Rd'
kolmogorovMaxFlow text html latex
Note: removing empty section \seealso in file 'lambdaSets.Rd'
lambdaSets text html latex example
layout text html latex example
Note: removing empty section \value in file 'lengauerTarjanDominatorTree.Rd'
Note: removing empty section \details in file 'lengauerTarjanDominatorTree.Rd'
Note: removing empty section \examples in file 'lengauerTarjanDominatorTree.Rd'
lengauerTarjanDominatorTree text html latex
Note: removing empty section \value in file 'makeBiconnectedPlanar.Rd'
Note: removing empty section \details in file 'makeBiconnectedPlanar.Rd'
Note: removing empty section \examples in file 'makeBiconnectedPlanar.Rd'
makeBiconnectedPlanar text html latex
Note: removing empty section \value in file 'makeConnected.Rd'
Note: removing empty section \details in file 'makeConnected.Rd'
Note: removing empty section \examples in file 'makeConnected.Rd'
makeConnected text html latex
Note: removing empty section \value in file 'makeMaximalPlanar.Rd'
Note: removing empty section \details in file 'makeMaximalPlanar.Rd'
Note: removing empty section \examples in file 'makeMaximalPlanar.Rd'
makeMaximalPlanar text html latex
Note: removing empty section \seealso in file 'maxClique.Rd'
maxClique text html latex example
maxFlow text html latex example
Note: removing empty section \value in file 'maximumCycleRatio.Rd'
Note: removing empty section \details in file 'maximumCycleRatio.Rd'
Note: removing empty section \examples in file 'maximumCycleRatio.Rd'
maximumCycleRatio text html latex
minCut text html latex example
Note: removing empty section \value in file 'minimumCycleRatio.Rd'
Note: removing empty section \details in file 'minimumCycleRatio.Rd'
Note: removing empty section \examples in file 'minimumCycleRatio.Rd'
minimumCycleRatio text html latex
mstree.kruskal text html latex example
mstree.prim text html latex example
Note: removing empty section \seealso in file 'ordering.Rd'
ordering text html latex example
Note: removing empty section \value in file 'planarCanonicalOrdering.Rd'
Note: removing empty section \details in file 'planarCanonicalOrdering.Rd'
Note: removing empty section \examples in file 'planarCanonicalOrdering.Rd'
planarCanonicalOrdering text html latex
Note: removing empty section \value in file 'planarFaceTraversal.Rd'
Note: removing empty section \details in file 'planarFaceTraversal.Rd'
Note: removing empty section \examples in file 'planarFaceTraversal.Rd'
planarFaceTraversal text html latex
Note: removing empty section \seealso in file 'removeSelfLoops.Rd'
removeSelfLoops text html latex example
separates text html latex example
Note: removing empty section \value in file 'sloanStartEndVertices.Rd'
Note: removing empty section \details in file 'sloanStartEndVertices.Rd'
Note: removing empty section \examples in file 'sloanStartEndVertices.Rd'
sloanStartEndVertices text html latex
sp.between text html latex example
strongComp text html latex example
Note: removing empty section \seealso in file 'transClosure.Rd'
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)
INSTALLATION OF ppc LIBS WITH 'R_ARCH=/ppc R CMD INSTALL --library=RBGL.buildbin-libdir --libs-only RBGL_1.18.0.tar.gz'
* Installing *source* package 'RBGL' ...
untarring boost include tree...
** libs
** arch - ppc
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -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> >, size_t>, double, double&>, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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> >, size_t>, 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&, size_t, 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, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, size_t>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >&>, 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> >, size_t>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int, std::allocator<long 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> >, size_t>, long long unsigned int, long 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> >, size_t>, 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> >, size_t>, boost::vertex_index_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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> >, size_t>, 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++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c cliques.cpp -o cliques.o
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c clusteringCoef.cpp -o clusteringCoef.o
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c dominatorTree.cpp -o dominatorTree.o
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c hcs.cpp -o hcs.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D104485$D104450$m_value$D102258$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D104485$D104450$m_value$D102258$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<Cluster>]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c incrConnComp.cpp -o incrConnComp.o
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c interfaces.cpp -o interfaces.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D109159$D109124$m_value$D88492$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D109159$D109124$m_value$D88492$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<BGL_edge_connectivity_U(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Edge, std::allocator<BGL_edge_connectivity_U(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Edge> > >]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -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> >, size_t>, 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> >, size_t>, Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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: 'dvis' is used uninitialized in this function
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c minST.cpp -o minST.o
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c mincut.cpp -o mincut.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D87513$D87478$m_value$D84981$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D87513$D87478$m_value$D84981$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D102316$D102281$m_value$D84981$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D102316$D102281$m_value$D84981$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<BGL_min_cut_U::Vertex, std::allocator<BGL_min_cut_U::Vertex> > >]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, EdgeCapacityMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, size_t, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, size_t, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, const boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc&, size_t, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_reverse_t>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, size_t>, FlowValue = double]':
boostIncl/boost/graph/push_relabel_max_flow.hpp:340: warning: 'min_edge_iter$m_src' may be used uninitialized in this function
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c ordering.cpp -o ordering.o
In file included from boostIncl/boost/graph/detail/sparse_ordering.hpp:25,
from boostIncl/boost/graph/cuthill_mckee_ordering.hpp:15,
from ordering.cpp:3:
boostIncl/boost/graph/iteration_macros.hpp:43:1: warning: "BGL_FORALL_VERTICES_T" redefined
In file included from boostIncl/boost/graph/isomorphism.hpp:21,
from ordering.cpp:2:
boostIncl/boost/graph/iteration_macros.hpp:43:1: warning: this is the location of the previous definition
In file included from boostIncl/boost/graph/detail/sparse_ordering.hpp:25,
from boostIncl/boost/graph/cuthill_mckee_ordering.hpp:15,
from ordering.cpp:3:
boostIncl/boost/graph/iteration_macros.hpp:75:1: warning: "BGL_FORALL_ADJ_T" redefined
In file included from boostIncl/boost/graph/isomorphism.hpp:21,
from ordering.cpp:2:
boostIncl/boost/graph/iteration_macros.hpp:75:1: warning: this is the location of the previous definition
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c shortestPath.cpp -o shortestPath.o
boostIncl/boost/graph/dijkstra_shortest_paths.hpp: In function 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, size_t, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, size_t>, Compare = std::less<double>, Combine = boost::closed_plus<double>, DistInf = double, DistZero = double]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c sna.cpp -o sna.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D95939$D95904$m_value$D94243$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D95939$D95904$m_value$D94243$m_source' is used uninitialized in this function
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>, size_t>, Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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: 'dvis' is used uninitialized in this function
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c transitive_closure.cpp -o transitive_closure.o
g++-4.0 -arch ppc -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/ppc -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c wavefront.cpp -o wavefront.o
g++-4.2 -arch ppc -dynamiclib -Wl,-headerpad_max_install_names -undefined dynamic_lookup -single_module -multiply_defined suppress -L/usr/local/lib -o RBGL.so bbc.o cliques.o clusteringCoef.o dominatorTree.o hcs.o incrConnComp.o interfaces.o layout.o minST.o mincut.o ordering.o shortestPath.o sna.o transitive_closure.o wavefront.o -F/Library/Frameworks/R.framework/.. -framework R -Wl,-framework -Wl,CoreFoundation
* DONE (RBGL)
INSTALLATION OF x86_64 LIBS WITH 'R_ARCH=/x86_64 R CMD INSTALL --library=RBGL.buildbin-libdir --libs-only RBGL_1.18.0.tar.gz'
* Installing *source* package 'RBGL' ...
untarring boost include tree...
** libs
** arch - x86_64
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -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> >, size_t>, double, double&>, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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> >, size_t>, 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&, size_t, 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, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double, boost::no_property> >, size_t>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, size_t>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, size_t> > >&>, 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> >, size_t>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int, std::allocator<long 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> >, size_t>, long long unsigned int, long 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> >, size_t>, 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> >, size_t>, boost::vertex_index_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, size_t, 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> >, size_t>, 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++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c cliques.cpp -o cliques.o
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c clusteringCoef.cpp -o clusteringCoef.o
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c dominatorTree.cpp -o dominatorTree.o
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c hcs.cpp -o hcs.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D104697$D104662$m_value$D102470$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D104697$D104662$m_value$D102470$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<Cluster>]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c incrConnComp.cpp -o incrConnComp.o
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c interfaces.cpp -o interfaces.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D109361$D109326$m_value$D88699$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D109361$D109326$m_value$D88699$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<BGL_edge_connectivity_U(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Edge, std::allocator<BGL_edge_connectivity_U(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Edge> > >]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -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> >, size_t>, 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 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, size_t, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, size_t>, Compare = std::less<double>, Combine = boost::closed_plus<double>, DistInf = double, DistZero = double]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c minST.cpp -o minST.o
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c mincut.cpp -o mincut.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D87720$D87685$m_value$D85188$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D87720$D87685$m_value$D85188$m_source' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, size_t, boost::property<boost::edge_residual_capacity_t, size_t, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D102525$D102490$m_value$D85188$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D102525$D102490$m_value$D85188$m_source' is used uninitialized in this function
boostIncl/boost/graph/edge_connectivity.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<BGL_min_cut_U::Vertex, std::allocator<BGL_min_cut_U::Vertex> > >]':
boostIncl/boost/graph/edge_connectivity.hpp:32: warning: 'p' may be used uninitialized in this function
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::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, EdgeCapacityMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, size_t, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, size_t, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, const boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc&, size_t, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::edge_connectivity(VertexListGraph&, OutputIterator)::Tr_edge_desc, boost::no_property> > >, boost::edge_reverse_t>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, size_t>, FlowValue = double]':
boostIncl/boost/graph/push_relabel_max_flow.hpp:340: warning: 'min_edge_iter$m_src' may be used uninitialized in this function
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c ordering.cpp -o ordering.o
In file included from boostIncl/boost/graph/detail/sparse_ordering.hpp:25,
from boostIncl/boost/graph/cuthill_mckee_ordering.hpp:15,
from ordering.cpp:3:
boostIncl/boost/graph/iteration_macros.hpp:43:1: warning: "BGL_FORALL_VERTICES_T" redefined
In file included from boostIncl/boost/graph/isomorphism.hpp:21,
from ordering.cpp:2:
boostIncl/boost/graph/iteration_macros.hpp:43:1: warning: this is the location of the previous definition
In file included from boostIncl/boost/graph/detail/sparse_ordering.hpp:25,
from boostIncl/boost/graph/cuthill_mckee_ordering.hpp:15,
from ordering.cpp:3:
boostIncl/boost/graph/iteration_macros.hpp:75:1: warning: "BGL_FORALL_ADJ_T" redefined
In file included from boostIncl/boost/graph/isomorphism.hpp:21,
from ordering.cpp:2:
boostIncl/boost/graph/iteration_macros.hpp:75:1: warning: this is the location of the previous definition
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c shortestPath.cpp -o shortestPath.o
boostIncl/boost/graph/dijkstra_shortest_paths.hpp: In function 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, size_t, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, size_t>, Compare = std::less<double>, Combine = boost::closed_plus<double>, DistInf = double, DistZero = double]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c sna.cpp -o sna.o
boostIncl/boost/graph/detail/adjacency_list.hpp: In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, boost::vec_adj_list_impl<G, C, B>&) [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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>, 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, lambdaSets(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)::Tr_edge_desc, boost::no_property> > >, boost::no_property, boost::listS>::config>]':
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D96146$D96111$m_value$D94450$m_target' is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: 'p$D96146$D96111$m_value$D94450$m_source' is used uninitialized in this function
boostIncl/boost/graph/dijkstra_shortest_paths.hpp: In function 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, DijkstraVisitor = boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap = boost::dummy_property_map, DistanceMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, size_t, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, size_t>, Compare = std::less<double>, Combine = boost::closed_plus<double>, DistInf = double, DistZero = double]':
boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: 'bfs_vis$m_decreased' is used uninitialized in this function
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c transitive_closure.cpp -o transitive_closure.o
g++-4.0 -arch x86_64 -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include -I/Library/Frameworks/R.framework/Versions/2.8/Resources/include/x86_64 -I/usr/local/include -IboostIncl -fPIC -g -O2 -Wall -fasm-blocks -c wavefront.cpp -o wavefront.o
g++-4.2 -arch x86_64 -dynamiclib -Wl,-headerpad_max_install_names -undefined dynamic_lookup -single_module -multiply_defined suppress -L/usr/local/lib -o RBGL.so bbc.o cliques.o clusteringCoef.o dominatorTree.o hcs.o incrConnComp.o interfaces.o layout.o minST.o mincut.o ordering.o shortestPath.o sna.o transitive_closure.o wavefront.o -F/Library/Frameworks/R.framework/.. -framework R -Wl,-framework -Wl,CoreFoundation
* DONE (RBGL)