Package: RBGL

Version: 1.22.0

Command: /Library/Frameworks/R.framework/Versions/2.10/Resources/bin/R CMD check --no-vignettes RBGL_1.22.0.tar.gz

StartedAt: 2009-12-14 06:38:58 -0800 (Mon, 14 Dec 2009)

EndedAt: 2009-12-14 06:41:43 -0800 (Mon, 14 Dec 2009)

EllapsedTime: 165.4 seconds

RetCode: 0

Status: WARNINGS

CheckDir: RBGL.Rcheck

Warnings: 1

* checking for working pdflatex ... OK
* using log directory '/Users/biocbuild/bbs-2.5-bioc/meat/RBGL.Rcheck'
* using R version 2.10.0 Patched (2009-10-27 r50222)
* using session charset: UTF-8
* using option '--no-vignettes'
* checking for file 'RBGL/DESCRIPTION' ... OK
* this is package 'RBGL' version '1.22.0'
* checking package name space information ... OK
* checking package dependencies ... OK
* checking if this is a source package ... OK
* checking whether package 'RBGL' can be installed ... WARNING
Found the following significant warnings:
  boostIncl/boost/graph/dijkstra_shortest_paths.hpp:81: warning: ‘bfs_vis$m_decreased’ is used uninitialized in this function
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D118088$D118053$m_value$D115842$m_target’ is used uninitialized in this function
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D118088$D118053$m_value$D115842$m_source’ is used uninitialized in this function
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D122578$D122543$m_value$D101561$m_target’ is used uninitialized in this function
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D122578$D122543$m_value$D101561$m_source’ 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
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D102481$D102446$m_value$D99929$m_target’ is used uninitialized in this function
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D102481$D102446$m_value$D99929$m_source’ is used uninitialized in this function
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D117521$D117486$m_value$D99929$m_target’ is used uninitialized in this function
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D117521$D117486$m_value$D99929$m_source’ is used uninitialized in this function
  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
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D109037$D109002$m_value$D107322$m_target’ is used uninitialized in this function
  boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D109037$D109002$m_value$D107322$m_source’ 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
See '/Users/biocbuild/bbs-2.5-bioc/meat/RBGL.Rcheck/00install.out' for details.
* checking package directory ... OK
* checking for portable file names ... OK
* checking for sufficient/correct file permissions ... OK
* checking DESCRIPTION meta-information ... OK
* checking top-level files ... OK
* checking index information ... OK
* checking package subdirectories ... OK
* checking R files for non-ASCII characters ... OK
* checking R files for syntax errors ... OK
* checking whether the package can be loaded ... OK
* checking whether the package can be loaded with stated dependencies ... OK
* checking whether the name space can be loaded with stated dependencies ... OK
* checking for unstated dependencies in R code ... OK
* checking S3 generic/method consistency ... OK
* checking replacement functions ... OK
* checking foreign function calls ... OK
* checking R code for possible problems ... OK
* checking Rd files ... NOTE
prepare_Rd: astarSearch.Rd:14-15: Dropping empty section \value
prepare_Rd: astarSearch.Rd:27: Dropping empty section \seealso
prepare_Rd: bandwidth.Rd:36: Dropping empty section \seealso
prepare_Rd: biConnComp.Rd:52: Dropping empty section \seealso
prepare_Rd: boyerMyrvoldPlanarityTest.Rd:16-17: Dropping empty section \details
prepare_Rd: boyerMyrvoldPlanarityTest.Rd:19-20: Dropping empty section \value
prepare_Rd: boyerMyrvoldPlanarityTest.Rd:33-34: Dropping empty section \examples
prepare_Rd: chrobakPayneStraightLineDrawing.Rd:16-17: Dropping empty section \details
prepare_Rd: chrobakPayneStraightLineDrawing.Rd:19-20: Dropping empty section \value
prepare_Rd: coloring.Rd:42: Dropping empty section \seealso
prepare_Rd: dominatorTree.Rd:37: Dropping empty section \seealso
prepare_Rd: edmondsMaxCardinalityMatching.Rd:16-17: Dropping empty section \details
prepare_Rd: edmondsMaxCardinalityMatching.Rd:19-20: Dropping empty section \value
prepare_Rd: edmondsOptimumBranching.Rd:20-21: Dropping empty section \value
prepare_Rd: gprofile.Rd:37: Dropping empty section \seealso
prepare_Rd: is.triangulated.Rd:43: Dropping empty section \seealso
prepare_Rd: isKuratowskiSubgraph.Rd:16-17: Dropping empty section \details
prepare_Rd: isKuratowskiSubgraph.Rd:19-20: Dropping empty section \value
prepare_Rd: isStraightLineDrawing.Rd:17-18: Dropping empty section \details
prepare_Rd: isStraightLineDrawing.Rd:20-21: Dropping empty section \value
prepare_Rd: isomorphism.Rd:42: Dropping empty section \seealso
prepare_Rd: johnson.all.pairs.sp.Rd:34: Dropping empty section \note
prepare_Rd: kCliques.Rd:45: Dropping empty section \seealso
prepare_Rd: kCores.Rd:39: Dropping empty section \seealso
prepare_Rd: lambdaSets.Rd:45: Dropping empty section \seealso
prepare_Rd: makeBiconnectedPlanar.Rd:16-17: Dropping empty section \details
prepare_Rd: makeBiconnectedPlanar.Rd:19-20: Dropping empty section \value
prepare_Rd: makeConnected.Rd:16-17: Dropping empty section \details
prepare_Rd: makeConnected.Rd:19-20: Dropping empty section \value
prepare_Rd: makeMaximalPlanar.Rd:16-17: Dropping empty section \details
prepare_Rd: makeMaximalPlanar.Rd:19-20: Dropping empty section \value
prepare_Rd: maxClique.Rd:35: Dropping empty section \seealso
prepare_Rd: maximumCycleRatio.Rd:16-17: Dropping empty section \details
prepare_Rd: maximumCycleRatio.Rd:19-20: Dropping empty section \value
prepare_Rd: maximumCycleRatio.Rd:33-34: Dropping empty section \examples
prepare_Rd: minimumCycleRatio.Rd:16-17: Dropping empty section \details
prepare_Rd: minimumCycleRatio.Rd:19-20: Dropping empty section \value
prepare_Rd: minimumCycleRatio.Rd:33-34: Dropping empty section \examples
prepare_Rd: ordering.Rd:77: Dropping empty section \seealso
prepare_Rd: planarCanonicalOrdering.Rd:16-17: Dropping empty section \details
prepare_Rd: planarCanonicalOrdering.Rd:19-20: Dropping empty section \value
prepare_Rd: planarFaceTraversal.Rd:16-17: Dropping empty section \details
prepare_Rd: planarFaceTraversal.Rd:19-20: Dropping empty section \value
prepare_Rd: removeSelfLoops.Rd:27: Dropping empty section \seealso
prepare_Rd: sloanStartEndVertices.Rd:16-17: Dropping empty section \details
prepare_Rd: sloanStartEndVertices.Rd:19-20: Dropping empty section \value
prepare_Rd: sloanStartEndVertices.Rd:33-34: Dropping empty section \examples
prepare_Rd: transClosure.Rd:36: Dropping empty section \seealso
* checking Rd metadata ... OK
* checking Rd cross-references ... OK
* checking for missing documentation entries ... OK
* checking for code/documentation mismatches ... OK
* checking Rd \usage sections ... OK
* checking data for non-ASCII characters ... OK
* checking line endings in C/C++/Fortran sources/headers ... OK
* checking line endings in Makefiles ... OK
* checking for portable compilation flags in Makevars ... OK
* checking for portable use of $BLAS_LIBS ... OK
* checking examples ... OK
* checking package vignettes in 'inst/doc' ... SKIPPED
* checking PDF version of manual ... OK

