Back to the "Multiple platform build/check report" A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q [R] S  T  U  V  W  X  Y  Z 

BioC 3.4: CHECK report for RBGL on moscato1

This page was generated on 2016-09-21 03:41:15 -0700 (Wed, 21 Sep 2016).

Package 974/1257HostnameOS / ArchINSTALLBUILDCHECKBUILD BIN
RBGL 1.49.3
Bioconductor Package Maintainer
Snapshot Date: 2016-09-19 19:15:14 -0700 (Mon, 19 Sep 2016)
URL: https://hedgehog.fhcrc.org/bioconductor/trunk/madman/Rpacks/RBGL
Last Changed Rev: 120033 / Revision: 121152
Last Changed Date: 2016-08-10 14:16:54 -0700 (Wed, 10 Aug 2016)
zin1 Linux (Ubuntu 16.04 LTS) / x86_64  OK  OK  WARNINGS UNNEEDED, same version exists in internal repository
moscato1 Windows Server 2008 R2 Standard (64-bit) / x64  OK  OK [ OK ] OK UNNEEDED, same version exists in internal repository
morelia Mac OS X Mavericks (10.9.5) / x86_64  OK  OK  WARNINGS  OK UNNEEDED, same version exists in internal repository

Summary

Package: RBGL
Version: 1.49.3
Command: rm -rf RBGL.buildbin-libdir RBGL.Rcheck && mkdir RBGL.buildbin-libdir RBGL.Rcheck && D:\biocbld\bbs-3.4-bioc\R\bin\R.exe CMD INSTALL --build --merge-multiarch --library=RBGL.buildbin-libdir RBGL_1.49.3.tar.gz >RBGL.Rcheck\00install.out 2>&1 && cp RBGL.Rcheck\00install.out RBGL-install.out && D:\biocbld\bbs-3.4-bioc\R\bin\R.exe CMD check --library=RBGL.buildbin-libdir --install="check:RBGL-install.out" --force-multiarch --no-vignettes --timings RBGL_1.49.3.tar.gz
StartedAt: 2016-09-20 14:50:37 -0700 (Tue, 20 Sep 2016)
EndedAt: 2016-09-20 14:58:01 -0700 (Tue, 20 Sep 2016)
EllapsedTime: 444.6 seconds
RetCode: 0
Status:  OK  
CheckDir: RBGL.Rcheck
Warnings: 0

Command output

##############################################################################
##############################################################################
###
### Running command:
###
###   rm -rf RBGL.buildbin-libdir RBGL.Rcheck && mkdir RBGL.buildbin-libdir RBGL.Rcheck && D:\biocbld\bbs-3.4-bioc\R\bin\R.exe CMD INSTALL --build --merge-multiarch --library=RBGL.buildbin-libdir RBGL_1.49.3.tar.gz >RBGL.Rcheck\00install.out 2>&1 && cp RBGL.Rcheck\00install.out RBGL-install.out  && D:\biocbld\bbs-3.4-bioc\R\bin\R.exe CMD check --library=RBGL.buildbin-libdir --install="check:RBGL-install.out" --force-multiarch --no-vignettes --timings RBGL_1.49.3.tar.gz
###
##############################################################################
##############################################################################


* using log directory 'D:/biocbld/bbs-3.4-bioc/meat/RBGL.Rcheck'
* using R version 3.3.1 (2016-06-21)
* using platform: x86_64-w64-mingw32 (64-bit)
* using session charset: ISO8859-1
* using option '--no-vignettes'
* checking for file 'RBGL/DESCRIPTION' ... OK
* this is package 'RBGL' version '1.49.3'
* checking package namespace information ... OK
* checking package dependencies ... OK
* checking if this is a source package ... OK
* checking if there is a namespace ... OK
* checking for hidden files and directories ... OK
* checking for portable file names ... OK
* checking whether package 'RBGL' can be installed ... OK
* checking installed package size ... NOTE
  installed size is  5.6Mb
  sub-directories of 1Mb or more:
    libs        2.8Mb
    old_boost   1.9Mb
* checking package directory ... OK
* checking 'build' directory ... OK
* checking DESCRIPTION meta-information ... NOTE
Package listed in more than one of Depends, Imports, Suggests, Enhances:
  'methods'
A package should be listed in only one of these fields.
* checking top-level files ... OK
* checking for left-over 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
* loading checks for arch 'i386'
** checking whether the package can be loaded ... OK
** checking whether the package can be loaded with stated dependencies ... OK
** checking whether the package can be unloaded cleanly ... OK
** checking whether the namespace can be loaded with stated dependencies ... OK
** checking whether the namespace can be unloaded cleanly ... OK
* loading checks for arch 'x64'
** checking whether the package can be loaded ... OK
** checking whether the package can be loaded with stated dependencies ... OK
** checking whether the package can be unloaded cleanly ... OK
** checking whether the namespace can be loaded with stated dependencies ... OK
** checking whether the namespace can be unloaded cleanly ... OK
* checking 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 ... OK
* 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 Rd contents ... OK
* checking for unstated dependencies in examples ... OK
* checking contents of 'data' directory ... OK
* checking data for non-ASCII characters ... OK
* checking data for ASCII and uncompressed saves ... OK
* checking line endings in C/C++/Fortran sources/headers ... OK
* checking line endings in Makefiles ... OK
* checking compilation flags in Makevars ... OK
* checking for GNU extensions in Makefiles ... OK
* checking for portable use of $(BLAS_LIBS) and $(LAPACK_LIBS) ... OK
* checking compiled code ... NOTE
Note: information on .o files for i386 is not available
Note: information on .o files for x64 is not available
File 'D:/biocbld/bbs-3.4-bioc/meat/RBGL.buildbin-libdir/RBGL/libs/i386/RBGL.dll':
  Found 'abort', possibly from 'abort' (C), 'runtime' (Fortran)
  Found 'exit', possibly from 'exit' (C), 'stop' (Fortran)
  Found 'printf', possibly from 'printf' (C)

