• using R Under development (unstable) (2012-08-11 r60235)
• using platform: x86_64-unknown-linux-gnu (64-bit)
• using session charset: UTF-8
• checking for file ‘igraph/DESCRIPTION’ ... OK
• this is package ‘igraph’ version ‘0.6-2’
• 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 executable files ... OK
• checking for hidden files and directories ... OK
• checking whether package ‘igraph’ can be installed ... OK
• checking installed package size ... NOTE
  installed size is 16.3Mb
  sub-directories of 1Mb or more:
  libs 14.9Mb
• checking package directory ... OK
• checking for portable file names ... OK
• checking for sufficient/correct file permissions ... OK
• checking DESCRIPTION meta-information ... OK
• checking top-level files ... OK
• checking index information ... OK
• checking package subdirectories ... OK
• checking R files for non-ASCII characters ... OK
• checking R files for syntax errors ... OK
• checking whether the package can be loaded ... OK
• checking whether the package can be loaded with stated dependencies ... OK
• checking whether the 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 loading without being on the library search path ... OK
• checking for unstated dependencies in R code ... OK
• checking S3 generic/method consistency ... OK
• checking replacement functions ... OK
• checking foreign function calls ... OK
• checking R code for possible problems ... NOTE
  .tkigraph.showData: no visible binding for global variable
  ‘.tkigraph.ttt’
  .tkigraph.spinglass.mycommunity.dialog: no visible binding for global
  variable ‘.tkigraph.ttt’