WARNING: There was 1 warning, see
  /Users/biocbuild/bbs-2.5-bioc/meat/RBGL.Rcheck/00check.log
for details

* install options are ' --no-html'

* installing *source* package ‘RBGL’ ...
untarring boost include tree...
** libs
** arch - i386
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Resources/include -I/Library/Frameworks/R.framework/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/Resources/include -I/Library/Frameworks/R.framework/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/Resources/include -I/Library/Frameworks/R.framework/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/Resources/include -I/Library/Frameworks/R.framework/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/Resources/include -I/Library/Frameworks/R.framework/Resources/include/i386  -I/usr/local/include   -IboostIncl  -fPIC  -g -O2 -Wall -fasm-blocks -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Resources/include -I/Library/Frameworks/R.framework/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$D118088$D118053$m_value$D115842$m_target’ is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D118088$D118053$m_value$D115842$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/Resources/include -I/Library/Frameworks/R.framework/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/Resources/include -I/Library/Frameworks/R.framework/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$D122578$D122543$m_value$D101561$m_target’ is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D122578$D122543$m_value$D101561$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/Resources/include -I/Library/Frameworks/R.framework/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 ‘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/Resources/include -I/Library/Frameworks/R.framework/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/Resources/include -I/Library/Frameworks/R.framework/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$D102481$D102446$m_value$D99929$m_target’ is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D102481$D102446$m_value$D99929$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$D117521$D117486$m_value$D99929$m_target’ is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D117521$D117486$m_value$D99929$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<std::_Bit_type> > >]’:
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/Resources/include -I/Library/Frameworks/R.framework/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/Resources/include -I/Library/Frameworks/R.framework/Resources/include/i386  -I/usr/local/include   -IboostIncl  -fPIC  -g -O2 -Wall -fasm-blocks -c planar.cpp -o planar.o
planar.cpp: In function ‘SEXPREC* planarFaceTraversal(SEXPREC*, SEXPREC*, SEXPREC*)’:
planar.cpp:151: warning: comparison between signed and unsigned integer expressions
planar.cpp:153: warning: comparison between signed and unsigned integer expressions
planar.cpp:161: warning: comparison between signed and unsigned integer expressions
planar.cpp:165: warning: comparison between signed and unsigned integer expressions
planar.cpp: In function ‘SEXPREC* planarCanonicalOrdering(SEXPREC*, SEXPREC*, SEXPREC*)’:
planar.cpp:256: warning: comparison between signed and unsigned integer expressions
planar.cpp: In function ‘SEXPREC* isStraightLineDrawing(SEXPREC*, SEXPREC*, SEXPREC*, SEXPREC*)’:
planar.cpp:369: warning: comparison between signed and unsigned integer expressions
planar.cpp: In function ‘SEXPREC* isKuratowskiSubgraph(SEXPREC*, SEXPREC*, SEXPREC*)’:
planar.cpp:461: warning: unused variable ‘i’
planar.cpp: In function ‘SEXPREC* makeConnected(SEXPREC*, SEXPREC*, SEXPREC*)’:
planar.cpp:485: warning: comparison between signed and unsigned integer expressions
planar.cpp: In function ‘SEXPREC* makeBiconnectedPlanar(SEXPREC*, SEXPREC*, SEXPREC*)’:
planar.cpp:539: warning: comparison between signed and unsigned integer expressions
boostIncl/boost/graph/chrobak_payne_drawing.hpp: In function ‘void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS>, PlanarEmbedding = boost::iterator_property_map<__gnu_cxx::__normal_iterator<Edge_Vec_t*, std::vector<Edge_Vec_t, std::allocator<Edge_Vec_t> > >, Vertex_Index_t, Edge_Vec_t, Edge_Vec_t&>, ForwardIterator = __gnu_cxx::__normal_iterator<std::_Bit_type*, std::vector<size_t, std::allocator<std::_Bit_type> > >, GridPositionMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<coord_t*, std::vector<coord_t, std::allocator<coord_t> > >, Vertex_Index_t, coord_t, coord_t&>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::no_property>, size_t>]’:
boostIncl/boost/graph/chrobak_payne_drawing.hpp:208: warning: ‘next_to_rightmost’ may be used uninitialized in this function
boostIncl/boost/graph/max_cardinality_matching.hpp: In member function ‘bool boost::edmonds_augmenting_path_finder<Graph, MateMap, VertexIndexMap>::augment_matching() [with Graph = R_adjacency_list<boost::undirectedS, int>, MateMap = std::_Bit_type*, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>, size_t>]’:
boostIncl/boost/graph/max_cardinality_matching.hpp:231: warning: ‘w’ may be used uninitialized in this function
boostIncl/boost/graph/max_cardinality_matching.hpp:231: warning: ‘v’ may be used uninitialized in this function
boostIncl/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function ‘void boost::boyer_myrvold_impl<Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy>::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = std::back_insert_iterator<Edge_Vec_t>, EdgeIndexMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, size_t, boost::property<boost::edge_index_t, int, boost::no_property>, boost::edge_index_t>, Graph = planarGraph, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::no_property>, size_t>, StoreOldHandlesPolicy = boost::graph::detail::store_old_handles, StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’:
boostIncl/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1279: warning: ‘previous_vertex’ may be used uninitialized in this function
boostIncl/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1238: warning: ‘bicomp_root’ may be used uninitialized in this function
boostIncl/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1237: warning: ‘z’ may be used uninitialized in this function
boostIncl/boost/graph/planar_canonical_ordering.hpp: In function ‘void boost::planar_canonical_ordering(const Graph&, PlanarEmbedding, OutputIterator, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS>, PlanarEmbedding = boost::iterator_property_map<__gnu_cxx::__normal_iterator<Edge_Vec_t*, std::vector<Edge_Vec_t, std::allocator<Edge_Vec_t> > >, Vertex_Index_t, Edge_Vec_t, Edge_Vec_t&>, OutputIterator = std::back_insert_iterator<Vertex_Vec_t>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::no_property>, size_t>]’:
boostIncl/boost/graph/planar_canonical_ordering.hpp:68: warning: ‘second_vertex’ may be used uninitialized in this function
g++-4.0 -arch i386 -I/Library/Frameworks/R.framework/Resources/include -I/Library/Frameworks/R.framework/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 ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>, DistanceMatrix = Basic2DMatrix<double>, VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>, size_t>, Weight = boost::adj_list_edge_property_map<boost::directed_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/Resources/include -I/Library/Frameworks/R.framework/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$D109037$D109002$m_value$D107322$m_target’ is used uninitialized in this function
boostIncl/boost/graph/detail/adjacency_list.hpp:270: warning: ‘p$D109037$D109002$m_value$D107322$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 i386 -I/Library/Frameworks/R.framework/Resources/include -I/Library/Frameworks/R.framework/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/Resources/include -I/Library/Frameworks/R.framework/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 edmonds_optimum_branching.o hcs.o incrConnComp.o interfaces.o layout.o minST.o mincut.o ordering.o planar.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
** help
*** installing help indices
** building package indices ...
* DONE (RBGL)