Compiled code should not call entry points which might terminate R nor
write to stdout/stderr instead of to the console, nor the system RNG.
The detected symbols are linked into the code but might come from
libraries and not actually be called.

See 'Writing portable packages' in the 'Writing R Extensions' manual.
* checking installed files from 'inst/doc' ... OK
* checking files in 'vignettes' ... OK
* checking examples ...
** running examples for arch 'i386' ... OK
** running examples for arch 'x64' ... OK
* checking for unstated dependencies in 'tests' ... OK
* checking tests ...
** running tests for arch 'i386' ...
  Running 'runTests.R'
 OK
** running tests for arch 'x64' ...
  Running 'runTests.R'
 OK
* checking for unstated dependencies in vignettes ... OK
* checking package vignettes in 'inst/doc' ... OK
* checking running R code from vignettes ... SKIPPED
* checking re-building of vignette outputs ... SKIPPED
* checking PDF version of manual ... OK
* DONE

Status: 3 NOTEs
See
  'D:/biocbld/bbs-3.4-bioc/meat/RBGL.Rcheck/00check.log'
for details.

RBGL.Rcheck/00install.out:


install for i386

* installing *source* package 'RBGL' ...
found  rbgl_trimmed_boost_1_61_0  header sources and tar archive;\n using what is there.
** libs
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c bbc.cpp -o bbc.o
In file included from bbc.cpp:3:0:
rbgl_trimmed_boost_1_61_0/boost/graph/bc_clustering.hpp: In function 'void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap)':
rbgl_trimmed_boost_1_61_0/boost/graph/bc_clustering.hpp:118:5: warning: typedef 'vertices_size_type' locally defined but not used [-Wunused-local-typedefs]
     vertices_size_type;
     ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c cliques.cpp -o cliques.o
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c clusteringCoef.cpp -o clusteringCoef.o
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c dominatorTree.cpp -o dominatorTree.o
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o
In file included from edmonds_optimum_branching.hpp:93:0,
                 from edmonds_optimum_branching.cpp:3:
edmonds_optimum_branching_impl.hpp: In function 'void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator)':
edmonds_optimum_branching_impl.hpp:522:71: warning: typedef 'EdgeIter' locally defined but not used [-Wunused-local-typedefs]
     typedef typename graph_traits<TEdgeListGraph>::edge_iterator      EdgeIter;
                                                                       ^
edmonds_optimum_branching_impl.hpp:523:71: warning: typedef 'weight_t' locally defined but not used [-Wunused-local-typedefs]
     typedef typename property_traits<TWeightMap>::value_type          weight_t;
                                                                       ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c hcs.cpp -o hcs.o
In file included from mincut.hpp:4:0,
                 from hcs.cpp:2:
rbgl_trimmed_boost_1_61_0/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<std::vector<unsigned int> >; typename boost::graph_traits<G>::edges_size_type = unsigned int]':
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp:32:42: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
       typename Traits::vertex_descriptor p;
                                          ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c incrConnComp.cpp -o incrConnComp.o