• 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 line endings in C/C++/Fortran sources/headers ... OK
• checking line endings in Makefiles ... OK
• checking for portable compilation flags in Makevars ... OK
• checking for portable use of $(BLAS_LIBS) and $(LAPACK_LIBS) ... OK
• checking compiled code ... OK
• checking examples ... [126s/126s] OK
• checking for unstated dependencies in tests ... OK
• checking tests ... [89s/91s] OK
  Running ‘add.edges.R’ [0s/1s]
  Comparing ‘add.edges.Rout’ to ‘add.edges.Rout.save’ ... OK
  Running ‘add.vertices.R’ [1s/1s]
  Comparing ‘add.vertices.Rout’ to ‘add.vertices.Rout.save’ ... OK
  Running ‘all.st.cuts.R’ [0s/0s]
  Comparing ‘all.st.cuts.Rout’ to ‘all.st.cuts.Rout.save’ ... OK
  Running ‘alpha.centrality.R’ [3s/3s]
  Comparing ‘alpha.centrality.Rout’ to ‘alpha.centrality.Rout.save’ ... OK
  Running ‘are.connected.R’ [0s/1s]
  Comparing ‘are.connected.Rout’ to ‘are.connected.Rout.save’ ... OK
  Running ‘arpack.R’ [3s/3s]
  Comparing ‘arpack.Rout’ to ‘arpack.Rout.save’ ... OK
  Running ‘articulation.points.R’ [0s/0s]
  Comparing ‘articulation.points.Rout’ to ‘articulation.points.Rout.save’ ... OK
  Running ‘as.directed.R’ [0s/1s]
  Comparing ‘as.directed.Rout’ to ‘as.directed.Rout.save’ ... OK
  Running ‘as.undirected.R’ [0s/0s]
  Comparing ‘as.undirected.Rout’ to ‘as.undirected.Rout.save’ ... OK
  Running ‘assortativity.R’ [1s/1s]
  Comparing ‘assortativity.Rout’ to ‘assortativity.Rout.save’ ... OK
  Running ‘attributes.R’ [0s/0s]
  Comparing ‘attributes.Rout’ to ‘attributes.Rout.save’ ... OK
  Running ‘authority.score.R’ [11s/11s]
  Comparing ‘authority.score.Rout’ to ‘authority.score.Rout.save’ ... OK
  Running ‘average.path.length.R’ [0s/1s]
  Comparing ‘average.path.length.Rout’ to ‘average.path.length.Rout.save’ ... OK
  Running ‘ba.game.R’ [0s/1s]
  Comparing ‘ba.game.Rout’ to ‘ba.game.Rout.save’ ... OK
  Running ‘betweenness.R’ [0s/0s]
  Comparing ‘betweenness.Rout’ to ‘betweenness.Rout.save’ ... OK
  Running ‘biconnected.components.R’ [0s/0s]
  Comparing ‘biconnected.components.Rout’ to ‘biconnected.components.Rout.save’ ... OK
  Running ‘bipartite.projection.R’ [0s/0s]
  Comparing ‘bipartite.projection.Rout’ to ‘bipartite.projection.Rout.save’ ... OK
  Running ‘bonpow.R’ [3s/3s]
  Comparing ‘bonpow.Rout’ to ‘bonpow.Rout.save’ ... OK
  Running ‘canonical.permutation.R’ [0s/1s]
  Comparing ‘canonical.permutation.Rout’ to ‘canonical.permutation.Rout.save’ ... OK
  Running ‘cliques.R’ [1s/1s]
  Comparing ‘cliques.Rout’ to ‘cliques.Rout.save’ ... OK
  Running ‘closeness.R’ [1s/1s]
  Comparing ‘closeness.Rout’ to ‘closeness.Rout.save’ ... OK
  Running ‘clusters.R’ [1s/1s]
  Comparing ‘clusters.Rout’ to ‘clusters.Rout.save’ ... OK
  Running ‘cohesive.blocks.R’ [0s/0s]
  Comparing ‘cohesive.blocks.Rout’ to ‘cohesive.blocks.Rout.save’ ... OK
  Running ‘communities.R’ [2s/2s]
  Comparing ‘communities.Rout’ to ‘communities.Rout.save’ ... OK
  Running ‘constraint.R’ [0s/0s]
  Comparing ‘constraint.Rout’ to ‘constraint.Rout.save’ ... OK
  Running ‘contract.vertices.R’ [0s/0s]
  Comparing ‘contract.vertices.Rout’ to ‘contract.vertices.Rout.save’ ... OK
  Running ‘count.multiple.R’ [0s/0s]
  Comparing ‘count.multiple.Rout’ to ‘count.multiple.Rout.save’ ... OK
  Running ‘decompose.graph.R’ [0s/0s]
  Comparing ‘decompose.graph.Rout’ to ‘decompose.graph.Rout.save’ ... OK
  Running ‘degree.R’ [0s/0s]
  Comparing ‘degree.Rout’ to ‘degree.Rout.save’ ... OK
  Running ‘degree.sequence.game.R’ [0s/0s]
  Comparing ‘degree.sequence.game.Rout’ to ‘degree.sequence.game.Rout.save’ ... OK
  Running ‘delete.edges.R’ [0s/0s]
  Comparing ‘delete.edges.Rout’ to ‘delete.edges.Rout.save’ ... OK
  Running ‘delete.vertices.R’ [0s/0s]
  Comparing ‘delete.vertices.Rout’ to ‘delete.vertices.Rout.save’ ... OK
  Running ‘diameter.R’ [0s/0s]
  Comparing ‘diameter.Rout’ to ‘diameter.Rout.save’ ... OK
  Running ‘dominator.tree.R’ [1s/1s]
  Comparing ‘dominator.tree.Rout’ to ‘dominator.tree.Rout.save’ ... OK
  Running ‘dyad.census.R’ [0s/0s]
  Comparing ‘dyad.census.Rout’ to ‘dyad.census.Rout.save’ ... OK
  Running ‘edge.betweenness.R’ [1s/1s]
  Comparing ‘edge.betweenness.Rout’ to ‘edge.betweenness.Rout.save’ ... OK
  Running ‘edge.betweenness.community.R’ [0s/0s]
  Comparing ‘edge.betweenness.community.Rout’ to ‘edge.betweenness.community.Rout.save’ ... OK
  Running ‘edge.connectivity.R’ [0s/0s]
  Comparing ‘edge.connectivity.Rout’ to ‘edge.connectivity.Rout.save’ ... OK
  Running ‘edgenames.R’ [0s/0s]
  Comparing ‘edgenames.Rout’ to ‘edgenames.Rout.save’ ... OK
  Running ‘evcent.R’ [2s/2s]
  Comparing ‘evcent.Rout’ to ‘evcent.Rout.save’ ... OK
  Running ‘fartherst.nodes.R’ [0s/0s]
  Comparing ‘fartherst.nodes.Rout’ to ‘fartherst.nodes.Rout.save’ ... OK
  Running ‘fastgreedy.community.R’ [0s/0s]
  Comparing ‘fastgreedy.community.Rout’ to ‘fastgreedy.community.Rout.save’ ... OK
  Running ‘forestfire.R’ [3s/3s]
  Comparing ‘forestfire.Rout’ to ‘forestfire.Rout.save’ ... OK
  Running ‘get.adjacency.R’ [3s/3s]
  Comparing ‘get.adjacency.Rout’ to ‘get.adjacency.Rout.save’ ... OK
  Running ‘get.adjlist.R’ [0s/0s]
  Comparing ‘get.adjlist.Rout’ to ‘get.adjlist.Rout.save’ ... OK
  Running ‘get.all.shortest.paths.R’ [0s/0s]
  Comparing ‘get.all.shortest.paths.Rout’ to ‘get.all.shortest.paths.Rout.save’ ... OK
  Running ‘get.diameter.R’ [0s/0s]
  Comparing ‘get.diameter.Rout’ to ‘get.diameter.Rout.save’ ... OK
  Running ‘get.edge.R’ [0s/1s]
  Comparing ‘get.edge.Rout’ to ‘get.edge.Rout.save’ ... OK
  Running ‘get.edgelist.R’ [0s/0s]
  Comparing ‘get.edgelist.Rout’ to ‘get.edgelist.Rout.save’ ... OK
  Running ‘get.incidence.R’ [3s/3s]
  Comparing ‘get.incidence.Rout’ to ‘get.incidence.Rout.save’ ... OK
  Running ‘get.shortest.paths.R’ [0s/0s]
  Comparing ‘get.shortest.paths.Rout’ to ‘get.shortest.paths.Rout.save’ ... OK
  Running ‘girth.R’ [0s/0s]
  Comparing ‘girth.Rout’ to ‘girth.Rout.save’ ... OK
  Running ‘graph.adhesion.R’ [1s/1s]
  Comparing ‘graph.adhesion.Rout’ to ‘graph.adhesion.Rout.save’ ... OK
  Running ‘graph.adjacency.R’ [0s/0s]
  Comparing ‘graph.adjacency.Rout’ to ‘graph.adjacency.Rout.save’ ... OK
  Running ‘graph.adjlist.R’ [0s/0s]
  Comparing ‘graph.adjlist.Rout’ to ‘graph.adjlist.Rout.save’ ... OK
  Running ‘graph.atlas.R’ [0s/0s]
  Comparing ‘graph.atlas.Rout’ to ‘graph.atlas.Rout.save’ ... OK
  Running ‘graph.bfs.R’ [0s/0s]
  Comparing ‘graph.bfs.Rout’ to ‘graph.bfs.Rout.save’ ... OK
  Running ‘graph.bipartite.R’ [0s/0s]
  Comparing ‘graph.bipartite.Rout’ to ‘graph.bipartite.Rout.save’ ... OK
  Running ‘graph.complementer.R’ [0s/1s]
  Comparing ‘graph.complementer.Rout’ to ‘graph.complementer.Rout.save’ ... OK
  Running ‘graph.compose.R’ [0s/0s]
  Comparing ‘graph.compose.Rout’ to ‘graph.compose.Rout.save’ ... OK
  Running ‘graph.coreness.R’ [0s/0s]
  Comparing ‘graph.coreness.Rout’ to ‘graph.coreness.Rout.save’ ... OK
  Running ‘graph.data.frame.R’ [0s/0s]
  Comparing ‘graph.data.frame.Rout’ to ‘graph.data.frame.Rout.save’ ... OK
  Running ‘graph.de.bruijn.R’ [0s/1s]
  Comparing ‘graph.de.bruijn.Rout’ to ‘graph.de.bruijn.Rout.save’ ... OK
  Running ‘graph.density.R’ [0s/0s]
  Comparing ‘graph.density.Rout’ to ‘graph.density.Rout.save’ ... OK
  Running ‘graph.edgelist.R’ [0s/0s]
  Comparing ‘graph.edgelist.Rout’ to ‘graph.edgelist.Rout.save’ ... OK
  Running ‘graph.isoclass.R’ [0s/0s]
  Comparing ‘graph.isoclass.Rout’ to ‘graph.isoclass.Rout.save’ ... OK
  Running ‘graph.kautz.R’ [0s/0s]
  Comparing ‘graph.kautz.Rout’ to ‘graph.kautz.Rout.save’ ... OK
  Running ‘graph.knn.R’ [1s/1s]
  Comparing ‘graph.knn.Rout’ to ‘graph.knn.Rout.save’ ... OK
  Running ‘graph.maxflow.R’ [0s/0s]
  Comparing ‘graph.maxflow.Rout’ to ‘graph.maxflow.Rout.save’ ... OK
  Running ‘graph.mincut.R’ [0s/0s]
  Comparing ‘graph.mincut.Rout’ to ‘graph.mincut.Rout.save’ ... OK
  Running ‘graph.subisomorphic.vf2.R’ [0s/0s]
  Comparing ‘graph.subisomorphic.vf2.Rout’ to ‘graph.subisomorphic.vf2.Rout.save’ ... OK
  Running ‘graphNEL.R’ [1s/1s]
  Comparing ‘graphNEL.Rout’ to ‘graphNEL.Rout.save’ ... OK
  Running ‘igraph.options.R’ [0s/0s]
  Comparing ‘igraph.options.Rout’ to ‘igraph.options.Rout.save’ ... OK
  Running ‘independent.vertex.sets.R’ [0s/0s]
  Comparing ‘independent.vertex.sets.Rout’ to ‘independent.vertex.sets.Rout.save’ ... OK
  Running ‘indexing.R’ [3s/3s]
  Comparing ‘indexing.Rout’ to ‘indexing.Rout.save’ ... OK
  Running ‘indexing2.R’ [1s/1s]
  Comparing ‘indexing2.Rout’ to ‘indexing2.Rout.save’ ... OK
  Running ‘is.bipartite.R’ [0s/0s]
  Comparing ‘is.bipartite.Rout’ to ‘is.bipartite.Rout.save’ ... OK
  Running ‘is.chordal.R’ [0s/0s]
  Comparing ‘is.chordal.Rout’ to ‘is.chordal.Rout.save’ ... OK
  Running ‘iterators.R’ [0s/0s]
  Comparing ‘iterators.Rout’ to ‘iterators.Rout.save’ ... OK
  Running ‘label.propagation.community.R’ [0s/0s]
  Comparing ‘label.propagation.community.Rout’ to ‘label.propagation.community.Rout.save’ ... OK
  Running ‘largest.cliques.R’ [0s/0s]
  Comparing ‘largest.cliques.Rout’ to ‘largest.cliques.Rout.save’ ... OK
  Running ‘largest.independent.vertex.sets.R’ [0s/0s]
  Comparing ‘largest.independent.vertex.sets.Rout’ to ‘largest.independent.vertex.sets.Rout.save’ ... OK
  Running ‘leading.eigenvector.community.R’ [4s/4s]
  Comparing ‘leading.eigenvector.community.Rout’ to ‘leading.eigenvector.community.Rout.save’ ... OK
  Running ‘minimal.st.separators.R’ [0s/0s]
  Comparing ‘minimal.st.separators.Rout’ to ‘minimal.st.separators.Rout.save’ ... OK
  Running ‘minimum.size.separators.R’ [0s/0s]
  Comparing ‘minimum.size.separators.Rout’ to ‘minimum.size.separators.Rout.save’ ... OK
  Running ‘motifs.R’ [1s/1s]
  Comparing ‘motifs.Rout’ to ‘motifs.Rout.save’ ... OK
  Running ‘multilevel.community.R’ [0s/0s]
  Comparing ‘multilevel.community.Rout’ to ‘multilevel.community.Rout.save’ ... OK
  Running ‘neighborhood.R’ [0s/0s]
  Comparing ‘neighborhood.Rout’ to ‘neighborhood.Rout.save’ ... OK
  Running ‘neighbors.R’ [0s/0s]
  Comparing ‘neighbors.Rout’ to ‘neighbors.Rout.save’ ... OK
  Running ‘operators.R’ [0s/0s]
  Comparing ‘operators.Rout’ to ‘operators.Rout.save’ ... OK
  Running ‘operators3.R’ [0s/0s]
  Comparing ‘operators3.Rout’ to ‘operators3.Rout.save’ ... OK
  Running ‘optimal.community.R’ [1s/1s]
  Comparing ‘optimal.community.Rout’ to ‘optimal.community.Rout.save’ ... OK
  Running ‘pajek.R’ [0s/0s]
  Comparing ‘pajek.Rout’ to ‘pajek.Rout.save’ ... OK
  Running ‘print.R’ [1s/1s]
  Comparing ‘print.Rout’ to ‘print.Rout.save’ ... OK
  Running ‘scg.R’ [3s/3s]
  Comparing ‘scg.Rout’ to ‘scg.Rout.save’ ... OK
  Running ‘sdf.R’ [0s/1s]
  Comparing ‘sdf.Rout’ to ‘sdf.Rout.save’ ... OK
  Running ‘unfold.tree.R’ [0s/0s]
  Comparing ‘unfold.tree.Rout’ to ‘unfold.tree.Rout.save’ ... OK
  Running ‘walktrap.community.R’ [0s/0s]
  Comparing ‘walktrap.community.Rout’ to ‘walktrap.community.Rout.save’ ... OK
  Running ‘watts.strogatz.game.R’ [3s/3s]
  Comparing ‘watts.strogatz.game.Rout’ to ‘watts.strogatz.game.Rout.save’ ... OK
• checking PDF version of manual ... OK
  NOTE: There were 2 notes.
  See
  ‘/home/hornik/tmp/R.check/r-devel/Work/PKGS/igraph.Rcheck/00check.log’
  for details.