In file included from incrConnComp.cpp:2:0:
incrConnComp.cpp: In function 'SEXPREC* BGL_incr_comp_internal(SEXP, SEXP, SEXP, E_IC_METHOD)':
incrConnComp.cpp:74:32: warning: unused variable 'child_index' [-Wunused-variable]
      BOOST_FOREACH(VertexIndex child_index, components[current_index]) {
                                ^
rbgl_trimmed_boost_1_61_0/boost/foreach.hpp:1107:14: note: in definition of macro 'BOOST_FOREACH'
         for (VAR = BOOST_FOREACH_DEREF(COL); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true)
              ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c interfaces.cpp -o interfaces.o
interfaces.cpp: In function 'SEXPREC* BGL_tsort_D(SEXP, SEXP, SEXP)':
interfaces.cpp:57:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:61:62: warning: typedef 'Color' locally defined but not used [-Wunused-local-typedefs]
         typedef property_map<Graph_dd, vertex_color_t>::type Color;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_bfs_D(SEXP, SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:98:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:99:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_dfs_D(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:142:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:143:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_connected_components_U(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:198:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:199:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_strong_components_D(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:225:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:226:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_biconnected_components_U(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:252:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:253:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_articulation_points_U(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:295:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
interfaces.cpp: In function 'SEXPREC* BGL_edge_connectivity_U(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:320:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_sequential_vertex_coloring(SEXP, SEXP, SEXP)':
interfaces.cpp:360:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:361:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
In file included from interfaces.cpp:7:0:
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp: In function 'typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; typename boost::graph_traits<G>::degree_size_type = unsigned int]':
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp:32:42: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
       typename Traits::vertex_descriptor p;
                                          ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c minST.cpp -o minST.o
minST.cpp: In function 'SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)':
minST.cpp:14:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
                                                              ^
minST.cpp: In function 'SEXPREC* BGL_KMST_U(SEXP, SEXP, SEXP, SEXP)':
minST.cpp:48:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
minST.cpp: In function 'SEXPREC* BGL_PRIM_U(SEXP, SEXP, SEXP, SEXP)':
minST.cpp:81:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from minST.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, unsigned int>, unsigned int, unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, unsigned int>, unsigned int, unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& ei +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from minST.cpp:2:0:
rbgl_trimmed_boost_1_61_0/boost/graph/kruskal_min_spanning_tree.hpp:78:51: note: '*((void*)& ei +24)' was declared here
       typename graph_traits<Graph>::edge_iterator ei, eiend;
                                                   ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:41:0,
                 from RBGL.hpp:37,
                 from minST.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/edge.hpp:25:34: warning: '*((void*)(& ei)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
         : m_source(s), m_target(d) { }
                                  ^
In file included from minST.cpp:2:0:
rbgl_trimmed_boost_1_61_0/boost/graph/kruskal_min_spanning_tree.hpp:78:51: note: '*((void*)(& ei)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' was declared here
       typename graph_traits<Graph>::edge_iterator ei, eiend;
                                                   ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c mincut.cpp -o mincut.o
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from mincut.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'SEXPREC* BGL_max_flow_internal(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, E_MF_METHOD)':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& ei +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
mincut.cpp:99:19: note: '*((void*)& ei +24)' was declared here
     edge_iterator ei, e_end;
                   ^
mincut.cpp:103:54: warning: '*((void*)(& ei)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
             INTEGER(eList)[i++] = source(*ei, flow_g);
                                                      ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246:0,
                 from RBGL.hpp:37,
                 from mincut.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:152:62: warning: '*((void*)(& ei)+16).__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > > > > >::_M_current' may be used uninitialized in this function [-Wmaybe-uninitialized]
                               &(*this->base()).get_property());
                                                              ^
mincut.cpp:99:19: note: '*((void*)(& ei)+16).__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > > > > >::_M_current' was declared here
     edge_iterator ei, e_end;
                   ^
In file included from mincut.hpp:4:0,
                 from mincut.cpp:2:
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp: In function 'typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<unsigned int> >; typename boost::graph_traits<G>::edges_size_type = unsigned int]':
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp:32:42: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
       typename Traits::vertex_descriptor p;
                                          ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c ordering.cpp -o ordering.o
ordering.cpp: In function 'SEXPREC* BGL_min_degree_ordering(SEXP, SEXP, SEXP, SEXP)':
ordering.cpp:131:53: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
   typedef graph_traits<Graph_dd>::vertex_descriptor Vertex;
                                                     ^
ordering.cpp: In function 'SEXPREC* BGL_king_ordering(SEXP, SEXP, SEXP, SEXP)':
ordering.cpp:180:48: warning: variable 'id' set but not used [-Wunused-but-set-variable]
   property_map<Graph_dd, vertex_index_t>::type id = get(vertex_index, g);
                                                ^
ordering.cpp:174:53: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
   typedef graph_traits<Graph_dd>::vertex_descriptor Vertex;
                                                     ^
ordering.cpp: In function 'SEXPREC* BGL_sloan_ordering(SEXP, SEXP, SEXP, SEXP, SEXP)':
ordering.cpp:230:47: warning: typedef 'Pair' locally defined but not used [-Wunused-local-typedefs]
   typedef std::pair<std::size_t, std::size_t> Pair;
                                               ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c planar.cpp -o planar.o
planar.cpp: In function 'SEXPREC* planarFaceTraversal(SEXP, SEXP, SEXP)':
planar.cpp:161:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
            for ( int i = 0; i < v_vis.f_vis.size(); i++ )
                               ^
planar.cpp:165:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for ( int j = 0; j < v_vis.f_vis[i].size(); j++ )
                                    ^
planar.cpp: In function 'SEXPREC* planarCanonicalOrdering(SEXP, SEXP, SEXP)':
planar.cpp:256:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for ( int i = 0; i < ordering.size(); i++ )
                        ^
planar.cpp: In function 'SEXPREC* isStraightLineDrawing(SEXP, SEXP, SEXP, SEXP)':
planar.cpp:369:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for ( int i = 0, j = 0; i < num_vertices(g); i++ )
                            ^
planar.cpp: In function 'SEXPREC* isKuratowskiSubgraph(SEXP, SEXP, SEXP)':
planar.cpp:461:6: warning: unused variable 'i' [-Wunused-variable]
  int i, j = 0;
      ^
In file included from planar.cpp:5:0:
rbgl_trimmed_boost_1_61_0/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::property<boost::edge_index_t, int> >; PlanarEmbedding = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, unsigned int> >; OutputIterator = std::back_insert_iterator<std::vector<unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, unsigned int>]':
rbgl_trimmed_boost_1_61_0/boost/graph/planar_canonical_ordering.hpp:152:22: warning: 'second_vertex' may be used uninitialized in this function [-Wmaybe-uninitialized]
                      !(first_vertex == x && second_vertex == u)
                      ^
In file included from planar.cpp:6:0:
rbgl_trimmed_boost_1_61_0/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::property<boost::edge_index_t, int> >; PlanarEmbedding = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, unsigned int> >; ForwardIterator = __gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >; GridPositionMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<coord_t*, std::vector<coord_t> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, unsigned int>]':
rbgl_trimmed_boost_1_61_0/boost/graph/chrobak_payne_drawing.hpp:217:22: warning: 'next_to_rightmost' may be used uninitialized in this function [-Wmaybe-uninitialized]
             vertex_t next_to_rightmost;
                      ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/boyer_myrvold_planar_test.hpp:12:0,
                 from planar.cpp:3:
rbgl_trimmed_boost_1_61_0/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; EdgeIndexMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]':
rbgl_trimmed_boost_1_61_0/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1237:16: warning: 'z' may be used uninitialized in this function [-Wmaybe-uninitialized]
       vertex_t z; 
                ^
rbgl_trimmed_boost_1_61_0/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1437:11: warning: 'bicomp_root' may be used uninitialized in this function [-Wmaybe-uninitialized]
           z = kuratowski_walkup(v,
           ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/depth_first_search.hpp:21:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/boyer_myrvold_planar_test.hpp:12,
                 from planar.cpp:3:
rbgl_trimmed_boost_1_61_0/boost/graph/named_function_params.hpp: In static member function 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, unsigned int>]':
rbgl_trimmed_boost_1_61_0/boost/graph/named_function_params.hpp:124:64: warning: '*((void*)& occ +8)' may be used uninitialized in this function [-Wmaybe-uninitialized]
     bgl_named_params(T v, const Base& b) : m_value(v), m_base(b) { }
                                                                ^
In file included from planar.cpp:11:0:
rbgl_trimmed_boost_1_61_0/boost/graph/max_cardinality_matching.hpp:820:48: note: '*((void*)& occ +8)' was declared here
       detail::odd_components_counter<v_size_t> occ(num_odd_components);
                                                ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c shortestPath.cpp -o shortestPath.o
shortestPath.cpp: In function 'SEXPREC* BGL_dijkstra_shortest_paths_D(SEXP, SEXP, SEXP, SEXP, SEXP)':
shortestPath.cpp:17:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
shortestPath.cpp: In function 'SEXPREC* BGL_dag_shortest_paths(SEXP, SEXP, SEXP, SEXP, SEXP)':
shortestPath.cpp:136:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
shortestPath.cpp: In function 'SEXPREC* BGL_floyd_warshall_all_pairs_shortest_paths_D(SEXP, SEXP, SEXP, SEXP)':
shortestPath.cpp:177:81: warning: typedef 'Graph' locally defined but not used [-Wunused-local-typedefs]
         property< edge_weight_t, double, property< edge_weight2_t, double > > > Graph;
                                                                                 ^
shortestPath.cpp:180:39: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef std::pair < int, int >Edge;
                                       ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = 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::listS>; Size = unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>; 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::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::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& i +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:28:0,
                 from shortestPath.cpp:4:
rbgl_trimmed_boost_1_61_0/boost/graph/bellman_ford_shortest_paths.hpp:106:37: note: '*((void*)& i +24)' was declared here
     typename GTraits::edge_iterator i, end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& i +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:28:0,
                 from shortestPath.cpp:4:
rbgl_trimmed_boost_1_61_0/boost/graph/bellman_ford_shortest_paths.hpp:106:37: note: '*((void*)& i +24)' was declared here
     typename GTraits::edge_iterator i, end;
                                     ^
In file included from RBGL.hpp:16:0,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/property_map/property_map.hpp:127:65: warning: '*((void*)(& i)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
   inline const T& get(const T* pa, std::ptrdiff_t k) { return pa[k]; }
                                                                 ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:28:0,
                 from shortestPath.cpp:4:
rbgl_trimmed_boost_1_61_0/boost/graph/bellman_ford_shortest_paths.hpp:106:37: note: '*((void*)(& i)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' was declared here
     typename GTraits::edge_iterator i, end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const 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; Zero = double]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& first +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from shortestPath.cpp:7:0:
rbgl_trimmed_boost_1_61_0/boost/graph/floyd_warshall_shortest.hpp:111:66: note: '*((void*)& first +24)' was declared here
     typename graph_traits<VertexAndEdgeListGraph>::edge_iterator first, last;
                                                                  ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'SEXPREC* BGL_bellman_ford_shortest_paths(SEXP, SEXP, SEXP, SEXP, SEXP)':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& ei +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
shortestPath.cpp:101:50: note: '*((void*)& ei +24)' was declared here
         graph_traits< EdgeGraph >::edge_iterator ei, ei_end;
                                                  ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.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>, unsigned int>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = boost::closed_plus<double>; Infinity = double; DistanceZero = double]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& e +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from shortestPath.cpp:4:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:98:37: note: '*((void*)& e +24)' was declared here
     typename Traits2::edge_iterator e, e_end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/shared_array.hpp:17:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/detail/d_ary_heap.hpp:20,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/named_function_params.hpp:24,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/dijkstra_shortest_paths.hpp:20,
                 from shortestPath.cpp:3:
rbgl_trimmed_boost_1_61_0/boost/smart_ptr/shared_array.hpp:200:18: warning: '*((void*)(& e)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
         return px[i];
                  ^
In file included from shortestPath.cpp:4:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:98:37: note: '*((void*)(& e)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' was declared here
     typename Traits2::edge_iterator e, e_end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& e +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from shortestPath.cpp:4:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:84:39: note: '*((void*)& e +24)' was declared here
       typename Traits1::edge_iterator e, e_end;
                                       ^
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:88:70: warning: '*((void*)(& e)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
                                      get(id1, target(*e, g1)) + 1, g2);
                                                                      ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c sna.cpp -o sna.o
sna.cpp: In function 'SEXPREC* lambdaSets(SEXP, SEXP, SEXP, SEXP)':
sna.cpp:161:9: warning: variable 'res_cap' set but not used [-Wunused-but-set-variable]
         res_cap = get(edge_residual_capacity, flow_g);
         ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from sna.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = 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>; Size = unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>; 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>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& i +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:28:0,
                 from sna.cpp:3:
rbgl_trimmed_boost_1_61_0/boost/graph/bellman_ford_shortest_paths.hpp:106:37: note: '*((void*)& i +24)' was declared here
     typename GTraits::edge_iterator i, end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from sna.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.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>, unsigned int>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = boost::closed_plus<double>; Infinity = double; DistanceZero = double]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& e +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from sna.cpp:3:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:98:37: note: '*((void*)& e +24)' was declared here
     typename Traits2::edge_iterator e, e_end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/property_map/shared_array_property_map.hpp:13:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:27,
                 from sna.cpp:3:
rbgl_trimmed_boost_1_61_0/boost/smart_ptr/shared_array.hpp:200:18: warning: '*((void*)(& e)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
         return px[i];
                  ^
In file included from sna.cpp:3:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:98:37: note: '*((void*)(& e)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' was declared here
     typename Traits2::edge_iterator e, e_end;
                                     ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c transitive_closure.cpp -o transitive_closure.o
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/transitive_closure.hpp:21,
                 from transitive_closure.cpp:16:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'SEXPREC* BGL_transitive_closure_D(SEXP, SEXP, SEXP)':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& ei +24)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
transitive_closure.cpp:43:33: note: '*((void*)& ei +24)' was declared here
         Graph_dd::edge_iterator ei, e_end;
                                 ^
transitive_closure.cpp:46:50: warning: '*((void*)(& ei)+16).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
             INTEGER(eList)[i++] = source(*ei, TC);
                                                  ^
C:/Rtools/mingw_32/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c wavefront.cpp -o wavefront.o
C:/Rtools/mingw_32/bin/g++ -shared -s -static-libgcc -o RBGL.dll tmp.def bbc.o cliques.o clusteringCoef.o dominatorTree.o edmonds_optimum_branching.o hcs.o incrConnComp.o interfaces.o minST.o mincut.o ordering.o planar.o shortestPath.o sna.o transitive_closure.o wavefront.o -Lc:/local323/lib/i386 -Lc:/local323/lib -LD:/biocbld/BBS-3˜1.4-B/R/bin/i386 -lR
installing to D:/biocbld/bbs-3.4-bioc/meat/RBGL.buildbin-libdir/RBGL/libs/i386
** R
** data
** inst
** preparing package for lazy loading
** help
*** installing help indices
** building package indices
** installing vignettes
** testing if installed package can be loaded

install for x64

* installing *source* package 'RBGL' ...
found  rbgl_trimmed_boost_1_61_0  header sources and tar archive;\n using what is there.
** libs
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c bbc.cpp -o bbc.o
In file included from bbc.cpp:3:0:
rbgl_trimmed_boost_1_61_0/boost/graph/bc_clustering.hpp: In function 'void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap)':
rbgl_trimmed_boost_1_61_0/boost/graph/bc_clustering.hpp:118:5: warning: typedef 'vertices_size_type' locally defined but not used [-Wunused-local-typedefs]
     vertices_size_type;
     ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c cliques.cpp -o cliques.o
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c clusteringCoef.cpp -o clusteringCoef.o
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c dominatorTree.cpp -o dominatorTree.o
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o
In file included from edmonds_optimum_branching.hpp:93:0,
                 from edmonds_optimum_branching.cpp:3:
edmonds_optimum_branching_impl.hpp: In function 'void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator)':
edmonds_optimum_branching_impl.hpp:522:71: warning: typedef 'EdgeIter' locally defined but not used [-Wunused-local-typedefs]
     typedef typename graph_traits<TEdgeListGraph>::edge_iterator      EdgeIter;
                                                                       ^
edmonds_optimum_branching_impl.hpp:523:71: warning: typedef 'weight_t' locally defined but not used [-Wunused-local-typedefs]
     typedef typename property_traits<TWeightMap>::value_type          weight_t;
                                                                       ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c hcs.cpp -o hcs.o
In file included from mincut.hpp:4:0,
                 from hcs.cpp:2:
rbgl_trimmed_boost_1_61_0/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<std::vector<long long unsigned int> >; typename boost::graph_traits<G>::edges_size_type = long long unsigned int]':
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp:32:42: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
       typename Traits::vertex_descriptor p;
                                          ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c incrConnComp.cpp -o incrConnComp.o
In file included from incrConnComp.cpp:2:0:
incrConnComp.cpp: In function 'SEXPREC* BGL_incr_comp_internal(SEXP, SEXP, SEXP, E_IC_METHOD)':
incrConnComp.cpp:74:32: warning: unused variable 'child_index' [-Wunused-variable]
      BOOST_FOREACH(VertexIndex child_index, components[current_index]) {
                                ^
rbgl_trimmed_boost_1_61_0/boost/foreach.hpp:1107:14: note: in definition of macro 'BOOST_FOREACH'
         for (VAR = BOOST_FOREACH_DEREF(COL); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true)
              ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c interfaces.cpp -o interfaces.o
interfaces.cpp: In function 'SEXPREC* BGL_tsort_D(SEXP, SEXP, SEXP)':
interfaces.cpp:57:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:61:62: warning: typedef 'Color' locally defined but not used [-Wunused-local-typedefs]
         typedef property_map<Graph_dd, vertex_color_t>::type Color;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_bfs_D(SEXP, SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:98:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:99:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_dfs_D(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:142:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:143:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_connected_components_U(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:198:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:199:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_strong_components_D(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:225:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:226:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_biconnected_components_U(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:252:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:253:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_articulation_points_U(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:295:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
interfaces.cpp: In function 'SEXPREC* BGL_edge_connectivity_U(SEXP, SEXP, SEXP, SEXP)':
interfaces.cpp:320:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
interfaces.cpp: In function 'SEXPREC* BGL_sequential_vertex_coloring(SEXP, SEXP, SEXP)':
interfaces.cpp:360:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
interfaces.cpp:361:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
In file included from interfaces.cpp:7:0:
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp: In function 'typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >; typename boost::graph_traits<G>::degree_size_type = long long unsigned int]':
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp:32:42: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
       typename Traits::vertex_descriptor p;
                                          ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c minST.cpp -o minST.o
minST.cpp: In function 'SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)':
minST.cpp:14:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
                                                              ^
minST.cpp: In function 'SEXPREC* BGL_KMST_U(SEXP, SEXP, SEXP, SEXP)':
minST.cpp:48:62: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
                                                              ^
minST.cpp: In function 'SEXPREC* BGL_PRIM_U(SEXP, SEXP, SEXP, SEXP)':
minST.cpp:81:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
                                                            ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from minST.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& ei +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from minST.cpp:2:0:
rbgl_trimmed_boost_1_61_0/boost/graph/kruskal_min_spanning_tree.hpp:78:51: note: '*((void*)& ei +48)' was declared here
       typename graph_traits<Graph>::edge_iterator ei, eiend;
                                                   ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:41:0,
                 from RBGL.hpp:37,
                 from minST.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/edge.hpp:25:34: warning: '*((void*)(& ei)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
         : m_source(s), m_target(d) { }
                                  ^
In file included from minST.cpp:2:0:
rbgl_trimmed_boost_1_61_0/boost/graph/kruskal_min_spanning_tree.hpp:78:51: note: '*((void*)(& ei)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' was declared here
       typename graph_traits<Graph>::edge_iterator ei, eiend;
                                                   ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c mincut.cpp -o mincut.o
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from mincut.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'SEXPREC* BGL_max_flow_internal(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, E_MF_METHOD)':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& ei +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
mincut.cpp:99:19: note: '*((void*)& ei +48)' was declared here
     edge_iterator ei, e_end;
                   ^
mincut.cpp:103:54: warning: '*((void*)(& ei)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
             INTEGER(eList)[i++] = source(*ei, flow_g);
                                                      ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246:0,
                 from RBGL.hpp:37,
                 from mincut.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:152:62: warning: '*((void*)(& ei)+32).__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > > > > >::_M_current' may be used uninitialized in this function [-Wmaybe-uninitialized]
                               &(*this->base()).get_property());
                                                              ^
mincut.cpp:99:19: note: '*((void*)(& ei)+32).__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > > > > > > >::_M_current' was declared here
     edge_iterator ei, e_end;
                   ^
In file included from mincut.hpp:4:0,
                 from mincut.cpp:2:
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp: In function 'typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long long unsigned int> >; typename boost::graph_traits<G>::edges_size_type = long long unsigned int]':
rbgl_trimmed_boost_1_61_0/boost/graph/edge_connectivity.hpp:32:42: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
       typename Traits::vertex_descriptor p;
                                          ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c ordering.cpp -o ordering.o
ordering.cpp: In function 'SEXPREC* BGL_min_degree_ordering(SEXP, SEXP, SEXP, SEXP)':
ordering.cpp:131:53: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
   typedef graph_traits<Graph_dd>::vertex_descriptor Vertex;
                                                     ^
ordering.cpp: In function 'SEXPREC* BGL_king_ordering(SEXP, SEXP, SEXP, SEXP)':
ordering.cpp:180:48: warning: variable 'id' set but not used [-Wunused-but-set-variable]
   property_map<Graph_dd, vertex_index_t>::type id = get(vertex_index, g);
                                                ^
ordering.cpp:174:53: warning: typedef 'Vertex' locally defined but not used [-Wunused-local-typedefs]
   typedef graph_traits<Graph_dd>::vertex_descriptor Vertex;
                                                     ^
ordering.cpp: In function 'SEXPREC* BGL_sloan_ordering(SEXP, SEXP, SEXP, SEXP, SEXP)':
ordering.cpp:230:47: warning: typedef 'Pair' locally defined but not used [-Wunused-local-typedefs]
   typedef std::pair<std::size_t, std::size_t> Pair;
                                               ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c planar.cpp -o planar.o
planar.cpp: In function 'SEXPREC* planarFaceTraversal(SEXP, SEXP, SEXP)':
planar.cpp:161:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
            for ( int i = 0; i < v_vis.f_vis.size(); i++ )
                               ^
planar.cpp:165:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for ( int j = 0; j < v_vis.f_vis[i].size(); j++ )
                                    ^
planar.cpp: In function 'SEXPREC* planarCanonicalOrdering(SEXP, SEXP, SEXP)':
planar.cpp:256:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for ( int i = 0; i < ordering.size(); i++ )
                        ^
planar.cpp: In function 'SEXPREC* isStraightLineDrawing(SEXP, SEXP, SEXP, SEXP)':
planar.cpp:369:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for ( int i = 0, j = 0; i < num_vertices(g); i++ )
                            ^
planar.cpp: In function 'SEXPREC* isKuratowskiSubgraph(SEXP, SEXP, SEXP)':
planar.cpp:461:6: warning: unused variable 'i' [-Wunused-variable]
  int i, j = 0;
      ^
In file included from planar.cpp:5:0:
rbgl_trimmed_boost_1_61_0/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::property<boost::edge_index_t, int> >; PlanarEmbedding = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long long unsigned int> >; OutputIterator = std::back_insert_iterator<std::vector<long long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long long unsigned int>]':
rbgl_trimmed_boost_1_61_0/boost/graph/planar_canonical_ordering.hpp:152:22: warning: 'second_vertex' may be used uninitialized in this function [-Wmaybe-uninitialized]
                      !(first_vertex == x && second_vertex == u)
                      ^
In file included from planar.cpp:6:0:
rbgl_trimmed_boost_1_61_0/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::property<boost::edge_index_t, int> >; PlanarEmbedding = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long long unsigned int> >; ForwardIterator = __gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> >; GridPositionMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<coord_t*, std::vector<coord_t> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long long unsigned int>]':
rbgl_trimmed_boost_1_61_0/boost/graph/chrobak_payne_drawing.hpp:217:22: warning: 'next_to_rightmost' may be used uninitialized in this function [-Wmaybe-uninitialized]
             vertex_t next_to_rightmost;
                      ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/boyer_myrvold_planar_test.hpp:12:0,
                 from planar.cpp:3:
rbgl_trimmed_boost_1_61_0/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >; EdgeIndexMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]':
rbgl_trimmed_boost_1_61_0/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1237:16: warning: 'z' may be used uninitialized in this function [-Wmaybe-uninitialized]
       vertex_t z; 
                ^
rbgl_trimmed_boost_1_61_0/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1437:11: warning: 'bicomp_root' may be used uninitialized in this function [-Wmaybe-uninitialized]
           z = kuratowski_walkup(v,
           ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/depth_first_search.hpp:21:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/boyer_myrvold_planar_test.hpp:12,
                 from planar.cpp:3:
rbgl_trimmed_boost_1_61_0/boost/graph/named_function_params.hpp: In static member function 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long long unsigned int>]':
rbgl_trimmed_boost_1_61_0/boost/graph/named_function_params.hpp:124:64: warning: '*((void*)& occ +16)' may be used uninitialized in this function [-Wmaybe-uninitialized]
     bgl_named_params(T v, const Base& b) : m_value(v), m_base(b) { }
                                                                ^
In file included from planar.cpp:11:0:
rbgl_trimmed_boost_1_61_0/boost/graph/max_cardinality_matching.hpp:820:48: note: '*((void*)& occ +16)' was declared here
       detail::odd_components_counter<v_size_t> occ(num_odd_components);
                                                ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c shortestPath.cpp -o shortestPath.o
shortestPath.cpp: In function 'SEXPREC* BGL_dijkstra_shortest_paths_D(SEXP, SEXP, SEXP, SEXP, SEXP)':
shortestPath.cpp:17:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
shortestPath.cpp: In function 'SEXPREC* BGL_dag_shortest_paths(SEXP, SEXP, SEXP, SEXP, SEXP)':
shortestPath.cpp:136:60: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
                                                            ^
shortestPath.cpp: In function 'SEXPREC* BGL_floyd_warshall_all_pairs_shortest_paths_D(SEXP, SEXP, SEXP, SEXP)':
shortestPath.cpp:177:81: warning: typedef 'Graph' locally defined but not used [-Wunused-local-typedefs]
         property< edge_weight_t, double, property< edge_weight2_t, double > > > Graph;
                                                                                 ^
shortestPath.cpp:180:39: warning: typedef 'Edge' locally defined but not used [-Wunused-local-typedefs]
         typedef std::pair < int, int >Edge;
                                       ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = 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::listS>; Size = long long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>; 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::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::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& i +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:28:0,
                 from shortestPath.cpp:4:
rbgl_trimmed_boost_1_61_0/boost/graph/bellman_ford_shortest_paths.hpp:106:37: note: '*((void*)& i +48)' was declared here
     typename GTraits::edge_iterator i, end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& i +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:28:0,
                 from shortestPath.cpp:4:
rbgl_trimmed_boost_1_61_0/boost/graph/bellman_ford_shortest_paths.hpp:106:37: note: '*((void*)& i +48)' was declared here
     typename GTraits::edge_iterator i, end;
                                     ^
In file included from RBGL.hpp:16:0,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/property_map/property_map.hpp:127:65: warning: '*((void*)(& i)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
   inline const T& get(const T* pa, std::ptrdiff_t k) { return pa[k]; }
                                                                 ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:28:0,
                 from shortestPath.cpp:4:
rbgl_trimmed_boost_1_61_0/boost/graph/bellman_ford_shortest_paths.hpp:106:37: note: '*((void*)(& i)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' was declared here
     typename GTraits::edge_iterator i, end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const 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; Zero = double]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& first +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from shortestPath.cpp:7:0:
rbgl_trimmed_boost_1_61_0/boost/graph/floyd_warshall_shortest.hpp:111:66: note: '*((void*)& first +48)' was declared here
     typename graph_traits<VertexAndEdgeListGraph>::edge_iterator first, last;
                                                                  ^
rbgl_trimmed_boost_1_61_0/boost/graph/floyd_warshall_shortest.hpp:125:12: warning: '*((void*)(& first)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
       if (d[source(*first, g)][target(*first, g)] != inf) {
            ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'SEXPREC* BGL_bellman_ford_shortest_paths(SEXP, SEXP, SEXP, SEXP, SEXP)':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& ei +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
shortestPath.cpp:101:50: note: '*((void*)& ei +48)' was declared here
         graph_traits< EdgeGraph >::edge_iterator ei, ei_end;
                                                  ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.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>, long long unsigned int>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = boost::closed_plus<double>; Infinity = double; DistanceZero = double]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& e +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from shortestPath.cpp:4:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:98:37: note: '*((void*)& e +48)' was declared here
     typename Traits2::edge_iterator e, e_end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/shared_array.hpp:17:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/detail/d_ary_heap.hpp:20,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/named_function_params.hpp:24,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/dijkstra_shortest_paths.hpp:20,
                 from shortestPath.cpp:3:
rbgl_trimmed_boost_1_61_0/boost/smart_ptr/shared_array.hpp:200:18: warning: '*((void*)(& e)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
         return px[i];
                  ^
In file included from shortestPath.cpp:4:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:98:37: note: '*((void*)(& e)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' was declared here
     typename Traits2::edge_iterator e, e_end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from shortestPath.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& e +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from shortestPath.cpp:4:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:84:39: note: '*((void*)& e +48)' was declared here
       typename Traits1::edge_iterator e, e_end;
                                       ^
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:88:70: warning: '*((void*)(& e)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
                                      get(id1, target(*e, g1)) + 1, g2);
                                                                      ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c sna.cpp -o sna.o
sna.cpp: In function 'SEXPREC* lambdaSets(SEXP, SEXP, SEXP, SEXP)':
sna.cpp:161:9: warning: variable 'res_cap' set but not used [-Wunused-but-set-variable]
         res_cap = get(edge_residual_capacity, flow_g);
         ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from sna.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = 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>; Size = long long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>; 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>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& i +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:28:0,
                 from sna.cpp:3:
rbgl_trimmed_boost_1_61_0/boost/graph/bellman_ford_shortest_paths.hpp:106:37: note: '*((void*)& i +48)' was declared here
     typename GTraits::edge_iterator i, end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from RBGL.hpp:37,
                 from sna.cpp:1:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.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>, long long unsigned int>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = boost::closed_plus<double>; Infinity = double; DistanceZero = double]':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& e +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
In file included from sna.cpp:3:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:98:37: note: '*((void*)& e +48)' was declared here
     typename Traits2::edge_iterator e, e_end;
                                     ^
In file included from rbgl_trimmed_boost_1_61_0/boost/property_map/shared_array_property_map.hpp:13:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:27,
                 from sna.cpp:3:
rbgl_trimmed_boost_1_61_0/boost/smart_ptr/shared_array.hpp:200:18: warning: '*((void*)(& e)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
         return px[i];
                  ^
In file included from sna.cpp:3:0:
rbgl_trimmed_boost_1_61_0/boost/graph/johnson_all_pairs_shortest.hpp:98:37: note: '*((void*)(& e)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' was declared here
     typename Traits2::edge_iterator e, e_end;
                                     ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c transitive_closure.cpp -o transitive_closure.o
In file included from rbgl_trimmed_boost_1_61_0/boost/graph/detail/adjacency_list.hpp:34:0,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/adjacency_list.hpp:246,
                 from rbgl_trimmed_boost_1_61_0/boost/graph/transitive_closure.hpp:21,
                 from transitive_closure.cpp:16:
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp: In function 'SEXPREC* BGL_transitive_closure_D(SEXP, SEXP, SEXP)':
rbgl_trimmed_boost_1_61_0/boost/graph/detail/adj_list_edge_iterator.hpp:70:9: warning: '*((void*)& ei +48)' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (edges BOOST_GRAPH_MEMBER first == edges BOOST_GRAPH_MEMBER second) 
         ^
transitive_closure.cpp:43:33: note: '*((void*)& ei +48)' was declared here
         Graph_dd::edge_iterator ei, e_end;
                                 ^
transitive_closure.cpp:46:50: warning: '*((void*)(& ei)+32).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>::m_src' may be used uninitialized in this function [-Wmaybe-uninitialized]
             INTEGER(eList)[i++] = source(*ei, TC);
                                                  ^
C:/Rtools/mingw_64/bin/g++  -I"D:/biocbld/BBS-3˜1.4-B/R/include" -DNDEBUG -Irbgl_trimmed_boost_1_61_0    -I"c:/local323/include"     -O2 -Wall  -mtune=core2 -c wavefront.cpp -o wavefront.o
C:/Rtools/mingw_64/bin/g++ -shared -s -static-libgcc -o RBGL.dll tmp.def bbc.o cliques.o clusteringCoef.o dominatorTree.o edmonds_optimum_branching.o hcs.o incrConnComp.o interfaces.o minST.o mincut.o ordering.o planar.o shortestPath.o sna.o transitive_closure.o wavefront.o -Lc:/local323/lib/x64 -Lc:/local323/lib -LD:/biocbld/BBS-3˜1.4-B/R/bin/x64 -lR
installing to D:/biocbld/bbs-3.4-bioc/meat/RBGL.buildbin-libdir/RBGL/libs/x64
** testing if installed package can be loaded
* MD5 sums
packaged installation of 'RBGL' as RBGL_1.49.3.zip
* DONE (RBGL)

RBGL.Rcheck/examples_i386/RBGL-Ex.timings:

nameusersystemelapsed
FileDep0.330.010.34
astarSearch000
bandwidth0.010.000.02
bccluster0.000.020.02
bellman.ford.sp000
betweenness0.020.000.01
bfs000
biConnComp000
chrobakPayneStraightLineDrawing000
clusteringCoef0.020.000.02
clusteringCoefAppr000
coloring0.010.000.01
connectedComp0.020.000.05
dag.sp0.010.000.02
dijkstra.sp0.020.000.01
dominatorTree0.010.000.02
edgeConn000
edmondsMaxCardinalityMatching0.020.000.01
edmondsOptimumBranching000
extractPath000
floyd.warshall.all.pairs.sp0.010.000.01
gprofile000
graphGenerator000
highlyConnSG0.020.000.02
incrConnComp000
is.triangulated0.060.000.06
isKuratowskiSubgraph0.000.010.02
isStraightLineDrawing000
isomorphism0.010.000.01
johnson.all.pairs.sp000
kCliques0.020.000.02
kCores0.030.000.03
lambdaSets0.020.000.02
layout000
makeBiconnectedPlanar000
makeConnected0.010.000.01
makeMaximalPlanar000
maxClique0.020.000.02
maxFlow0.010.000.01
minCut000
mstree.kruskal0.030.000.03
mstree.prim000
ordering0.020.000.02
planarCanonicalOrdering000
planarFaceTraversal0.020.000.02
removeSelfLoops000
separates0.010.000.01
sp.between0.060.000.06
strongComp0.020.000.02
transClosure0.020.000.01
transitivity000
tsort0.010.000.02
wavefront000

RBGL.Rcheck/examples_x64/RBGL-Ex.timings:

nameusersystemelapsed
FileDep0.390.021.47
astarSearch0.020.000.01
bandwidth0.010.000.02
bccluster0.020.000.01
bellman.ford.sp000
betweenness0.010.000.02
bfs0.020.000.01
biConnComp0.010.000.02
chrobakPayneStraightLineDrawing000
clusteringCoef0.020.000.02
clusteringCoefAppr0.010.000.01
coloring000
connectedComp0.020.000.01
dag.sp0.020.000.02
dijkstra.sp0.010.000.01
dominatorTree0.020.000.02
edgeConn000
edmondsMaxCardinalityMatching0.000.020.01
edmondsOptimumBranching0.010.000.02
extractPath000
floyd.warshall.all.pairs.sp0.020.000.02
gprofile000
graphGenerator000
highlyConnSG0.010.000.01
incrConnComp000
is.triangulated0.080.000.08
isKuratowskiSubgraph000
isStraightLineDrawing000
isomorphism0.010.000.02
johnson.all.pairs.sp000
kCliques000
kCores0.030.000.03
lambdaSets000
layout000
makeBiconnectedPlanar0.010.000.02
makeConnected0.020.000.01
makeMaximalPlanar000
maxClique0.010.000.02
maxFlow0.020.000.02
minCut000
mstree.kruskal0.030.000.03
mstree.prim000
ordering0.010.000.01
planarCanonicalOrdering0.020.000.02
planarFaceTraversal000
removeSelfLoops0.020.000.01
separates0.010.000.02
sp.between0.080.000.08
strongComp000
transClosure0.020.000.02
transitivity000
tsort0.000.010.01
wavefront000