From a33b722ae685d0a2b058bed4ce16573486fd945e Mon Sep 17 00:00:00 2001 From: krlmlr Date: Tue, 7 Jan 2025 19:44:13 +0000 Subject: [PATCH] Built site for igraph@2.1.3: 953fa62 --- AUTHORS-list.html | 2 +- CONTRIBUTING.html | 2 +- articles/deprecated-dot-case.html | 2 +- articles/igraph.html | 32 +- articles/igraph_ES.html | 32 +- articles/installation-troubleshooting.html | 2 +- authors.html | 2 +- cran-comments.template.html | 2 +- news/index.html | 2 +- pkgdown.yml | 2 +- reference/E.html | 6 +- reference/V.html | 6 +- reference/aaa-igraph-package.html | 2 +- reference/add.edges.html | 2 +- reference/add.vertex.shape.html | 2 +- reference/add.vertices.html | 2 +- reference/add_edges.html | 4 +- reference/add_layout_.html | 2 +- reference/add_vertices.html | 8 +- reference/adjacent.triangles.html | 2 +- reference/adjacent_vertices.html | 6 +- reference/aging.ba.game.html | 2 +- reference/aging.barabasi.game.html | 2 +- reference/aging.prefatt.game.html | 2 +- reference/all_simple_paths.html | 14 +- reference/alpha.centrality.html | 2 +- reference/alpha_centrality.html | 2 +- reference/are.connected.html | 2 +- reference/are_adjacent.html | 10 +- reference/arpack.html | 2 +- reference/articulation.points.html | 2 +- reference/articulation_points.html | 6 +- reference/as.directed.html | 2 +- reference/as.igraph.html | 6 +- reference/as.matrix.igraph.html | 2 +- reference/as.undirected.html | 2 +- reference/as_adj.html | 2 +- reference/as_adj_list.html | 42 +- reference/as_adjacency_matrix.html | 2 +- reference/as_biadjacency_matrix.html | 2 +- reference/as_directed.html | 18 +- reference/as_edgelist.html | 2 +- reference/as_graphnel.html | 10 +- reference/as_ids.html | 2 +- reference/as_incidence_matrix.html | 2 +- reference/as_long_data_frame.html | 2 +- reference/as_membership.html | 2 +- reference/as_phylo.html | 2 +- reference/assortativity.degree.html | 2 +- reference/assortativity.html | 2 +- reference/assortativity.nominal.html | 2 +- reference/asymmetric.preference.game.html | 2 +- reference/authority.score.html | 2 +- reference/autocurve.edges.html | 2 +- reference/automorphism_group.html | 6 +- reference/automorphisms.html | 2 +- reference/average.path.length.html | 2 +- reference/ba.game.html | 2 +- reference/barabasi.game.html | 2 +- reference/betweenness.html | 2 +- reference/bfs.html | 12 +- reference/biconnected.components.html | 2 +- reference/biconnected_components.html | 2 +- reference/bipartite.mapping.html | 2 +- reference/bipartite.projection.html | 2 +- reference/bipartite.projection.size.html | 2 +- reference/bipartite.random.game.html | 2 +- reference/bipartite_mapping.html | 2 +- reference/bipartite_projection.html | 10 +- reference/blockGraphs.html | 2 +- reference/bonpow.html | 2 +- reference/c.igraph.es.html | 4 +- reference/c.igraph.vs.html | 4 +- reference/callaway.traits.game.html | 2 +- reference/canonical.permutation.html | 2 +- reference/canonical_permutation.html | 2 +- reference/categorical_pal.html | 2 +- reference/centr_betw.html | 2 +- reference/centr_betw_tmax.html | 2 +- reference/centr_clo.html | 2 +- reference/centr_clo_tmax.html | 2 +- reference/centr_degree.html | 2 +- reference/centr_degree_tmax.html | 2 +- reference/centr_eigen.html | 2 +- reference/centr_eigen_tmax.html | 2 +- reference/centralization.betweenness.html | 2 +- .../centralization.betweenness.tmax.html | 2 +- reference/centralization.closeness.html | 2 +- reference/centralization.closeness.tmax.html | 2 +- reference/centralization.degree.html | 2 +- reference/centralization.degree.tmax.html | 2 +- reference/centralization.evcent.html | 2 +- reference/centralization.evcent.tmax.html | 2 +- reference/centralize.html | 2 +- reference/centralize.scores.html | 2 +- reference/cited.type.game.html | 2 +- reference/citing.cited.type.game.html | 2 +- reference/clique.number.html | 2 +- reference/cliques.html | 360 +++++++-------- reference/closeness.html | 2 +- reference/cluster.distribution.html | 2 +- reference/cluster_edge_betweenness.html | 2 +- reference/cluster_fast_greedy.html | 2 +- reference/cluster_fluid_communities.html | 2 +- reference/cluster_infomap.html | 2 +- reference/cluster_label_prop.html | 2 +- reference/cluster_leading_eigen.html | 2 +- reference/cluster_leiden.html | 2 +- reference/cluster_louvain.html | 2 +- reference/cluster_optimal.html | 2 +- reference/cluster_spinglass.html | 2 +- reference/cluster_walktrap.html | 2 +- reference/clusters.html | 2 +- reference/cocitation.html | 2 +- reference/code.length.html | 2 +- reference/cohesive.blocks.html | 2 +- reference/cohesive_blocks.html | 12 +- reference/communities.html | 2 +- reference/compare.html | 2 +- reference/complementer.html | 10 +- reference/component_wise.html | 2 +- reference/components.html | 6 +- reference/compose.html | 6 +- reference/connect.neighborhood.html | 2 +- reference/consensus_tree.html | 2 +- reference/console.html | 2 +- reference/constraint.html | 2 +- reference/contract.html | 6 +- reference/contract.vertices.html | 2 +- reference/convex.hull.html | 2 +- reference/convex_hull.html | 2 +- reference/coreness.html | 2 +- reference/count.multiple.html | 2 +- reference/count_automorphisms.html | 2 +- reference/count_isomorphisms.html | 2 +- reference/count_motifs.html | 2 +- reference/count_subgraph_isomorphisms.html | 2 +- reference/count_triangles.html | 2 +- reference/create.communities.html | 2 +- reference/curve_multiple.html | 2 +- reference/cutat.html | 2 +- reference/decompose.graph.html | 2 +- reference/decompose.html | 2 +- reference/degree.distribution.html | 2 +- reference/degree.html | 2 +- reference/degree.sequence.game.html | 2 +- reference/delete.edges.html | 2 +- reference/delete.vertices.html | 2 +- reference/delete_edge_attr.html | 2 +- reference/delete_edges.html | 14 +- reference/delete_graph_attr.html | 2 +- reference/delete_vertex_attr.html | 2 +- reference/delete_vertices.html | 14 +- reference/dendPlot.html | 2 +- reference/dfs.html | 8 +- reference/diameter.html | 6 +- reference/difference.html | 2 +- reference/difference.igraph.es.html | 4 +- reference/difference.igraph.html | 4 +- reference/difference.igraph.vs.html | 4 +- reference/dim_select.html | 2 +- reference/disjoint_union.html | 6 +- reference/distances.html | 38 +- reference/diverging_pal.html | 2 +- reference/diversity.html | 2 +- reference/dominator.tree.html | 2 +- reference/dominator_tree.html | 2 +- reference/dot-apply_modifiers.html | 2 +- reference/dot-data.html | 2 +- ...dot-extract_constructor_and_modifiers.html | 2 +- reference/dot-igraph.progress.html | 2 +- reference/dot-igraph.status.html | 2 +- reference/dyad.census.html | 2 +- reference/dyad_census.html | 2 +- reference/each_edge.html | 2 +- reference/eccentricity.html | 2 +- reference/edge.betweenness.community.html | 2 +- reference/edge.betweenness.html | 2 +- reference/edge.connectivity.html | 2 +- reference/edge.disjoint.paths.html | 2 +- reference/edge.html | 4 +- reference/edge_attr-set.html | 6 +- reference/edge_attr.html | 6 +- reference/edge_attr_names.html | 2 +- reference/edge_connectivity.html | 2 +- reference/edge_density.html | 2 +- reference/ego.html | 62 +-- reference/eigen_centrality.html | 2 +- reference/embed_adjacency_matrix.html | 2 +- reference/embed_laplacian_matrix.html | 2 +- reference/ends.html | 2 +- reference/erdos.renyi.game.html | 2 +- reference/establishment.game.html | 2 +- reference/estimate_betweenness.html | 2 +- reference/estimate_closeness.html | 2 +- reference/estimate_edge_betweenness.html | 2 +- reference/evcent.html | 2 +- reference/exportPajek.html | 2 +- reference/farthest.nodes.html | 2 +- reference/fastgreedy.community.html | 2 +- reference/feedback_arc_set.html | 6 +- reference/fit_hrg.html | 2 +- reference/fit_power_law.html | 2 +- reference/forest.fire.game.html | 2 +- reference/from_incidence_matrix.html | 2 +- reference/get.adjacency.html | 2 +- reference/get.adjedgelist.html | 2 +- reference/get.adjlist.html | 2 +- reference/get.all.shortest.paths.html | 2 +- reference/get.data.frame.html | 2 +- reference/get.diameter.html | 2 +- reference/get.edge.attribute.html | 2 +- reference/get.edge.html | 2 +- reference/get.edge.ids.html | 2 +- reference/get.edgelist.html | 2 +- reference/get.graph.attribute.html | 2 +- reference/get.incidence.html | 2 +- reference/get.shortest.paths.html | 2 +- reference/get.stochastic.html | 2 +- reference/get.vertex.attribute.html | 2 +- reference/getIgraphOpt.html | 2 +- reference/get_edge_ids.html | 6 +- reference/girth.html | 8 +- reference/global_efficiency.html | 2 +- reference/gorder.html | 2 +- reference/graph.adhesion.html | 2 +- reference/graph.adjacency.html | 2 +- reference/graph.adjlist.html | 2 +- reference/graph.atlas.html | 2 +- reference/graph.automorphisms.html | 2 +- reference/graph.bfs.html | 2 +- reference/graph.bipartite.html | 2 +- reference/graph.cohesion.html | 2 +- reference/graph.complementer.html | 2 +- reference/graph.compose.html | 2 +- reference/graph.coreness.html | 2 +- reference/graph.data.frame.html | 2 +- reference/graph.de.bruijn.html | 2 +- reference/graph.density.html | 2 +- reference/graph.dfs.html | 2 +- reference/graph.difference.html | 2 +- reference/graph.disjoint.union.html | 2 +- reference/graph.diversity.html | 2 +- reference/graph.edgelist.html | 2 +- reference/graph.eigen.html | 2 +- reference/graph.empty.html | 2 +- reference/graph.extended.chordal.ring.html | 2 +- reference/graph.famous.html | 2 +- reference/graph.formula.html | 2 +- reference/graph.full.bipartite.html | 2 +- reference/graph.full.citation.html | 2 +- reference/graph.full.html | 2 +- reference/graph.graphdb.html | 2 +- reference/graph.html | 2 +- reference/graph.incidence.html | 2 +- reference/graph.intersection.html | 2 +- reference/graph.isocreate.html | 2 +- reference/graph.kautz.html | 2 +- reference/graph.knn.html | 2 +- reference/graph.laplacian.html | 2 +- reference/graph.lattice.html | 2 +- reference/graph.lcf.html | 2 +- reference/graph.maxflow.html | 2 +- reference/graph.mincut.html | 2 +- reference/graph.motifs.est.html | 2 +- reference/graph.motifs.html | 2 +- reference/graph.motifs.no.html | 2 +- reference/graph.neighborhood.html | 2 +- reference/graph.ring.html | 2 +- reference/graph.star.html | 2 +- reference/graph.strength.html | 2 +- reference/graph.tree.html | 2 +- reference/graph.union.html | 2 +- reference/graph_.html | 10 +- reference/graph_attr-set.html | 6 +- reference/graph_attr.html | 2 +- reference/graph_attr_names.html | 2 +- reference/graph_center.html | 12 +- reference/graph_from_adj_list.html | 2 +- reference/graph_from_adjacency_matrix.html | 4 +- reference/graph_from_atlas.html | 10 +- reference/graph_from_biadjacency_matrix.html | 6 +- reference/graph_from_data_frame.html | 6 +- reference/graph_from_edgelist.html | 10 +- reference/graph_from_graphdb.html | 2 +- reference/graph_from_graphnel.html | 10 +- reference/graph_from_incidence_matrix.html | 2 +- reference/graph_from_isomorphism_class.html | 2 +- reference/graph_from_lcf.html | 2 +- reference/graph_from_literal.html | 26 +- reference/graph_id.html | 10 +- reference/graph_version.html | 2 +- reference/graphlet_basis.html | 2 +- reference/graphlets.candidate.basis.html | 2 +- reference/graphlets.project.html | 2 +- reference/greedy_vertex_coloring.html | 2 +- reference/grg.game.html | 2 +- reference/groups.html | 2 +- reference/growing.random.game.html | 2 +- reference/gsize.html | 2 +- reference/handle_vertex_type_arg.html | 2 +- reference/harmonic_centrality.html | 2 +- reference/has.multiple.html | 2 +- reference/has_eulerian_path.html | 6 +- reference/head_of.html | 2 +- reference/head_print.html | 2 +- reference/hits_scores.html | 2 +- reference/hrg-methods.html | 2 +- reference/hrg.consensus.html | 2 +- reference/hrg.create.html | 2 +- reference/hrg.dendrogram.html | 2 +- reference/hrg.fit.html | 2 +- reference/hrg.game.html | 2 +- reference/hrg.html | 2 +- reference/hrg.predict.html | 2 +- reference/hrg_tree.html | 2 +- reference/hub.score.html | 2 +- reference/hub_score.html | 2 +- reference/identical_graphs.html | 2 +- reference/igraph-attribute-combination.html | 22 +- reference/igraph-dollar.html | 2 +- reference/igraph-es-attributes.html | 2 +- reference/igraph-es-indexing.html | 14 +- reference/igraph-es-indexing2.html | 8 +- reference/igraph-minus.html | 2 +- reference/igraph-vs-attributes.html | 2 +- reference/igraph-vs-indexing.html | 18 +- reference/igraph-vs-indexing2.html | 10 +- reference/igraph.console.html | 2 +- reference/igraph.from.graphNEL.html | 2 +- reference/igraph.options.html | 2 +- reference/igraph.sample.html | 2 +- reference/igraph.shape.noclip.html | 2 +- reference/igraph.shape.noplot.html | 2 +- reference/igraph.to.graphNEL.html | 2 +- reference/igraph.version.html | 2 +- reference/igraph_demo.html | 2 +- reference/igraph_options.html | 2 +- reference/igraph_version.html | 2 +- reference/igraphdemo.html | 2 +- reference/incident.html | 6 +- reference/incident_edges.html | 6 +- reference/indent_print.html | 2 +- reference/independence.number.html | 2 +- reference/independent.vertex.sets.html | 2 +- reference/induced.subgraph.html | 2 +- reference/infomap.community.html | 2 +- reference/inside-square-error.html | 2 +- reference/interconnected.islands.game.html | 2 +- reference/intersection.html | 2 +- reference/intersection.igraph.es.html | 4 +- reference/intersection.igraph.html | 6 +- reference/intersection.igraph.vs.html | 4 +- reference/is.bipartite.html | 2 +- reference/is.chordal.html | 2 +- reference/is.connected.html | 2 +- reference/is.dag.html | 2 +- reference/is.degree.sequence.html | 2 +- reference/is.directed.html | 2 +- reference/is.graphical.degree.sequence.html | 2 +- reference/is.hierarchical.html | 2 +- reference/is.igraph.html | 2 +- reference/is.loop.html | 2 +- reference/is.matching.html | 2 +- reference/is.maximal.matching.html | 2 +- reference/is.minimal.separator.html | 2 +- reference/is.multiple.html | 2 +- reference/is.mutual.html | 2 +- reference/is.named.html | 2 +- reference/is.separator.html | 2 +- reference/is.simple.html | 2 +- reference/is.weighted.html | 2 +- reference/is_acyclic.html | 2 +- reference/is_biconnected.html | 2 +- reference/is_bipartite.html | 2 +- reference/is_chordal.html | 6 +- reference/is_dag.html | 2 +- reference/is_degseq.html | 2 +- reference/is_directed.html | 2 +- reference/is_forest.html | 4 +- reference/is_graphical.html | 2 +- reference/is_igraph.html | 2 +- reference/is_min_separator.html | 2 +- reference/is_named.html | 4 +- reference/is_printer_callback.html | 2 +- reference/is_separator.html | 6 +- reference/is_tree.html | 4 +- reference/is_weighted.html | 6 +- reference/isomorphic.html | 2 +- reference/isomorphism_class.html | 2 +- reference/isomorphisms.html | 2 +- reference/ivs.html | 42 +- reference/k.regular.game.html | 2 +- reference/k_shortest_paths.html | 2 +- reference/keeping_degseq.html | 6 +- reference/knn.html | 2 +- reference/label.propagation.community.html | 2 +- reference/laplacian_matrix.html | 2 +- reference/largest.cliques.html | 2 +- .../largest.independent.vertex.sets.html | 2 +- reference/lastcit.game.html | 2 +- reference/layout.auto.html | 2 +- reference/layout.bipartite.html | 2 +- reference/layout.circle.html | 2 +- reference/layout.davidson.harel.html | 2 +- reference/layout.drl.html | 2 +- .../layout.fruchterman.reingold.grid.html | 2 +- reference/layout.fruchterman.reingold.html | 2 +- reference/layout.gem.html | 2 +- reference/layout.graphopt.html | 2 +- reference/layout.grid.3d.html | 2 +- reference/layout.grid.html | 2 +- reference/layout.kamada.kawai.html | 2 +- reference/layout.lgl.html | 2 +- reference/layout.mds.html | 2 +- reference/layout.merge.html | 2 +- reference/layout.norm.html | 2 +- reference/layout.random.html | 2 +- reference/layout.reingold.tilford.html | 2 +- reference/layout.sphere.html | 2 +- reference/layout.spring.html | 2 +- reference/layout.star.html | 2 +- reference/layout.sugiyama.html | 2 +- reference/layout.svd.html | 2 +- reference/layout_.html | 2 +- reference/layout_as_bipartite.html | 2 +- reference/layout_as_star.html | 2 +- reference/layout_as_tree.html | 2 +- reference/layout_in_circle.html | 2 +- reference/layout_nicely.html | 2 +- reference/layout_on_grid.html | 2 +- reference/layout_on_sphere.html | 2 +- reference/layout_randomly.html | 2 +- reference/layout_with_dh.html | 2 +- reference/layout_with_drl.html | 2 +- reference/layout_with_fr.html | 2 +- reference/layout_with_gem.html | 2 +- reference/layout_with_graphopt.html | 2 +- reference/layout_with_kk.html | 2 +- reference/layout_with_lgl.html | 2 +- reference/layout_with_mds.html | 2 +- reference/layout_with_sugiyama.html | 2 +- reference/leading.eigenvector.community.html | 2 +- reference/line.graph.html | 2 +- reference/list.edge.attributes.html | 2 +- reference/list.graph.attributes.html | 2 +- reference/list.vertex.attributes.html | 2 +- reference/local_scan.html | 2 +- reference/make_.html | 2 +- reference/make_bipartite_graph.html | 6 +- reference/make_chordal_ring.html | 2 +- reference/make_clusters.html | 2 +- reference/make_de_bruijn_graph.html | 10 +- reference/make_empty_graph.html | 10 +- reference/make_from_prufer.html | 2 +- reference/make_full_bipartite_graph.html | 2 +- reference/make_full_citation_graph.html | 4 +- reference/make_full_graph.html | 8 +- reference/make_graph.html | 10 +- reference/make_kautz_graph.html | 10 +- reference/make_lattice.html | 10 +- reference/make_line_graph.html | 14 +- reference/make_ring.html | 10 +- reference/make_star.html | 10 +- reference/make_tree.html | 10 +- reference/match_vertices.html | 2 +- reference/matching.html | 10 +- reference/max_cardinality.html | 6 +- reference/max_flow.html | 8 +- reference/maxcohesion.html | 2 +- reference/maximal.cliques.count.html | 2 +- reference/maximal.cliques.html | 2 +- .../maximal.independent.vertex.sets.html | 2 +- reference/maximal_ivs.html | 2 +- reference/maximum.bipartite.matching.html | 2 +- reference/maximum.cardinality.search.html | 2 +- reference/merge_coords.html | 2 +- reference/min_cut.html | 14 +- reference/min_separators.html | 56 +-- reference/min_st_separators.html | 70 +-- reference/minimal.st.separators.html | 2 +- reference/minimum.size.separators.html | 2 +- reference/minimum.spanning.tree.html | 2 +- reference/mod.matrix.html | 2 +- reference/modularity.igraph.html | 2 +- reference/motifs.html | 2 +- reference/mst.html | 2 +- reference/multilevel.community.html | 2 +- reference/neighborhood.size.html | 2 +- reference/neighbors.html | 4 +- reference/no.clusters.html | 2 +- reference/norm_coords.html | 2 +- reference/normalize.html | 2 +- reference/optimal.community.html | 2 +- reference/page.rank.html | 2 +- reference/page_rank.html | 2 +- reference/path.html | 6 +- reference/path.length.hist.html | 2 +- reference/permute.html | 2 +- reference/permute.vertices.html | 2 +- reference/piecewise.layout.html | 2 +- reference/pipe.html | 2 +- reference/plot.common.html | 2 +- reference/plot.igraph.html | 2 +- reference/plot.sir.html | 2 +- reference/plotHierarchy.html | 2 +- reference/plot_dendrogram.communities.html | 2 +- reference/plot_dendrogram.igraphHRG.html | 2 +- reference/plus-.igraph.html | 2 +- reference/power.law.fit.html | 2 +- reference/power_centrality.html | 2 +- reference/predict_edges.html | 2 +- reference/preference.game.html | 2 +- reference/print.igraph.es.html | 16 +- reference/print.igraph.html | 8 +- reference/print.igraph.vs.html | 14 +- reference/print.igraphHRG.html | 2 +- reference/print.igraphHRGConsensus.html | 2 +- reference/printer_callback.html | 2 +- reference/r_pal.html | 2 +- reference/radius.html | 2 +- reference/random_walk.html | 2 +- reference/read.graph.html | 2 +- reference/read_graph.html | 2 +- reference/realize_bipartite_degseq.html | 2 +- reference/realize_degseq.html | 2 +- reference/reciprocity.html | 2 +- reference/remove.edge.attribute.html | 2 +- reference/remove.graph.attribute.html | 2 +- reference/remove.vertex.attribute.html | 2 +- reference/rep.igraph.html | 2 +- reference/rev.igraph.es.html | 6 +- reference/rev.igraph.vs.html | 4 +- reference/reverse_edges.html | 6 +- reference/rewire.html | 6 +- reference/rglplot.html | 2 +- reference/running.mean.html | 2 +- reference/running_mean.html | 2 +- reference/sample_.html | 2 +- reference/sample_bipartite.html | 18 +- reference/sample_chung_lu.html | 2 +- reference/sample_correlated_gnp.html | 10 +- reference/sample_correlated_gnp_pair.html | 10 +- reference/sample_degseq.html | 2 +- reference/sample_dirichlet.html | 2 +- reference/sample_dot_product.html | 10 +- reference/sample_fitness.html | 2 +- reference/sample_fitness_pl.html | 2 +- reference/sample_forestfire.html | 2 +- reference/sample_gnm.html | 2 +- reference/sample_gnp.html | 2 +- reference/sample_grg.html | 2 +- reference/sample_growing.html | 2 +- reference/sample_hierarchical_sbm.html | 6 +- reference/sample_hrg.html | 2 +- reference/sample_islands.html | 2 +- reference/sample_k_regular.html | 2 +- reference/sample_last_cit.html | 2 +- reference/sample_motifs.html | 2 +- reference/sample_pa.html | 2 +- reference/sample_pa_age.html | 2 +- reference/sample_pref.html | 2 +- reference/sample_sbm.html | 6 +- reference/sample_seq.html | 2 +- reference/sample_smallworld.html | 2 +- reference/sample_spanning_tree.html | 2 +- reference/sample_sphere_surface.html | 2 +- reference/sample_sphere_volume.html | 2 +- reference/sample_traits_callaway.html | 2 +- reference/sample_tree.html | 2 +- reference/sbm.game.html | 2 +- reference/scan_stat.html | 2 +- reference/sequential_pal.html | 2 +- reference/set.edge.attribute.html | 2 +- reference/set.graph.attribute.html | 2 +- reference/set.vertex.attribute.html | 2 +- reference/set_edge_attr.html | 6 +- reference/set_graph_attr.html | 6 +- reference/set_vertex_attr.html | 6 +- reference/shapes.html | 2 +- reference/shortest.paths.html | 2 +- reference/showtrace.html | 2 +- reference/similarity.dice.html | 2 +- reference/similarity.html | 2 +- reference/similarity.invlogweighted.html | 2 +- reference/similarity.jaccard.html | 2 +- reference/simplified.html | 10 +- reference/simplify.html | 2 +- reference/sir.html | 2 +- reference/spectrum.html | 2 +- reference/spinglass.community.html | 2 +- reference/split_join_distance.html | 2 +- reference/stCuts.html | 2 +- reference/stMincuts.html | 2 +- reference/st_cuts.html | 62 +-- reference/st_min_cuts.html | 14 +- reference/static.fitness.game.html | 2 +- reference/static.power.law.game.html | 2 +- reference/stochastic_matrix.html | 2 +- reference/strength.html | 2 +- reference/sub-.igraph.html | 2 +- reference/sub-sub-.igraph.html | 2 +- reference/subcomponent.html | 8 +- reference/subgraph.centrality.html | 2 +- reference/subgraph.edges.html | 2 +- reference/subgraph.html | 2 +- reference/subgraph_centrality.html | 2 +- reference/subgraph_isomorphic.html | 52 +-- reference/subgraph_isomorphisms.html | 2 +- reference/tail_of.html | 2 +- reference/tkigraph.html | 2 +- reference/tkplot.canvas.html | 2 +- reference/tkplot.center.html | 2 +- reference/tkplot.close.html | 2 +- reference/tkplot.export.postscript.html | 2 +- reference/tkplot.fit.to.screen.html | 2 +- reference/tkplot.getcoords.html | 2 +- reference/tkplot.html | 2 +- reference/tkplot.off.html | 2 +- reference/tkplot.reshape.html | 2 +- reference/tkplot.rotate.html | 2 +- reference/tkplot.setcoords.html | 2 +- reference/to_prufer.html | 2 +- reference/topo_sort.html | 4 +- reference/topological.sort.html | 2 +- reference/transitivity.html | 2 +- reference/triad.census.html | 2 +- reference/triad_census.html | 2 +- reference/unfold.tree.html | 2 +- reference/unfold_tree.html | 2 +- reference/union.html | 2 +- reference/union.igraph.es.html | 4 +- reference/union.igraph.html | 6 +- reference/union.igraph.vs.html | 4 +- reference/unique.igraph.es.html | 6 +- reference/unique.igraph.vs.html | 6 +- reference/upgrade_graph.html | 2 +- reference/vertex.connectivity.html | 2 +- reference/vertex.disjoint.paths.html | 2 +- reference/vertex.html | 6 +- reference/vertex.shape.pie.html | 2 +- reference/vertex.shapes.html | 2 +- reference/vertex_attr-set.html | 6 +- reference/vertex_attr.html | 2 +- reference/vertex_attr_names.html | 2 +- reference/vertex_connectivity.html | 2 +- reference/voronoi_cells.html | 2 +- reference/walktrap.community.html | 2 +- reference/watts.strogatz.game.html | 2 +- reference/weighted_cliques.html | 416 +++++++++--------- reference/which_multiple.html | 2 +- reference/which_mutual.html | 2 +- reference/with_edge_.html | 2 +- reference/with_graph_.html | 6 +- reference/with_igraph_opt.html | 2 +- reference/with_vertex_.html | 2 +- reference/without_attr.html | 10 +- reference/without_loops.html | 10 +- reference/without_multiples.html | 10 +- reference/write.graph.html | 2 +- reference/write_graph.html | 2 +- search.json | 2 +- 662 files changed, 1631 insertions(+), 1631 deletions(-) diff --git a/AUTHORS-list.html b/AUTHORS-list.html index ac0bb196af..cdf71876b2 100644 --- a/AUTHORS-list.html +++ b/AUTHORS-list.html @@ -39,7 +39,7 @@

Full list of authors

- Source: AUTHORS-list.md + Source: AUTHORS-list.md
diff --git a/CONTRIBUTING.html b/CONTRIBUTING.html index db52e8442d..e52554528c 100644 --- a/CONTRIBUTING.html +++ b/CONTRIBUTING.html @@ -39,7 +39,7 @@

Contributing to igraph

- Source: .github/CONTRIBUTING.md + Source: .github/CONTRIBUTING.md
diff --git a/articles/deprecated-dot-case.html b/articles/deprecated-dot-case.html index c114007f65..745428bbbd 100644 --- a/articles/deprecated-dot-case.html +++ b/articles/deprecated-dot-case.html @@ -72,7 +72,7 @@

Function name changes: from dot case to snake case

- Source: vignettes/articles/deprecated-dot-case.Rmd + Source: vignettes/articles/deprecated-dot-case.Rmd
deprecated-dot-case.Rmd
diff --git a/articles/igraph.html b/articles/igraph.html index c628468821..66b26c76b2 100644 --- a/articles/igraph.html +++ b/articles/igraph.html @@ -72,7 +72,7 @@

igraph (R interface)

- Source: vignettes/igraph.Rmd + Source: vignettes/igraph.Rmd
igraph.Rmd
@@ -145,9 +145,9 @@

Creating a graphWe can print the graph to get a summary of its nodes and edges:

 g
-
## IGRAPH e300813 UN-- 10 2 -- 
+
## IGRAPH 7f503f2 UN-- 10 2 -- 
 ## + attr: name (v/c)
-## + edges from e300813 (vertex names):
+## + edges from 7f503f2 (vertex names):
 ## [1] 1--2 1--5

 
This means: Undirected Named graph
 with 10 vertices and 2 edges, with the
@@ -159,7 +159,7 @@ 
Creating a graph
 
-
## IGRAPH e300813 UN-- 10 2 -- 
+
## IGRAPH 7f503f2 UN-- 10 2 -- 
 ## + attr: name (v/c)

 
The same function make_graph() can create some notable
 graphs by just specifying their name. For example you can create the
@@ -240,9 +240,9 @@ 
Adding/deleting vertices and edges  add_vertices(3) %>%
   add_edges(edges = c(38, 39, 39, 40, 40, 38, 40, 37))
 g

-
## IGRAPH f342f31 U--- 40 86 -- Zachary
+
## IGRAPH b3b39d4 U--- 40 86 -- Zachary
 ## + attr: name (g/c)
-## + edges from f342f31:
+## + edges from b3b39d4:
 ##  [1]  1-- 2  1-- 3  1-- 4  1-- 5  1-- 6  1-- 7  1-- 8  1-- 9  1--11  1--12
 ## [11]  1--13  1--14  1--18  1--20  1--22  1--32  2-- 3  2-- 4  2-- 8  2--14
 ## [21]  2--18  2--20  2--22  2--31  3-- 4  3-- 8  3--28  3--29  3--33  3--10
@@ -334,7 +334,7 @@ 
Constructing graphs
 graph1 <- make_tree(127, 2, mode = "undirected")
 summary(graph1)
-
## IGRAPH e11661a U--- 127 126 -- Tree
+
## IGRAPH 4220adc U--- 127 126 -- Tree
 ## + attr: name (g/c), children (g/n), mode (g/c)

 
This generates a regular tree graph with 127 vertices, each vertex
 having two children. No matter how many times you call
@@ -351,7 +351,7 @@ 
Constructing graphs
 graph1 <- sample_grg(100, 0.2)
 summary(graph1)

-
## IGRAPH 297668f U--- 100 524 -- Geometric random graph
+
## IGRAPH 4621f49 U--- 100 524 -- Geometric random graph
 ## + attr: name (g/c), radius (g/n), torus (g/l)

 
This generates a geometric random graph: n points are chosen
 randomly and uniformly inside the unit square and pairs of points closer
@@ -406,7 +406,7 @@ 
Setting and retrieving attributesV(g)$gender <- c("f", "m", "f", "m", "m", "f", "m")
 E(g)$is_formal <- c(FALSE, FALSE, TRUE, TRUE, TRUE, FALSE, TRUE, FALSE, FALSE)
 summary(g)

-
## IGRAPH 0b87cb0 UN-- 7 9 -- 
+
## IGRAPH 83a28e7 UN-- 7 9 -- 
 ## + attr: name (v/c), age (v/n), gender (v/c), is_formal (e/l)

 
V() and E() are the standard way to obtain
 a sequence of all vertices and edges, respectively. This assigns an
@@ -450,7 +450,7 @@ 
Setting and retrieving attributes
 V(g)$name[1:3] <- c("Alejandra", "Bruno", "Carmina")
 V(g)

-
## + 7/7 vertices, named, from 0b87cb0:
+
## + 7/7 vertices, named, from 83a28e7:
 ## [1] Alejandra Bruno     Carmina   Moshe     Nang      Samira    Ibrahim

 
To delete attributes:

 
@@ -570,12 +570,12 @@ 
Selecting vertices
 seq <- V(graph)[2, 3, 7]
 seq

-
## + 3/10 vertices, from 99fdbbe:
+
## + 3/10 vertices, from 9bd6827:
 ## [1] 2 3 7

 
 seq <- seq[1, 3] # filtering an existing vertex set
 seq

-
## + 2/10 vertices, from 99fdbbe:
+
## + 2/10 vertices, from 9bd6827:
 ## [1] 2 7

 
Selecting a vertex that does not exist results in an error:

 
@@ -671,12 +671,12 @@ 
Selecting edges
 
 E(g)[.from(3)]

-
## + 4/9 edges from 0b87cb0 (vertex names):
+
## + 4/9 edges from 83a28e7 (vertex names):
 ## [1] Alejandra--Carmina Carmina  --Moshe   Carmina  --Nang    Carmina  --Samira

 
Of course it also works with vertex names:

 
 E(g)[.from("Carmina")]

-
## + 4/9 edges from 0b87cb0 (vertex names):
+
## + 4/9 edges from 83a28e7 (vertex names):
 ## [1] Alejandra--Carmina Carmina  --Moshe   Carmina  --Nang    Carmina  --Samira

 
Using .to() filters edge sequences based on the target
 vertices. This is different from .from() if the graph is
@@ -691,7 +691,7 @@ 
Selecting edges
 
 E(g)[3:5 %--% 5:6]

-
## + 3/9 edges from 0b87cb0 (vertex names):
+
## + 3/9 edges from 83a28e7 (vertex names):
 ## [1] Carmina--Nang   Carmina--Samira Nang   --Samira

 
To make the %--% operator work with names, you can build
 string vectors containing the names and then use these vectors as
@@ -710,7 +710,7 @@ 
Selecting edges## [1] "Alejandra" "Carmina"   "Samira"

 
 E(g)[men %--% women]

-
## + 5/9 edges from 0b87cb0 (vertex names):
+
## + 5/9 edges from 83a28e7 (vertex names):
 ## [1] Alejandra--Bruno  Alejandra--Moshe  Carmina  --Moshe  Carmina  --Nang  
 ## [5] Nang     --Samira

 

diff --git a/articles/igraph_ES.html b/articles/igraph_ES.html
index 9eb217da7f..29e5ca8b10 100644
--- a/articles/igraph_ES.html
+++ b/articles/igraph_ES.html
@@ -72,7 +72,7 @@
       
igraph (interfaz R)

             
       
-      Source: vignettes/igraph_ES.rmd
+      Source: vignettes/igraph_ES.rmd
       
igraph_ES.rmd

     
 
@@ -149,9 +149,9 @@ 
Crear un grafo
 
 g

-
## IGRAPH 414ec7a UN-- 10 2 -- 
+
## IGRAPH 16410e1 UN-- 10 2 -- 
 ## + attr: name (v/c)
-## + edges from 414ec7a (vertex names):
+## + edges from 16410e1 (vertex names):
 ## [1] 1--2 1--5

 
Esto significa: grafo no dirigido (Undirected) con
 10 vértices y 2 aristas, que se
@@ -163,7 +163,7 @@ 
Crear un grafo
 
-
## IGRAPH 414ec7a UN-- 10 2 -- 
+
## IGRAPH 16410e1 UN-- 10 2 -- 
 ## + attr: name (v/c)

 
También make_graph() puede crear algunos grafos
 destacados con sólo especificar su nombre. Por ejemplo, puedes generar
@@ -250,9 +250,9 @@ 
Añadir y borrar vértices y arist
   add_vertices(3) %>%
   add_edges(edges = c(38, 39, 39, 40, 40, 38, 40, 37))
 g

-
## IGRAPH e495140 U--- 40 86 -- Zachary
+
## IGRAPH 87f42f3 U--- 40 86 -- Zachary
 ## + attr: name (g/c)
-## + edges from e495140:
+## + edges from 87f42f3:
 ##  [1]  1-- 2  1-- 3  1-- 4  1-- 5  1-- 6  1-- 7  1-- 8  1-- 9  1--11  1--12
 ## [11]  1--13  1--14  1--18  1--20  1--22  1--32  2-- 3  2-- 4  2-- 8  2--14
 ## [21]  2--18  2--20  2--22  2--31  3-- 4  3-- 8  3--28  3--29  3--33  3--10
@@ -348,7 +348,7 @@ 
Construcción de grafos
 graph1 <- make_tree(127, 2, mode = "undirected")
 summary(g)

-
## IGRAPH 34b97d0 U--- 5 3 -- Ring graph
+
## IGRAPH 94eb064 U--- 5 3 -- Ring graph
 ## + attr: name (g/c), mutual (g/l), circular (g/l)

 
Esto genera un grafo regular en forma de árbol con 127 vértices, cada
 vértice con dos hijos. No importa cuántas veces llames a
@@ -365,7 +365,7 @@ 
Construcción de grafos
 graph1 <- sample_grg(100, 0.2)
 summary(graph1)

-
## IGRAPH a146a18 U--- 100 524 -- Geometric random graph
+
## IGRAPH 35ad407 U--- 100 524 -- Geometric random graph
 ## + attr: name (g/c), radius (g/n), torus (g/l)

 
Esto genera un grafo geométrico aleatorio: Se eligen n
 puntos de forma aleatoria y uniforme dentro del espacio métrico, y los
@@ -423,7 +423,7 @@ 
Establecer y recuperar atributosV(g)$gender <- c("f", "m", "f", "m", "m", "f", "m")
 E(g)$is_formal <- c(FALSE, FALSE, TRUE, TRUE, TRUE, FALSE, TRUE, FALSE, FALSE)
 summary(g)

-
## IGRAPH 4c3768b UN-- 7 9 -- 
+
## IGRAPH ed9002a UN-- 7 9 -- 
 ## + attr: name (v/c), age (v/n), gender (v/c), is_formal (e/l)

 
V y E son la forma estándar de obtener una
 secuencia de todos los vértices y aristas respectivamente. Esto asigna
@@ -471,7 +471,7 @@ 
Establecer y recuperar atributos
 V(g)$name[1:3] <- c("Alejandra", "Bruno", "Carmina")
 V(g)

-
## + 7/7 vertices, named, from 4c3768b:
+
## + 7/7 vertices, named, from ed9002a:
 ## [1] Alejandra Bruno     Carmina   Moshe     Nang      Samira    Ibrahim

 
Para eliminar atributos:

 
@@ -594,12 +594,12 @@ 
Selección de vértices
 seq <- V(graph)[2, 3, 7]
 seq

-
## + 3/10 vertices, from 1de357b:
+
## + 3/10 vertices, from 6b9a617:
 ## [1] 2 3 7

 
 seq <- seq[1, 3]    # filtrar un conjunto de vértices existente
 seq

-
## + 2/10 vertices, from 1de357b:
+
## + 2/10 vertices, from 6b9a617:
 ## [1] 2 7

 
Al seleccionar un vértice que no existe se produce un error:

 
@@ -693,12 +693,12 @@ 
Selección de aristas
 
 E(g)[.from(3)]

-
## + 4/9 edges from 4c3768b (vertex names):
+
## + 4/9 edges from ed9002a (vertex names):
 ## [1] Alejandra--Carmina Carmina  --Moshe   Carmina  --Nang    Carmina  --Samira

 
Por supuesto, también funciona con nombres de vértices:

 
 E(g)[.from("Carmina")]

-
## + 4/9 edges from 4c3768b (vertex names):
+
## + 4/9 edges from ed9002a (vertex names):
 ## [1] Alejandra--Carmina Carmina  --Moshe   Carmina  --Nang    Carmina  --Samira

 
Al usar .to(), se filtran la serie de aristas en función
 de los vértices de destino o diana. Esto es diferente de
@@ -715,7 +715,7 @@ 
Selección de aristas
 
 E(g) [ 3:5 %--% 5:6 ]

-
## + 3/9 edges from 4c3768b (vertex names):
+
## + 3/9 edges from ed9002a (vertex names):
 ## [1] Carmina--Nang   Carmina--Samira Nang   --Samira

 
Para que el operador %--% funcione con nombres, puedes
 construir vectores de caracteres que contengan los nombres y luego
@@ -735,7 +735,7 @@ 
Selección de aristas## [1] "Alejandra" "Carmina"   "Samira"

 
 E(g)[men %--% women]

-
## + 5/9 edges from 4c3768b (vertex names):
+
## + 5/9 edges from ed9002a (vertex names):
 ## [1] Alejandra--Bruno  Alejandra--Moshe  Carmina  --Moshe  Carmina  --Nang  
 ## [5] Nang     --Samira

 

diff --git a/articles/installation-troubleshooting.html b/articles/installation-troubleshooting.html
index 550e26e1c5..c087d7f4aa 100644
--- a/articles/installation-troubleshooting.html
+++ b/articles/installation-troubleshooting.html
@@ -72,7 +72,7 @@
       
Installation troubleshooting

             
       
-      Source: vignettes/articles/installation-troubleshooting.Rmd
+      Source: vignettes/articles/installation-troubleshooting.Rmd
       
installation-troubleshooting.Rmd

     
 
diff --git a/authors.html b/authors.html
index e11e36c3e9..bdad70ef17 100644
--- a/authors.html
+++ b/authors.html
@@ -88,7 +88,7 @@ 
Authors

 
     

       
Citation

-      
Source: inst/CITATION

+      
Source: inst/CITATION

 
       
Csardi G, Nepusz T (2006).
 “The igraph software package for complex network research.”
diff --git a/cran-comments.template.html b/cran-comments.template.html
index fb8d561db1..759f73c247 100644
--- a/cran-comments.template.html
+++ b/cran-comments.template.html
@@ -39,7 +39,7 @@
 

   

       
NA

-      Source: cran-comments.template.md
+      Source: cran-comments.template.md
     

 
 
diff --git a/news/index.html b/news/index.html
index 800e1083b9..d5ea1b6906 100644
--- a/news/index.html
+++ b/news/index.html
@@ -39,7 +39,7 @@
 

   

       
Changelog

-      Source: NEWS.md
+      Source: NEWS.md
     

 
     

diff --git a/pkgdown.yml b/pkgdown.yml
index 7d8ee5eb9d..65a2a8d242 100644
--- a/pkgdown.yml
+++ b/pkgdown.yml
@@ -6,7 +6,7 @@ articles:
   igraph_ES: igraph_ES.html
   igraph: igraph.html
   articles/installation-troubleshooting: installation-troubleshooting.html
-last_built: 2025-01-07T19:22Z
+last_built: 2025-01-07T19:41Z
 urls:
   reference: https://r.igraph.org/reference
   article: https://r.igraph.org/articles
diff --git a/reference/E.html b/reference/E.html
index 6e2d39ab65..2bf9aa3585 100644
--- a/reference/E.html
+++ b/reference/E.html
@@ -45,7 +45,7 @@
 

   

       
Edges of a graph

-      Source: R/iterators.R
+      Source: R/iterators.R
       
E.Rd

     

 
@@ -140,14 +140,14 @@ 
Examples
# Edges of an unnamed graph
 g <- make_ring(10)
 E(g)
-#> + 10/10 edges from 243867f:
+#> + 10/10 edges from 7c100a0:
 #>  [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10
 
 # Edges of a named graph
 g2 <- make_ring(10) %>%
   set_vertex_attr("name", value = letters[1:10])
 E(g2)
-#> + 10/10 edges from e766ab9 (vertex names):
+#> + 10/10 edges from 2a4ada8 (vertex names):
 #>  [1] a--b b--c c--d d--e e--f f--g g--h h--i i--j a--j
 

     

diff --git a/reference/V.html b/reference/V.html
index 1321f17f77..e79e011900 100644
--- a/reference/V.html
+++ b/reference/V.html
@@ -39,7 +39,7 @@
 

   

       
Vertices of a graph

-      Source: R/iterators.R
+      Source: R/iterators.R
       
V.Rd

     

 
@@ -120,14 +120,14 @@ 
Examples
# Vertex ids of an unnamed graph
 g <- make_ring(10)
 V(g)
-#> + 10/10 vertices, from 656a3b2:
+#> + 10/10 vertices, from 111402d:
 #>  [1]  1  2  3  4  5  6  7  8  9 10
 
 # Vertex ids of a named graph
 g2 <- make_ring(10) %>%
   set_vertex_attr("name", value = letters[1:10])
 V(g2)
-#> + 10/10 vertices, named, from c965eaf:
+#> + 10/10 vertices, named, from b594bb2:
 #>  [1] a b c d e f g h i j
 

     

diff --git a/reference/aaa-igraph-package.html b/reference/aaa-igraph-package.html
index 1599deb5ac..16e8d492fd 100644
--- a/reference/aaa-igraph-package.html
+++ b/reference/aaa-igraph-package.html
@@ -39,7 +39,7 @@
 

   

       
The igraph package

-      Source: R/igraph-package.R
+      Source: R/igraph-package.R
       
aaa-igraph-package.Rd

     

 
diff --git a/reference/add.edges.html b/reference/add.edges.html
index be96ad19f0..2c997baba3 100644
--- a/reference/add.edges.html
+++ b/reference/add.edges.html
@@ -43,7 +43,7 @@
 

   

       
Add edges to a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
add.edges.Rd

     

 
diff --git a/reference/add.vertex.shape.html b/reference/add.vertex.shape.html
index 1f0d4db2aa..fbb3c72f10 100644
--- a/reference/add.vertex.shape.html
+++ b/reference/add.vertex.shape.html
@@ -43,7 +43,7 @@
 

   

       
Various vertex shapes when plotting igraph graphs

-      Source: R/plot.shapes.R
+      Source: R/plot.shapes.R
       
add.vertex.shape.Rd

     

 
diff --git a/reference/add.vertices.html b/reference/add.vertices.html
index 0bdd1e91d2..c9fbea7439 100644
--- a/reference/add.vertices.html
+++ b/reference/add.vertices.html
@@ -43,7 +43,7 @@
 

   

       
Add vertices to a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
add.vertices.Rd

     

 
diff --git a/reference/add_edges.html b/reference/add_edges.html
index f91642d10c..e46f747e7a 100644
--- a/reference/add_edges.html
+++ b/reference/add_edges.html
@@ -45,7 +45,7 @@
 

   

       
Add edges to a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
add_edges.Rd

     

 
@@ -135,7 +135,7 @@ 
Examples  set_edge_attr("color", value = "red") %>%
   add_edges(c(5, 1), color = "green")
 E(g)[[]]
-#> + 5/5 edges from 3e202fe:
+#> + 5/5 edges from afed596:
 #>   tail head tid hid color
 #> 1    1    2   1   2   red
 #> 2    2    3   2   3   red
diff --git a/reference/add_layout_.html b/reference/add_layout_.html
index 158316398c..e6f2075c6b 100644
--- a/reference/add_layout_.html
+++ b/reference/add_layout_.html
@@ -39,7 +39,7 @@
 

   

       
Add layout to graph

-      Source: R/layout.R
+      Source: R/layout.R
       
add_layout_.Rd

     

 
diff --git a/reference/add_vertices.html b/reference/add_vertices.html
index bde268c18d..a943359eb2 100644
--- a/reference/add_vertices.html
+++ b/reference/add_vertices.html
@@ -43,7 +43,7 @@
 

   

       
Add vertices to a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
add_vertices.Rd

     

 
@@ -126,12 +126,12 @@ 
Examples    4, 5
   ))
 g
-#> IGRAPH 2193a49 D--- 5 4 -- 
+#> IGRAPH 0b61b79 D--- 5 4 -- 
 #> + attr: color (v/c)
-#> + edges from 2193a49:
+#> + edges from 0b61b79:
 #> [1] 1->2 2->3 3->4 4->5
 V(g)[[]]
-#> + 5/5 vertices, from 2193a49:
+#> + 5/5 vertices, from 0b61b79:
 #>   color
 #> 1   red
 #> 2   red
diff --git a/reference/adjacent.triangles.html b/reference/adjacent.triangles.html
index 7b00b41e4c..c199ce8314 100644
--- a/reference/adjacent.triangles.html
+++ b/reference/adjacent.triangles.html
@@ -43,7 +43,7 @@
 

   

       
Find triangles in graphs

-      Source: R/triangles.R
+      Source: R/triangles.R
       
adjacent.triangles.Rd

     

 
diff --git a/reference/adjacent_vertices.html b/reference/adjacent_vertices.html
index 0766bf32a1..205e7d8b7d 100644
--- a/reference/adjacent_vertices.html
+++ b/reference/adjacent_vertices.html
@@ -41,7 +41,7 @@
 

   

       
Adjacent vertices of multiple vertices in a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
adjacent_vertices.Rd

     

 
@@ -100,11 +100,11 @@ 
Examples
g <- make_graph("Zachary")
 adjacent_vertices(g, c(1, 34))
 #> [[1]]
-#> + 16/34 vertices, from ea19140:
+#> + 16/34 vertices, from 463d318:
 #>  [1]  2  3  4  5  6  7  8  9 11 12 13 14 18 20 22 32
 #> 
 #> [[2]]
-#> + 17/34 vertices, from ea19140:
+#> + 17/34 vertices, from 463d318:
 #>  [1]  9 10 14 15 16 19 20 21 23 24 27 28 29 30 31 32 33
 #> 
 

diff --git a/reference/aging.ba.game.html b/reference/aging.ba.game.html
index d86864cb84..bee36f9117 100644
--- a/reference/aging.ba.game.html
+++ b/reference/aging.ba.game.html
@@ -43,7 +43,7 @@
 

   

       
Generate an evolving random graph with preferential attachment and aging

-      Source: R/games.R
+      Source: R/games.R
       
aging.ba.game.Rd

     

 
diff --git a/reference/aging.barabasi.game.html b/reference/aging.barabasi.game.html
index b168c9a9d2..914e40e21b 100644
--- a/reference/aging.barabasi.game.html
+++ b/reference/aging.barabasi.game.html
@@ -43,7 +43,7 @@
 

   

       
Generate an evolving random graph with preferential attachment and aging

-      Source: R/games.R
+      Source: R/games.R
       
aging.barabasi.game.Rd

     

 
diff --git a/reference/aging.prefatt.game.html b/reference/aging.prefatt.game.html
index 1d25449204..d17f158e26 100644
--- a/reference/aging.prefatt.game.html
+++ b/reference/aging.prefatt.game.html
@@ -43,7 +43,7 @@
 

   

       
Generate an evolving random graph with preferential attachment and aging

-      Source: R/games.R
+      Source: R/games.R
       
aging.prefatt.game.Rd

     

 
diff --git a/reference/all_simple_paths.html b/reference/all_simple_paths.html
index f78a07ae56..2246945094 100644
--- a/reference/all_simple_paths.html
+++ b/reference/all_simple_paths.html
@@ -41,7 +41,7 @@
 

   

       
List all simple paths from one source

-      Source: R/paths.R
+      Source: R/paths.R
       
all_simple_paths.Rd

     

 
@@ -120,28 +120,28 @@ 
Examplesg <- make_ring(10)
 all_simple_paths(g, 1, 5)
 #> [[1]]
-#> + 5/10 vertices, from 0781b95:
+#> + 5/10 vertices, from 12904d9:
 #> [1] 1 2 3 4 5
 #> 
 #> [[2]]
-#> + 7/10 vertices, from 0781b95:
+#> + 7/10 vertices, from 12904d9:
 #> [1]  1 10  9  8  7  6  5
 #> 
 all_simple_paths(g, 1, c(3, 5))
 #> [[1]]
-#> + 3/10 vertices, from 0781b95:
+#> + 3/10 vertices, from 12904d9:
 #> [1] 1 2 3
 #> 
 #> [[2]]
-#> + 5/10 vertices, from 0781b95:
+#> + 5/10 vertices, from 12904d9:
 #> [1] 1 2 3 4 5
 #> 
 #> [[3]]
-#> + 7/10 vertices, from 0781b95:
+#> + 7/10 vertices, from 12904d9:
 #> [1]  1 10  9  8  7  6  5
 #> 
 #> [[4]]
-#> + 9/10 vertices, from 0781b95:
+#> + 9/10 vertices, from 12904d9:
 #> [1]  1 10  9  8  7  6  5  4  3
 #> 
 
diff --git a/reference/alpha.centrality.html b/reference/alpha.centrality.html
index dc2a6f402f..a9a50d206b 100644
--- a/reference/alpha.centrality.html
+++ b/reference/alpha.centrality.html
@@ -43,7 +43,7 @@
 

   

       
Find Bonacich alpha centrality scores of network positions

-      Source: R/centrality.R
+      Source: R/centrality.R
       
alpha.centrality.Rd

     

 
diff --git a/reference/alpha_centrality.html b/reference/alpha_centrality.html
index 21ccee9f41..3ab75de22d 100644
--- a/reference/alpha_centrality.html
+++ b/reference/alpha_centrality.html
@@ -41,7 +41,7 @@
 

   

       
Find Bonacich alpha centrality scores of network positions

-      Source: R/centrality.R
+      Source: R/centrality.R
       
alpha_centrality.Rd

     

 
diff --git a/reference/are.connected.html b/reference/are.connected.html
index decac67b76..b195fdace6 100644
--- a/reference/are.connected.html
+++ b/reference/are.connected.html
@@ -43,7 +43,7 @@
 

   

       
Are two vertices adjacent?

-      Source: R/structure.info.R
+      Source: R/structure.info.R
       
are.connected.Rd

     

 
diff --git a/reference/are_adjacent.html b/reference/are_adjacent.html
index b8faf886fa..a7809eca4a 100644
--- a/reference/are_adjacent.html
+++ b/reference/are_adjacent.html
@@ -41,7 +41,7 @@
 

   

       
Are two vertices adjacent?

-      Source: R/structure.info.R
+      Source: R/structure.info.R
       
are_adjacent.Rd

     

 
@@ -101,9 +101,9 @@ 
Examples

     
ug <- make_ring(10)
 ug
-#> IGRAPH 0f63342 U--- 10 10 -- Ring graph
+#> IGRAPH 0a5f478 U--- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 0f63342:
+#> + edges from 0a5f478:
 #>  [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10
 are_adjacent(ug, 1, 2)
 #> [1] TRUE
@@ -112,9 +112,9 @@ 
Examples
 dg <- make_ring(10, directed = TRUE)
 dg
-#> IGRAPH 0da5480 D--- 10 10 -- Ring graph
+#> IGRAPH 336d74f D--- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 0da5480:
+#> + edges from 336d74f:
 #>  [1]  1-> 2  2-> 3  3-> 4  4-> 5  5-> 6  6-> 7  7-> 8  8-> 9  9->10 10-> 1
 are_adjacent(ug, 1, 2)
 #> [1] TRUE
diff --git a/reference/arpack.html b/reference/arpack.html
index deb9c21a2f..7b2f35edd5 100644
--- a/reference/arpack.html
+++ b/reference/arpack.html
@@ -41,7 +41,7 @@
 

   

       
ARPACK eigenvector calculation

-      Source: R/centrality.R
+      Source: R/centrality.R
       
arpack.Rd

     

 
diff --git a/reference/articulation.points.html b/reference/articulation.points.html
index 2701359828..8421171b29 100644
--- a/reference/articulation.points.html
+++ b/reference/articulation.points.html
@@ -43,7 +43,7 @@
 

   

       
Articulation points and bridges of a graph

-      Source: R/components.R
+      Source: R/components.R
       
articulation.points.Rd

     

 
diff --git a/reference/articulation_points.html b/reference/articulation_points.html
index f15b2b79c6..8d8a6628f6 100644
--- a/reference/articulation_points.html
+++ b/reference/articulation_points.html
@@ -39,7 +39,7 @@
 

   

       
Articulation points and bridges of a graph

-      Source: R/components.R
+      Source: R/components.R
       
articulation_points.Rd

     

 
@@ -106,12 +106,12 @@ 
Examplesclu <- components(g)$membership
 g <- add_edges(g, c(match(1, clu), match(2, clu)))
 articulation_points(g)
-#> + 2/10 vertices, from 7636b1b:
+#> + 2/10 vertices, from 6b4a746:
 #> [1] 6 1
 
 g <- make_graph("krackhardt_kite")
 bridges(g)
-#> + 2/18 edges from 53b3b0c:
+#> + 2/18 edges from 610c32d:
 #> [1] 9--10 8-- 9
 
 

diff --git a/reference/as.directed.html b/reference/as.directed.html
index b5e3ba060a..8d8704e76e 100644
--- a/reference/as.directed.html
+++ b/reference/as.directed.html
@@ -43,7 +43,7 @@
 

   

       
Convert between directed and undirected graphs

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as.directed.Rd

     

 
diff --git a/reference/as.igraph.html b/reference/as.igraph.html
index 09f88cec19..bf2edac5ed 100644
--- a/reference/as.igraph.html
+++ b/reference/as.igraph.html
@@ -39,7 +39,7 @@
 

   

       
Conversion to igraph

-      Source: R/hrg.R
+      Source: R/hrg.R
       
as.igraph.Rd

     

 
@@ -86,9 +86,9 @@ 
Examplesg <- make_full_graph(5) + make_full_graph(5)
 hrg <- fit_hrg(g)
 as.igraph(hrg)
-#> IGRAPH 83c45ab DN-- 19 18 -- Fitted HRG
+#> IGRAPH e781f35 DN-- 19 18 -- Fitted HRG
 #> + attr: name (g/c), name (v/c), prob (v/n)
-#> + edges from 83c45ab (vertex names):
+#> + edges from e781f35 (vertex names):
 #>  [1] g1->g4 g2->1  g3->2  g4->g6 g5->8  g6->g2 g7->g9 g8->6  g9->7  g1->g8
 #> [11] g2->g3 g3->4  g4->3  g5->9  g6->5  g7->g5 g8->g7 g9->10
 
diff --git a/reference/as.matrix.igraph.html b/reference/as.matrix.igraph.html
index 1937fe9110..40a7370735 100644
--- a/reference/as.matrix.igraph.html
+++ b/reference/as.matrix.igraph.html
@@ -41,7 +41,7 @@
 

   

       
Convert igraph objects to adjacency or edge list matrices

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as.matrix.igraph.Rd

     

 
diff --git a/reference/as.undirected.html b/reference/as.undirected.html
index 88810e2de0..8331e6b86b 100644
--- a/reference/as.undirected.html
+++ b/reference/as.undirected.html
@@ -43,7 +43,7 @@
 

   

       
Convert between undirected and unundirected graphs

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as.undirected.Rd

     

 
diff --git a/reference/as_adj.html b/reference/as_adj.html
index 4135cf4354..92f339945e 100644
--- a/reference/as_adj.html
+++ b/reference/as_adj.html
@@ -43,7 +43,7 @@
 

   

       
Convert a graph to an adjacency matrix

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_adj.Rd

     

 
diff --git a/reference/as_adj_list.html b/reference/as_adj_list.html
index 706da99816..47a7e32178 100644
--- a/reference/as_adj_list.html
+++ b/reference/as_adj_list.html
@@ -41,7 +41,7 @@
 

   

       
Adjacency lists

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_adj_list.Rd

     

 
@@ -136,84 +136,84 @@ 
Examplesg <- make_ring(10)
 as_adj_list(g)
 #> [[1]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1]  2 10
 #> 
 #> [[2]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1] 1 3
 #> 
 #> [[3]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1] 2 4
 #> 
 #> [[4]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1] 3 5
 #> 
 #> [[5]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1] 4 6
 #> 
 #> [[6]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1] 5 7
 #> 
 #> [[7]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1] 6 8
 #> 
 #> [[8]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1] 7 9
 #> 
 #> [[9]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1]  8 10
 #> 
 #> [[10]]
-#> + 2/10 vertices, from b745131:
+#> + 2/10 vertices, from 946a98b:
 #> [1] 1 9
 #> 
 as_adj_edge_list(g)
 #> [[1]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 1-- 2 1--10
 #> 
 #> [[2]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 1--2 2--3
 #> 
 #> [[3]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 2--3 3--4
 #> 
 #> [[4]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 3--4 4--5
 #> 
 #> [[5]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 4--5 5--6
 #> 
 #> [[6]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 5--6 6--7
 #> 
 #> [[7]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 6--7 7--8
 #> 
 #> [[8]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 7--8 8--9
 #> 
 #> [[9]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 8-- 9 9--10
 #> 
 #> [[10]]
-#> + 2/10 edges from b745131:
+#> + 2/10 edges from 946a98b:
 #> [1] 1--10 9--10
 #> 
 
diff --git a/reference/as_adjacency_matrix.html b/reference/as_adjacency_matrix.html
index 6fcf6362ea..9aa8536569 100644
--- a/reference/as_adjacency_matrix.html
+++ b/reference/as_adjacency_matrix.html
@@ -41,7 +41,7 @@
 

   

       
Convert a graph to an adjacency matrix

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_adjacency_matrix.Rd

     

 
diff --git a/reference/as_biadjacency_matrix.html b/reference/as_biadjacency_matrix.html
index 3505a2d376..a44c927c21 100644
--- a/reference/as_biadjacency_matrix.html
+++ b/reference/as_biadjacency_matrix.html
@@ -43,7 +43,7 @@
 

   

       
Bipartite adjacency matrix of a bipartite graph

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_biadjacency_matrix.Rd

     

 
diff --git a/reference/as_directed.html b/reference/as_directed.html
index e64474590d..100a9418a7 100644
--- a/reference/as_directed.html
+++ b/reference/as_directed.html
@@ -43,7 +43,7 @@
 

   

       
Convert between directed and undirected graphs

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_directed.Rd

     

 
@@ -163,16 +163,16 @@ 
Examples

 g <- make_ring(10)
 as_directed(g, "mutual")
-#> IGRAPH 3d091ac D--- 10 20 -- Ring graph
+#> IGRAPH 12defe0 D--- 10 20 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 3d091ac:
+#> + edges from 12defe0:
 #>  [1]  1-> 2  2-> 3  3-> 4  4-> 5  5-> 6  6-> 7  7-> 8  8-> 9  9->10  1->10
 #> [11]  2-> 1  3-> 2  4-> 3  5-> 4  6-> 5  7-> 6  8-> 7  9-> 8 10-> 9 10-> 1
 g2 <- make_star(10)
 as_undirected(g)
-#> IGRAPH a01b26f U--- 10 10 -- Ring graph
+#> IGRAPH 436a263 U--- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from a01b26f:
+#> + edges from 436a263:
 #>  [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10
 
 # Combining edge attributes
@@ -180,9 +180,9 @@ 
ExamplesE(g3)$weight <- seq_len(ecount(g3))
 ug3 <- as_undirected(g3)
 print(ug3, e = TRUE)
-#> IGRAPH f823d4f U-W- 10 10 -- Ring graph
+#> IGRAPH 0f4de16 U-W- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), weight (e/n)
-#> + edges from f823d4f:
+#> + edges from 0f4de16:
 #>  [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 1--10 9--10
 if (FALSE) { # rlang::is_interactive()
 x11(width = 10, height = 5)
@@ -202,9 +202,9 @@ 
Examples  edge.attr.comb = list(weight = length)
 )
 print(ug4, e = TRUE)
-#> IGRAPH aed415c U-W- 10 7 -- 
+#> IGRAPH 9f48a5a U-W- 10 7 -- 
 #> + attr: weight (e/n)
-#> + edges from aed415c:
+#> + edges from 9f48a5a:
 #> [1]  6-- 7  7-- 8  8-- 9  8-- 9  9-- 9 10--10 10--10
 
 

diff --git a/reference/as_edgelist.html b/reference/as_edgelist.html
index 831da48c1d..5e2c74a4b1 100644
--- a/reference/as_edgelist.html
+++ b/reference/as_edgelist.html
@@ -41,7 +41,7 @@
 

   

       
Convert a graph to an edge list

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_edgelist.Rd

     

 
diff --git a/reference/as_graphnel.html b/reference/as_graphnel.html
index 2caf626102..edb088454b 100644
--- a/reference/as_graphnel.html
+++ b/reference/as_graphnel.html
@@ -43,7 +43,7 @@
 

   

       
Convert igraph graphs to graphNEL objects from the graph package

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_graphnel.Rd

     

 
@@ -105,10 +105,10 @@ 
ExamplesGNEL <- as_graphnel(g)
 g2 <- graph_from_graphnel(GNEL)
 g2
-#> IGRAPH f4883c3 UNW- 10 10 -- Ring graph
+#> IGRAPH 9d566d6 UNW- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
 #> | (e/n)
-#> + edges from f4883c3 (vertex names):
+#> + edges from 9d566d6 (vertex names):
 #>  [1] a--b a--j b--c c--d d--e e--f f--g g--h h--i i--j
 
 ## Directed
@@ -117,9 +117,9 @@ 
ExamplesGNEL2 <- as_graphnel(g3)
 g4 <- graph_from_graphnel(GNEL2)
 g4
-#> IGRAPH 7f6bf4b DNW- 10 9 -- In-star
+#> IGRAPH c653244 DNW- 10 9 -- In-star
 #> + attr: name (g/c), mode (g/c), center (g/n), name (v/c), weight (e/n)
-#> + edges from 7f6bf4b (vertex names):
+#> + edges from c653244 (vertex names):
 #> [1] b->a c->a d->a e->a f->a g->a h->a i->a j->a
 

     
diff --git a/reference/as_ids.html b/reference/as_ids.html
index 7506658679..ea7a66a830 100644
--- a/reference/as_ids.html
+++ b/reference/as_ids.html
@@ -39,7 +39,7 @@
 

   

       
Convert a vertex or edge sequence to an ordinary vector

-      Source: R/iterators.R
+      Source: R/iterators.R
       
as_ids.Rd

     

 
diff --git a/reference/as_incidence_matrix.html b/reference/as_incidence_matrix.html
index dcaec34774..2e08c22a2e 100644
--- a/reference/as_incidence_matrix.html
+++ b/reference/as_incidence_matrix.html
@@ -43,7 +43,7 @@
 

   

       
As incidence matrix

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_incidence_matrix.Rd

     

 
diff --git a/reference/as_long_data_frame.html b/reference/as_long_data_frame.html
index 1a75b67287..4fbc3be2c8 100644
--- a/reference/as_long_data_frame.html
+++ b/reference/as_long_data_frame.html
@@ -53,7 +53,7 @@
 

   

       
Convert a graph to a long data frame

-      Source: R/conversion.R
+      Source: R/conversion.R
       
as_long_data_frame.Rd

     

 
diff --git a/reference/as_membership.html b/reference/as_membership.html
index 2b7d6c1d4a..c97ebe3876 100644
--- a/reference/as_membership.html
+++ b/reference/as_membership.html
@@ -43,7 +43,7 @@
 

   

       
Declare a numeric vector as a membership vector

-      Source: R/community.R
+      Source: R/community.R
       
as_membership.Rd

     

 
diff --git a/reference/as_phylo.html b/reference/as_phylo.html
index f50c28d447..62ed8e41fd 100644
--- a/reference/as_phylo.html
+++ b/reference/as_phylo.html
@@ -43,7 +43,7 @@
 

   

       
as_phylo

-      Source: R/as_phylo.R
+      Source: R/as_phylo.R
       
as_phylo.Rd

     

 
diff --git a/reference/assortativity.degree.html b/reference/assortativity.degree.html
index 985d7b9ea7..0458cae5ea 100644
--- a/reference/assortativity.degree.html
+++ b/reference/assortativity.degree.html
@@ -43,7 +43,7 @@
 

   

       
Assortativity coefficient

-      Source: R/assortativity.R
+      Source: R/assortativity.R
       
assortativity.degree.Rd

     

 
diff --git a/reference/assortativity.html b/reference/assortativity.html
index de2078d156..737c28980b 100644
--- a/reference/assortativity.html
+++ b/reference/assortativity.html
@@ -41,7 +41,7 @@
 

   

       
Assortativity coefficient

-      Source: R/assortativity.R
+      Source: R/assortativity.R
       
assortativity.Rd

     

 
diff --git a/reference/assortativity.nominal.html b/reference/assortativity.nominal.html
index 53445cbf7f..5b5432b7f6 100644
--- a/reference/assortativity.nominal.html
+++ b/reference/assortativity.nominal.html
@@ -43,7 +43,7 @@
 

   

       
Assortativity coefficient

-      Source: R/assortativity.R
+      Source: R/assortativity.R
       
assortativity.nominal.Rd

     

 
diff --git a/reference/asymmetric.preference.game.html b/reference/asymmetric.preference.game.html
index f6f6a523d1..e640a3acda 100644
--- a/reference/asymmetric.preference.game.html
+++ b/reference/asymmetric.preference.game.html
@@ -43,7 +43,7 @@
 

   

       
Trait-based random generation

-      Source: R/games.R
+      Source: R/games.R
       
asymmetric.preference.game.Rd

     

 
diff --git a/reference/authority.score.html b/reference/authority.score.html
index 3a1336dd68..9d8cd5b141 100644
--- a/reference/authority.score.html
+++ b/reference/authority.score.html
@@ -43,7 +43,7 @@
 

   

       
Kleinberg's hub and authority centrality scores.

-      Source: R/centrality.R
+      Source: R/centrality.R
       
authority.score.Rd

     

 
diff --git a/reference/autocurve.edges.html b/reference/autocurve.edges.html
index 640f85123a..535df57c84 100644
--- a/reference/autocurve.edges.html
+++ b/reference/autocurve.edges.html
@@ -43,7 +43,7 @@
 

   

       
Optimal edge curvature when plotting graphs

-      Source: R/plot.common.R
+      Source: R/plot.common.R
       
autocurve.edges.Rd

     

 
diff --git a/reference/automorphism_group.html b/reference/automorphism_group.html
index 81e06df1eb..b165ed9bf2 100644
--- a/reference/automorphism_group.html
+++ b/reference/automorphism_group.html
@@ -39,7 +39,7 @@
 

   

       
Generating set of the automorphism group of a graph

-      Source: R/topology.R
+      Source: R/topology.R
       
automorphism_group.Rd

     

 
@@ -148,11 +148,11 @@ 
Examplesg <- make_ring(10)
 automorphism_group(g)
 #> [[1]]
-#> + 10/10 vertices, from 4658055:
+#> + 10/10 vertices, from bac9814:
 #>  [1]  1 10  9  8  7  6  5  4  3  2
 #> 
 #> [[2]]
-#> + 10/10 vertices, from 4658055:
+#> + 10/10 vertices, from bac9814:
 #>  [1]  2  3  4  5  6  7  8  9 10  1
 #> 
 

diff --git a/reference/automorphisms.html b/reference/automorphisms.html
index 4827b49509..59ce682508 100644
--- a/reference/automorphisms.html
+++ b/reference/automorphisms.html
@@ -43,7 +43,7 @@
 

   

       
Number of automorphisms

-      Source: R/topology.R
+      Source: R/topology.R
       
automorphisms.Rd

     

 
diff --git a/reference/average.path.length.html b/reference/average.path.length.html
index 8254472848..0f38c5b57a 100644
--- a/reference/average.path.length.html
+++ b/reference/average.path.length.html
@@ -43,7 +43,7 @@
 

   

       
Shortest (directed or undirected) paths between vertices

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
average.path.length.Rd

     

 
diff --git a/reference/ba.game.html b/reference/ba.game.html
index 6d208974b7..33515c1760 100644
--- a/reference/ba.game.html
+++ b/reference/ba.game.html
@@ -43,7 +43,7 @@
 

   

       
Generate random graphs using preferential attachment

-      Source: R/games.R
+      Source: R/games.R
       
ba.game.Rd

     

 
diff --git a/reference/barabasi.game.html b/reference/barabasi.game.html
index f595281578..c5dfcaf3d5 100644
--- a/reference/barabasi.game.html
+++ b/reference/barabasi.game.html
@@ -43,7 +43,7 @@
 

   

       
Generate random graphs using preferential attachment

-      Source: R/games.R
+      Source: R/games.R
       
barabasi.game.Rd

     

 
diff --git a/reference/betweenness.html b/reference/betweenness.html
index 036884e59a..e511370849 100644
--- a/reference/betweenness.html
+++ b/reference/betweenness.html
@@ -41,7 +41,7 @@
 

   

       
Vertex and edge betweenness centrality

-      Source: R/centrality.R
+      Source: R/centrality.R
       
betweenness.Rd

     

 
diff --git a/reference/bfs.html b/reference/bfs.html
index 0f4bf7c0eb..8a461426e2 100644
--- a/reference/bfs.html
+++ b/reference/bfs.html
@@ -41,7 +41,7 @@
 

   

       
Breadth-first search

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
bfs.Rd

     

 
@@ -261,22 +261,22 @@ 
Examples#> [1] "out"
 #> 
 #> $order
-#> + 20/20 vertices, from d7858f8:
+#> + 20/20 vertices, from 6abccf9:
 #>  [1]  1  2 10  3  9  4  8  5  7  6 11 12 20 13 19 14 18 15 17 16
 #> 
 #> $rank
 #>  [1]  1  2  4  6  8 10  9  7  5  3 11 12 14 16 18 20 19 17 15 13
 #> 
 #> $father
-#> + 20/20 vertices, from d7858f8:
+#> + 20/20 vertices, from 6abccf9:
 #>  [1] NA  1  2  3  4  5  8  9 10  1 NA 11 12 13 14 15 18 19 20 11
 #> 
 #> $pred
-#> + 20/20 vertices, from d7858f8:
+#> + 20/20 vertices, from 6abccf9:
 #>  [1] NA  1 10  9  8  7  5  4  3  2 NA 11 20 19 18 17 15 14 13 12
 #> 
 #> $succ
-#> + 20/20 vertices, from d7858f8:
+#> + 20/20 vertices, from 6abccf9:
 #>  [1]  2 10  9  8  7 NA  6  5  4  3 12 20 19 18 17 NA 16 15 14 13
 #> 
 #> $dist
@@ -349,7 +349,7 @@ 
Examples#> [1] "out"
 #> 
 #> $order
-#> + 20/20 vertices, from 0013215:
+#> + 20/20 vertices, from 8e041e1:
 #>  [1]  1  2 10  3  9  4  8  5  7  6 11 12 20 13 19 14 18 15 17 16
 #> 
 #> $rank
diff --git a/reference/biconnected.components.html b/reference/biconnected.components.html
index f78fd88f54..8d94becbb9 100644
--- a/reference/biconnected.components.html
+++ b/reference/biconnected.components.html
@@ -43,7 +43,7 @@
 

   

       
Biconnected components

-      Source: R/components.R
+      Source: R/components.R
       
biconnected.components.Rd

     

 
diff --git a/reference/biconnected_components.html b/reference/biconnected_components.html
index 75be49b320..ea93c97936 100644
--- a/reference/biconnected_components.html
+++ b/reference/biconnected_components.html
@@ -39,7 +39,7 @@
 

   

       
Biconnected components

-      Source: R/components.R
+      Source: R/components.R
       
biconnected_components.Rd

     

 
diff --git a/reference/bipartite.mapping.html b/reference/bipartite.mapping.html
index 71652dd0dc..ad4303fb0e 100644
--- a/reference/bipartite.mapping.html
+++ b/reference/bipartite.mapping.html
@@ -43,7 +43,7 @@
 

   

       
Decide whether a graph is bipartite

-      Source: R/bipartite.R
+      Source: R/bipartite.R
       
bipartite.mapping.Rd

     

 
diff --git a/reference/bipartite.projection.html b/reference/bipartite.projection.html
index e6bac7ccc3..3c4dff6688 100644
--- a/reference/bipartite.projection.html
+++ b/reference/bipartite.projection.html
@@ -43,7 +43,7 @@
 

   

       
Project a bipartite graph

-      Source: R/bipartite.R
+      Source: R/bipartite.R
       
bipartite.projection.Rd

     

 
diff --git a/reference/bipartite.projection.size.html b/reference/bipartite.projection.size.html
index f21721b168..757d0c58a2 100644
--- a/reference/bipartite.projection.size.html
+++ b/reference/bipartite.projection.size.html
@@ -43,7 +43,7 @@
 

   

       
Project a bipartite graph

-      Source: R/bipartite.R
+      Source: R/bipartite.R
       
bipartite.projection.size.Rd

     

 
diff --git a/reference/bipartite.random.game.html b/reference/bipartite.random.game.html
index aafe6b7699..8f6df2ef56 100644
--- a/reference/bipartite.random.game.html
+++ b/reference/bipartite.random.game.html
@@ -43,7 +43,7 @@
 

   

       
Bipartite random graphs

-      Source: R/games.R
+      Source: R/games.R
       
bipartite.random.game.Rd

     

 
diff --git a/reference/bipartite_mapping.html b/reference/bipartite_mapping.html
index c794ba90c9..17e76f8346 100644
--- a/reference/bipartite_mapping.html
+++ b/reference/bipartite_mapping.html
@@ -41,7 +41,7 @@
 

   

       
Decide whether a graph is bipartite

-      Source: R/bipartite.R
+      Source: R/bipartite.R
       
bipartite_mapping.Rd

     

 
diff --git a/reference/bipartite_projection.html b/reference/bipartite_projection.html
index a56e59180a..7b46440293 100644
--- a/reference/bipartite_projection.html
+++ b/reference/bipartite_projection.html
@@ -39,7 +39,7 @@
 

   

       
Project a bipartite graph

-      Source: R/bipartite.R
+      Source: R/bipartite.R
       
bipartite_projection.Rd

     

 
@@ -167,15 +167,15 @@ 
Examplesg2$name <- "Event network"
 proj2 <- bipartite_projection(g2)
 print(proj2[[1]], g = TRUE, e = TRUE)
-#> IGRAPH 2c85d65 UNW- 5 6 -- Event network
+#> IGRAPH 5860d42 UNW- 5 6 -- Event network
 #> + attr: name (g/c), name (v/c), weight (e/n)
-#> + edges from 2c85d65 (vertex names):
+#> + edges from 5860d42 (vertex names):
 #> [1] Alice--Bob   Alice--Cecil Alice--Dan   Bob  --Cecil Bob  --Dan  
 #> [6] Cecil--Dan  
 print(proj2[[2]], g = TRUE, e = TRUE)
-#> IGRAPH 7386964 UNW- 3 2 -- Event network
+#> IGRAPH a6d78bb UNW- 3 2 -- Event network
 #> + attr: name (g/c), name (v/c), weight (e/n)
-#> + edges from 7386964 (vertex names):
+#> + edges from a6d78bb (vertex names):
 #> [1] Party --Skiing    Skiing--Badminton
 
 

diff --git a/reference/blockGraphs.html b/reference/blockGraphs.html
index ffc4094392..23e6484c6a 100644
--- a/reference/blockGraphs.html
+++ b/reference/blockGraphs.html
@@ -43,7 +43,7 @@
 

   

       
Calculate Cohesive Blocks

-      Source: R/cohesive.blocks.R
+      Source: R/cohesive.blocks.R
       
blockGraphs.Rd

     

 
diff --git a/reference/bonpow.html b/reference/bonpow.html
index da897a14fc..604607ad6e 100644
--- a/reference/bonpow.html
+++ b/reference/bonpow.html
@@ -43,7 +43,7 @@
 

   

       
Find Bonacich Power Centrality Scores of Network Positions

-      Source: R/centrality.R
+      Source: R/centrality.R
       
bonpow.Rd

     

 
diff --git a/reference/c.igraph.es.html b/reference/c.igraph.es.html
index cc8a573bce..05191dfa57 100644
--- a/reference/c.igraph.es.html
+++ b/reference/c.igraph.es.html
@@ -39,7 +39,7 @@
 

   

       
Concatenate edge sequences

-      Source: R/iterators.R
+      Source: R/iterators.R
       
c.igraph.es.Rd

     

 
@@ -95,7 +95,7 @@ 
See alsoExamples

     
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
 c(E(g)[1], E(g)["A|B"], E(g)[1:4])
-#> + 6/10 edges from 2fbcedf (vertex names):
+#> + 6/10 edges from 801551d (vertex names):
 #> [1] A--B A--B A--B B--C C--D D--E
 

     

diff --git a/reference/c.igraph.vs.html b/reference/c.igraph.vs.html
index 3432948bb6..9165c153e7 100644
--- a/reference/c.igraph.vs.html
+++ b/reference/c.igraph.vs.html
@@ -39,7 +39,7 @@
 

   

       
Concatenate vertex sequences

-      Source: R/iterators.R
+      Source: R/iterators.R
       
c.igraph.vs.Rd

     

 
@@ -95,7 +95,7 @@ 
See alsoExamples

     
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
 c(V(g)[1], V(g)["A"], V(g)[1:4])
-#> + 6/10 vertices, named, from 4da512e:
+#> + 6/10 vertices, named, from 49f6a4d:
 #> [1] A A A B C D
 

     

diff --git a/reference/callaway.traits.game.html b/reference/callaway.traits.game.html
index ee2d3d88cb..43f632b382 100644
--- a/reference/callaway.traits.game.html
+++ b/reference/callaway.traits.game.html
@@ -43,7 +43,7 @@
 

   

       
Graph generation based on different vertex types

-      Source: R/games.R
+      Source: R/games.R
       
callaway.traits.game.Rd

     

 
diff --git a/reference/canonical.permutation.html b/reference/canonical.permutation.html
index c74fdc7313..2dee0c5fa4 100644
--- a/reference/canonical.permutation.html
+++ b/reference/canonical.permutation.html
@@ -43,7 +43,7 @@
 

   

       
Canonical permutation of a graph

-      Source: R/topology.R
+      Source: R/topology.R
       
canonical.permutation.Rd

     

 
diff --git a/reference/canonical_permutation.html b/reference/canonical_permutation.html
index a29f3c6b55..3d5db8897f 100644
--- a/reference/canonical_permutation.html
+++ b/reference/canonical_permutation.html
@@ -41,7 +41,7 @@
 

   

       
Canonical permutation of a graph

-      Source: R/topology.R
+      Source: R/topology.R
       
canonical_permutation.Rd

     

 
diff --git a/reference/categorical_pal.html b/reference/categorical_pal.html
index 15c5101355..83c3cc5d63 100644
--- a/reference/categorical_pal.html
+++ b/reference/categorical_pal.html
@@ -41,7 +41,7 @@
 

   

       
Palette for categories

-      Source: R/palette.R
+      Source: R/palette.R
       
categorical_pal.Rd

     

 
diff --git a/reference/centr_betw.html b/reference/centr_betw.html
index e3078cf017..d6b4613bd6 100644
--- a/reference/centr_betw.html
+++ b/reference/centr_betw.html
@@ -39,7 +39,7 @@
 

   

       
Centralize a graph according to the betweenness of vertices

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centr_betw.Rd

     

 
diff --git a/reference/centr_betw_tmax.html b/reference/centr_betw_tmax.html
index 27efa5025c..f2b7134b6d 100644
--- a/reference/centr_betw_tmax.html
+++ b/reference/centr_betw_tmax.html
@@ -39,7 +39,7 @@
 

   

       
Theoretical maximum for betweenness centralization

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centr_betw_tmax.Rd

     

 
diff --git a/reference/centr_clo.html b/reference/centr_clo.html
index 768b0694a9..78ca259257 100644
--- a/reference/centr_clo.html
+++ b/reference/centr_clo.html
@@ -39,7 +39,7 @@
 

   

       
Centralize a graph according to the closeness of vertices

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centr_clo.Rd

     

 
diff --git a/reference/centr_clo_tmax.html b/reference/centr_clo_tmax.html
index e241551181..26352143d0 100644
--- a/reference/centr_clo_tmax.html
+++ b/reference/centr_clo_tmax.html
@@ -39,7 +39,7 @@
 

   

       
Theoretical maximum for closeness centralization

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centr_clo_tmax.Rd

     

 
diff --git a/reference/centr_degree.html b/reference/centr_degree.html
index 01a6e63663..ed9bd6995b 100644
--- a/reference/centr_degree.html
+++ b/reference/centr_degree.html
@@ -39,7 +39,7 @@
 

   

       
Centralize a graph according to the degrees of vertices

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centr_degree.Rd

     

 
diff --git a/reference/centr_degree_tmax.html b/reference/centr_degree_tmax.html
index e1c06c9880..869fb5010e 100644
--- a/reference/centr_degree_tmax.html
+++ b/reference/centr_degree_tmax.html
@@ -39,7 +39,7 @@
 

   

       
Theoretical maximum for degree centralization

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centr_degree_tmax.Rd

     

 
diff --git a/reference/centr_eigen.html b/reference/centr_eigen.html
index 5d540f8ffa..0e5af04d5a 100644
--- a/reference/centr_eigen.html
+++ b/reference/centr_eigen.html
@@ -39,7 +39,7 @@
 

   

       
Centralize a graph according to the eigenvector centrality of vertices

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centr_eigen.Rd

     

 
diff --git a/reference/centr_eigen_tmax.html b/reference/centr_eigen_tmax.html
index f72e0fe5f1..396d575e3e 100644
--- a/reference/centr_eigen_tmax.html
+++ b/reference/centr_eigen_tmax.html
@@ -39,7 +39,7 @@
 

   

       
Theoretical maximum for eigenvector centralization

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centr_eigen_tmax.Rd

     

 
diff --git a/reference/centralization.betweenness.html b/reference/centralization.betweenness.html
index 38c2411d39..55aea31720 100644
--- a/reference/centralization.betweenness.html
+++ b/reference/centralization.betweenness.html
@@ -43,7 +43,7 @@
 

   

       
Centralize a graph according to the betweenness of vertices

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralization.betweenness.Rd

     

 
diff --git a/reference/centralization.betweenness.tmax.html b/reference/centralization.betweenness.tmax.html
index f183050deb..a921da00ee 100644
--- a/reference/centralization.betweenness.tmax.html
+++ b/reference/centralization.betweenness.tmax.html
@@ -43,7 +43,7 @@
 

   

       
Theoretical maximum for betweenness centralization

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralization.betweenness.tmax.Rd

     

 
diff --git a/reference/centralization.closeness.html b/reference/centralization.closeness.html
index f89b1083ee..493eb7dd7d 100644
--- a/reference/centralization.closeness.html
+++ b/reference/centralization.closeness.html
@@ -43,7 +43,7 @@
 

   

       
Centralize a graph according to the closeness of vertices

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralization.closeness.Rd

     

 
diff --git a/reference/centralization.closeness.tmax.html b/reference/centralization.closeness.tmax.html
index 1564e0bc5e..d86b6acd3b 100644
--- a/reference/centralization.closeness.tmax.html
+++ b/reference/centralization.closeness.tmax.html
@@ -43,7 +43,7 @@
 

   

       
Theoretical maximum for closeness centralization

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralization.closeness.tmax.Rd

     

 
diff --git a/reference/centralization.degree.html b/reference/centralization.degree.html
index 5d1eebfdef..bd4731fcd9 100644
--- a/reference/centralization.degree.html
+++ b/reference/centralization.degree.html
@@ -43,7 +43,7 @@
 

   

       
Centralize a graph according to the degrees of vertices

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralization.degree.Rd

     

 
diff --git a/reference/centralization.degree.tmax.html b/reference/centralization.degree.tmax.html
index f3dccaea04..faa24dc994 100644
--- a/reference/centralization.degree.tmax.html
+++ b/reference/centralization.degree.tmax.html
@@ -43,7 +43,7 @@
 

   

       
Theoretical maximum for degree centralization

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralization.degree.tmax.Rd

     

 
diff --git a/reference/centralization.evcent.html b/reference/centralization.evcent.html
index 8c7f086f1b..aade04a26b 100644
--- a/reference/centralization.evcent.html
+++ b/reference/centralization.evcent.html
@@ -43,7 +43,7 @@
 

   

       
Centralize a graph according to the eigenvector centrality of vertices

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralization.evcent.Rd

     

 
diff --git a/reference/centralization.evcent.tmax.html b/reference/centralization.evcent.tmax.html
index 8ffe94045c..20805b7b14 100644
--- a/reference/centralization.evcent.tmax.html
+++ b/reference/centralization.evcent.tmax.html
@@ -43,7 +43,7 @@
 

   

       
Theoretical maximum for betweenness centralization

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralization.evcent.tmax.Rd

     

 
diff --git a/reference/centralize.html b/reference/centralize.html
index 045b9466c0..d30b5838ca 100644
--- a/reference/centralize.html
+++ b/reference/centralize.html
@@ -41,7 +41,7 @@
 

   

       
Centralization of a graph

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralize.Rd

     

 
diff --git a/reference/centralize.scores.html b/reference/centralize.scores.html
index 66aba64804..20d0f177e9 100644
--- a/reference/centralize.scores.html
+++ b/reference/centralize.scores.html
@@ -43,7 +43,7 @@
 

   

       
Centralization of a graph

-      Source: R/centralization.R
+      Source: R/centralization.R
       
centralize.scores.Rd

     

 
diff --git a/reference/cited.type.game.html b/reference/cited.type.game.html
index 77707cd668..b66da1d90d 100644
--- a/reference/cited.type.game.html
+++ b/reference/cited.type.game.html
@@ -43,7 +43,7 @@
 

   

       
Random citation graphs

-      Source: R/games.R
+      Source: R/games.R
       
cited.type.game.Rd

     

 
diff --git a/reference/citing.cited.type.game.html b/reference/citing.cited.type.game.html
index e205a9528b..a84d6cf7c3 100644
--- a/reference/citing.cited.type.game.html
+++ b/reference/citing.cited.type.game.html
@@ -43,7 +43,7 @@
 

   

       
Random citation graphs

-      Source: R/games.R
+      Source: R/games.R
       
citing.cited.type.game.Rd

     

 
diff --git a/reference/clique.number.html b/reference/clique.number.html
index f271aa0083..dc7e9e213b 100644
--- a/reference/clique.number.html
+++ b/reference/clique.number.html
@@ -43,7 +43,7 @@
 

   

       
Functions to find cliques, i.e. complete subgraphs in a graph

-      Source: R/cliques.R
+      Source: R/cliques.R
       
clique.number.Rd

     

 
diff --git a/reference/cliques.html b/reference/cliques.html
index fa25a382ee..8c9f0daa26 100644
--- a/reference/cliques.html
+++ b/reference/cliques.html
@@ -41,7 +41,7 @@
 

   

       
Functions to find cliques, i.e. complete subgraphs in a graph

-      Source: R/cliques.R
+      Source: R/cliques.R
       
cliques.Rd

     

 
@@ -177,156 +177,156 @@ 
Examples#> [1] 6
 cliques(g, min = 6)
 #> [[1]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  6  7 20 76 87 94
 #> 
 #> [[2]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  7 20 28 53 76 94
 #> 
 #> [[3]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 17 24 50 57 87 93
 #> 
 #> [[4]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 15 31 40 56 63
 #> 
 #> [[5]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 31 40 56 63 97
 #> 
 #> [[6]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 13 68 69 75 97
 #> 
 #> [[7]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 13 56 68 75 97
 #> 
 #> [[8]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 56 63 68 81 82 97
 #> 
 #> [[9]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 15 28 31 66 85 93
 #> 
 #> [[10]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  3 38 50 68 96 99
 #> 
 #> [[11]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 28 72 79 94
 #> 
 #> [[12]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 54 72 79 94
 #> 
 #> [[13]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 63 79 94 97
 #> 
 #> [[14]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 63 77 94 97
 #> 
 #> [[15]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 13 14 33 79 97
 #> 
 #> [[16]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 17 63 77 97
 #> 
 #> [[17]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 14 18 60 63 97
 #> 
 #> [[18]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 17 24 46 57 84 91
 #> 
 #> [[19]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 17 24 46 47 57 91
 #> 
 largest_cliques(g)
 #> [[1]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  3 99 50 96 68 38
 #> 
 #> [[2]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 28 72 79 94
 #> 
 #> [[3]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 54 79 72 94
 #> 
 #> [[4]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 97 17 63 77
 #> 
 #> [[5]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 97 79 13 33
 #> 
 #> [[6]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 97 79 63 94
 #> 
 #> [[7]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  5 14 97 77 94 63
 #> 
 #> [[8]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  6  7 94 87 20 76
 #> 
 #> [[9]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  7 53 94 28 76 20
 #> 
 #> [[10]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 97 13 68 75 56
 #> 
 #> [[11]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 97 13 68 75 69
 #> 
 #> [[12]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 97 63 14 60 18
 #> 
 #> [[13]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 97 63 40 56 31
 #> 
 #> [[14]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1]  8 15 63 56 40 31
 #> 
 #> [[15]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 15 93 31 85 28 66
 #> 
 #> [[16]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 17 93 50 87 57 24
 #> 
 #> [[17]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 17 46 91 57 24 84
 #> 
 #> [[18]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 17 46 91 57 24 47
 #> 
 #> [[19]]
-#> + 6/100 vertices, from 4513421:
+#> + 6/100 vertices, from 3ccd853:
 #> [1] 56 97 82 68 81 63
 #> 
 
@@ -334,567 +334,567 @@ 
Examplesg <- sample_gnp(100, 0.03)
 max_cliques(g)
 #> [[1]]
-#> + 1/100 vertex, from 7d15986:
+#> + 1/100 vertex, from 88a1741:
 #> [1] 49
 #> 
 #> [[2]]
-#> + 1/100 vertex, from 7d15986:
+#> + 1/100 vertex, from 88a1741:
 #> [1] 64
 #> 
 #> [[3]]
-#> + 1/100 vertex, from 7d15986:
+#> + 1/100 vertex, from 88a1741:
 #> [1] 28
 #> 
 #> [[4]]
-#> + 1/100 vertex, from 7d15986:
+#> + 1/100 vertex, from 88a1741:
 #> [1] 27
 #> 
 #> [[5]]
-#> + 1/100 vertex, from 7d15986:
+#> + 1/100 vertex, from 88a1741:
 #> [1] 56
 #> 
 #> [[6]]
-#> + 1/100 vertex, from 7d15986:
+#> + 1/100 vertex, from 88a1741:
 #> [1] 35
 #> 
 #> [[7]]
-#> + 1/100 vertex, from 7d15986:
+#> + 1/100 vertex, from 88a1741:
 #> [1] 4
 #> 
 #> [[8]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 89 80
 #> 
 #> [[9]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 38 57
 #> 
 #> [[10]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 70  1
 #> 
 #> [[11]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 12 31
 #> 
 #> [[12]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 93 22
 #> 
 #> [[13]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 21 63
 #> 
 #> [[14]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 73 50
 #> 
 #> [[15]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 96 31
 #> 
 #> [[16]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 25 23
 #> 
 #> [[17]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 99 94
 #> 
 #> [[18]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 32 75
 #> 
 #> [[19]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 100  39
 #> 
 #> [[20]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 44 16
 #> 
 #> [[21]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 62 61
 #> 
 #> [[22]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 36  2
 #> 
 #> [[23]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 50 87
 #> 
 #> [[24]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 51  3
 #> 
 #> [[25]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 33 85
 #> 
 #> [[26]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 33 65
 #> 
 #> [[27]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 34 98
 #> 
 #> [[28]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 34 58
 #> 
 #> [[29]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 37 88
 #> 
 #> [[30]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 37 85
 #> 
 #> [[31]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 37 65
 #> 
 #> [[32]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 39 72
 #> 
 #> [[33]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 39 57
 #> 
 #> [[34]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 39 46
 #> 
 #> [[35]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 40 66
 #> 
 #> [[36]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 40 61
 #> 
 #> [[37]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 40 60
 #> 
 #> [[38]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 40 31
 #> 
 #> [[39]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 41 82
 #> 
 #> [[40]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 41 18
 #> 
 #> [[41]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 41  8
 #> 
 #> [[42]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 42 79
 #> 
 #> [[43]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 42 76
 #> 
 #> [[44]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 43 97
 #> 
 #> [[45]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 43 74
 #> 
 #> [[46]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 43 58
 #> 
 #> [[47]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 43 46
 #> 
 #> [[48]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 45 30
 #> 
 #> [[49]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 45 10
 #> 
 #> [[50]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 47 19
 #> 
 #> [[51]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 47  9
 #> 
 #> [[52]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 47  6
 #> 
 #> [[53]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 48 29
 #> 
 #> [[54]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 48  5
 #> 
 #> [[55]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 52 95
 #> 
 #> [[56]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 52  6
 #> 
 #> [[57]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 53 87
 #> 
 #> [[58]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 53  9
 #> 
 #> [[59]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 54 69
 #> 
 #> [[60]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 54 24
 #> 
 #> [[61]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 54  8
 #> 
 #> [[62]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 55 78
 #> 
 #> [[63]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 55 67
 #> 
 #> [[64]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 55 26
 #> 
 #> [[65]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 57 80
 #> 
 #> [[66]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 57 69
 #> 
 #> [[67]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 57  3
 #> 
 #> [[68]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 58 90
 #> 
 #> [[69]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 58 79
 #> 
 #> [[70]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 58 59
 #> 
 #> [[71]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 59 85
 #> 
 #> [[72]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 60 86
 #> 
 #> [[73]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 61 80
 #> 
 #> [[74]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 61 75
 #> 
 #> [[75]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 61 23
 #> 
 #> [[76]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 63 78
 #> 
 #> [[77]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 63 77
 #> 
 #> [[78]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 63 19
 #> 
 #> [[79]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 65 20
 #> 
 #> [[80]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 65 16
 #> 
 #> [[81]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 66 15
 #> 
 #> [[82]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 66 13
 #> 
 #> [[83]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 67 30
 #> 
 #> [[84]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 67 16
 #> 
 #> [[85]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 68 92
 #> 
 #> [[86]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 68 85
 #> 
 #> [[87]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 68 24
 #> 
 #> [[88]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 68  2
 #> 
 #> [[89]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 69  7
 #> 
 #> [[90]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 71 87
 #> 
 #> [[91]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 71 13
 #> 
 #> [[92]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 71 11
 #> 
 #> [[93]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 72 88
 #> 
 #> [[94]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 72 78
 #> 
 #> [[95]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 72  9
 #> 
 #> [[96]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 74 84
 #> 
 #> [[97]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 74 26
 #> 
 #> [[98]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 75 90
 #> 
 #> [[99]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 75 26
 #> 
 #> [[100]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 76 87
 #> 
 #> [[101]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 77 90
 #> 
 #> [[102]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 77 87
 #> 
 #> [[103]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 77 29
 #> 
 #> [[104]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 77  9
 #> 
 #> [[105]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 78 92
 #> 
 #> [[106]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 78 13
 #> 
 #> [[107]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 78  7
 #> 
 #> [[108]]
-#> + 3/100 vertices, from 7d15986:
+#> + 3/100 vertices, from 88a1741:
 #> [1] 81 17 84
 #> 
 #> [[109]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 81  5
 #> 
 #> [[110]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 82 86
 #> 
 #> [[111]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 82 19
 #> 
 #> [[112]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 83 22
 #> 
 #> [[113]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 83 13
 #> 
 #> [[114]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 84 97
 #> 
 #> [[115]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 84 24
 #> 
 #> [[116]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 84 22
 #> 
 #> [[117]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 84 14
 #> 
 #> [[118]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 85 26
 #> 
 #> [[119]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 86 92
 #> 
 #> [[120]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 86 90
 #> 
 #> [[121]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 87 15
 #> 
 #> [[122]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 90 94
 #> 
 #> [[123]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 90 22
 #> 
 #> [[124]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 91 14
 #> 
 #> [[125]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 91 13
 #> 
 #> [[126]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 94 98
 #> 
 #> [[127]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 94 17
 #> 
 #> [[128]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 95 26
 #> 
 #> [[129]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 97 23
 #> 
 #> [[130]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 98 23
 #> 
 #> [[131]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 98  5
 #> 
 #> [[132]]
-#> + 3/100 vertices, from 7d15986:
+#> + 3/100 vertices, from 88a1741:
 #> [1]  2 13 26
 #> 
 #> [[133]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1]  3 26
 #> 
 #> [[134]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1]  6 26
 #> 
 #> [[135]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1]  6 14
 #> 
 #> [[136]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 10 31
 #> 
 #> [[137]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 10 11
 #> 
 #> [[138]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 15 30
 #> 
 #> [[139]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 16 26
 #> 
 #> [[140]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 18 20
 #> 
 #> [[141]]
-#> + 2/100 vertices, from 7d15986:
+#> + 2/100 vertices, from 88a1741:
 #> [1] 19 23
 #> 
 

diff --git a/reference/closeness.html b/reference/closeness.html
index 25a59c65cf..a50c0420b2 100644
--- a/reference/closeness.html
+++ b/reference/closeness.html
@@ -41,7 +41,7 @@
 

   

       
Closeness centrality of vertices

-      Source: R/centrality.R
+      Source: R/centrality.R
       
closeness.Rd

     

 
diff --git a/reference/cluster.distribution.html b/reference/cluster.distribution.html
index d0abf8eb50..d7b427a1dc 100644
--- a/reference/cluster.distribution.html
+++ b/reference/cluster.distribution.html
@@ -43,7 +43,7 @@
 

   

       
Connected components of a graph

-      Source: R/components.R
+      Source: R/components.R
       
cluster.distribution.Rd

     

 
diff --git a/reference/cluster_edge_betweenness.html b/reference/cluster_edge_betweenness.html
index 23c9a534ec..50bd602adb 100644
--- a/reference/cluster_edge_betweenness.html
+++ b/reference/cluster_edge_betweenness.html
@@ -43,7 +43,7 @@
 

   

       
Community structure detection based on edge betweenness

-      Source: R/community.R
+      Source: R/community.R
       
cluster_edge_betweenness.Rd

     

 
diff --git a/reference/cluster_fast_greedy.html b/reference/cluster_fast_greedy.html
index 1d32c5a0ad..84d96c9a47 100644
--- a/reference/cluster_fast_greedy.html
+++ b/reference/cluster_fast_greedy.html
@@ -41,7 +41,7 @@
 

   

       
Community structure via greedy optimization of modularity

-      Source: R/community.R
+      Source: R/community.R
       
cluster_fast_greedy.Rd

     

 
diff --git a/reference/cluster_fluid_communities.html b/reference/cluster_fluid_communities.html
index c5934eab74..a888c4ba32 100644
--- a/reference/cluster_fluid_communities.html
+++ b/reference/cluster_fluid_communities.html
@@ -45,7 +45,7 @@
 

   

       
Community detection algorithm based on interacting fluids

-      Source: R/community.R
+      Source: R/community.R
       
cluster_fluid_communities.Rd

     

 
diff --git a/reference/cluster_infomap.html b/reference/cluster_infomap.html
index 2557b2a9b0..eddd060891 100644
--- a/reference/cluster_infomap.html
+++ b/reference/cluster_infomap.html
@@ -43,7 +43,7 @@
 

   

       
Infomap community finding

-      Source: R/community.R
+      Source: R/community.R
       
cluster_infomap.Rd

     

 
diff --git a/reference/cluster_label_prop.html b/reference/cluster_label_prop.html
index ded1597f72..d466ec84d2 100644
--- a/reference/cluster_label_prop.html
+++ b/reference/cluster_label_prop.html
@@ -45,7 +45,7 @@
 

   

       
Finding communities based on propagating labels

-      Source: R/community.R
+      Source: R/community.R
       
cluster_label_prop.Rd

     

 
diff --git a/reference/cluster_leading_eigen.html b/reference/cluster_leading_eigen.html
index 2a917e072b..dbbe70a142 100644
--- a/reference/cluster_leading_eigen.html
+++ b/reference/cluster_leading_eigen.html
@@ -43,7 +43,7 @@
 

   

       
Community structure detecting based on the leading eigenvector of the community matrix

-      Source: R/community.R
+      Source: R/community.R
       
cluster_leading_eigen.Rd

     

 
diff --git a/reference/cluster_leiden.html b/reference/cluster_leiden.html
index 8517e28e0a..430a4e37b6 100644
--- a/reference/cluster_leiden.html
+++ b/reference/cluster_leiden.html
@@ -47,7 +47,7 @@
 

   

       
Finding community structure of a graph using the Leiden algorithm of Traag, van Eck & Waltman.

-      Source: R/community.R
+      Source: R/community.R
       
cluster_leiden.Rd

     

 
diff --git a/reference/cluster_louvain.html b/reference/cluster_louvain.html
index fd7045893e..0d0a55fecc 100644
--- a/reference/cluster_louvain.html
+++ b/reference/cluster_louvain.html
@@ -43,7 +43,7 @@
 

   

       
Finding community structure by multi-level optimization of modularity

-      Source: R/community.R
+      Source: R/community.R
       
cluster_louvain.Rd

     

 
diff --git a/reference/cluster_optimal.html b/reference/cluster_optimal.html
index dd2009e734..e0195fe7f5 100644
--- a/reference/cluster_optimal.html
+++ b/reference/cluster_optimal.html
@@ -41,7 +41,7 @@
 

   

       
Optimal community structure

-      Source: R/community.R
+      Source: R/community.R
       
cluster_optimal.Rd

     

 
diff --git a/reference/cluster_spinglass.html b/reference/cluster_spinglass.html
index 018a7c14f7..0172328714 100644
--- a/reference/cluster_spinglass.html
+++ b/reference/cluster_spinglass.html
@@ -41,7 +41,7 @@
 

   

       
Finding communities in graphs based on statistical meachanics

-      Source: R/community.R
+      Source: R/community.R
       
cluster_spinglass.Rd

     

 
diff --git a/reference/cluster_walktrap.html b/reference/cluster_walktrap.html
index 68880a845d..8120ed0e7d 100644
--- a/reference/cluster_walktrap.html
+++ b/reference/cluster_walktrap.html
@@ -43,7 +43,7 @@
 

   

       
Community structure via short random walks

-      Source: R/community.R
+      Source: R/community.R
       
cluster_walktrap.Rd

     

 
diff --git a/reference/clusters.html b/reference/clusters.html
index f485757e86..6bfd43f2b7 100644
--- a/reference/clusters.html
+++ b/reference/clusters.html
@@ -43,7 +43,7 @@
 

   

       
Connected components of a graph

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
clusters.Rd

     

 
diff --git a/reference/cocitation.html b/reference/cocitation.html
index 9e2a86f130..80a97aa376 100644
--- a/reference/cocitation.html
+++ b/reference/cocitation.html
@@ -45,7 +45,7 @@
 

   

       
Cocitation coupling

-      Source: R/cocitation.R
+      Source: R/cocitation.R
       
cocitation.Rd

     

 
diff --git a/reference/code.length.html b/reference/code.length.html
index 403d878cfb..7a401103fe 100644
--- a/reference/code.length.html
+++ b/reference/code.length.html
@@ -43,7 +43,7 @@
 

   

       
Functions to deal with the result of network community detection

-      Source: R/community.R
+      Source: R/community.R
       
code.length.Rd

     

 
diff --git a/reference/cohesive.blocks.html b/reference/cohesive.blocks.html
index df664590fc..ee586d7775 100644
--- a/reference/cohesive.blocks.html
+++ b/reference/cohesive.blocks.html
@@ -43,7 +43,7 @@
 

   

       
Calculate Cohesive Blocks

-      Source: R/cohesive.blocks.R
+      Source: R/cohesive.blocks.R
       
cohesive.blocks.Rd

     

 
diff --git a/reference/cohesive_blocks.html b/reference/cohesive_blocks.html
index 7ad83a3151..e9c34d3612 100644
--- a/reference/cohesive_blocks.html
+++ b/reference/cohesive_blocks.html
@@ -39,7 +39,7 @@
 

   

       
Calculate Cohesive Blocks

-      Source: R/cohesive.blocks.R
+      Source: R/cohesive.blocks.R
       
cohesive_blocks.Rd

     

 
@@ -302,23 +302,23 @@ 
Examples#>    '- B-5   c 3, n  4   ......o.oo o......... ... 
 blocks(mwBlocks)
 #> [[1]]
-#> + 23/23 vertices, named, from 90f96bb:
+#> + 23/23 vertices, named, from 9c7f04c:
 #>  [1] 1  2  3  4  5  6  7  21 8  11 14 19 9  10 12 13 16 15 17 18 20 22 23
 #> 
 #> [[2]]
-#> + 14/23 vertices, named, from 90f96bb:
+#> + 14/23 vertices, named, from 9c7f04c:
 #>  [1] 1  2  3  4  5  6  7  21 19 17 18 20 22 23
 #> 
 #> [[3]]
-#> + 10/23 vertices, named, from 90f96bb:
+#> + 10/23 vertices, named, from 9c7f04c:
 #>  [1] 7  8  11 14 9  10 12 13 16 15
 #> 
 #> [[4]]
-#> + 7/23 vertices, named, from 90f96bb:
+#> + 7/23 vertices, named, from 9c7f04c:
 #> [1] 1 2 3 4 5 6 7
 #> 
 #> [[5]]
-#> + 4/23 vertices, named, from 90f96bb:
+#> + 4/23 vertices, named, from 9c7f04c:
 #> [1] 7  8  11 14
 #> 
 cohesion(mwBlocks)
diff --git a/reference/communities.html b/reference/communities.html
index 51a0050f6f..f1c2df0e24 100644
--- a/reference/communities.html
+++ b/reference/communities.html
@@ -43,7 +43,7 @@
 

   

       
Functions to deal with the result of network community detection

-      Source: R/community.R
+      Source: R/community.R
       
communities.Rd

     

 
diff --git a/reference/compare.html b/reference/compare.html
index 391d039f60..789d1b29db 100644
--- a/reference/compare.html
+++ b/reference/compare.html
@@ -39,7 +39,7 @@
 

   

       
Compares community structures using various metrics

-      Source: R/community.R
+      Source: R/community.R
       
compare.Rd

     

 
diff --git a/reference/complementer.html b/reference/complementer.html
index 2c4e2d2a44..ee76892479 100644
--- a/reference/complementer.html
+++ b/reference/complementer.html
@@ -41,7 +41,7 @@
 

   

       
Complementer of a graph

-      Source: R/operators.R
+      Source: R/operators.R
       
complementer.Rd

     

 
@@ -117,9 +117,9 @@ 
Examples## Complementer of a ring
 g <- make_ring(10)
 complementer(g)
-#> IGRAPH a4f9fdb U--- 10 35 -- Ring graph
+#> IGRAPH d0ad064 U--- 10 35 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from a4f9fdb:
+#> + edges from d0ad064:
 #>  [1] 1-- 9 1-- 8 1-- 7 1-- 6 1-- 5 1-- 4 1-- 3 2--10 2-- 9 2-- 8 2-- 7 2-- 6
 #> [13] 2-- 5 2-- 4 3--10 3-- 9 3-- 8 3-- 7 3-- 6 3-- 5 4--10 4-- 9 4-- 8 4-- 7
 #> [25] 4-- 6 5--10 5-- 9 5-- 8 5-- 7 6--10 6-- 9 6-- 8 7--10 7-- 9 8--10
@@ -129,10 +129,10 @@ 
Examplesgc <- complementer(g)
 gu <- union(g, gc)
 gu
-#> IGRAPH a13ee5a U--- 10 45 -- 
+#> IGRAPH 7ed9b8e U--- 10 45 -- 
 #> + attr: name_1 (g/c), name_2 (g/c), mutual_1 (g/l), mutual_2 (g/l),
 #> | circular_1 (g/l), circular_2 (g/l)
-#> + edges from a13ee5a:
+#> + edges from 7ed9b8e:
 #>  [1] 9--10 8--10 8-- 9 7--10 7-- 9 7-- 8 6--10 6-- 9 6-- 8 6-- 7 5--10 5-- 9
 #> [13] 5-- 8 5-- 7 5-- 6 4--10 4-- 9 4-- 8 4-- 7 4-- 6 4-- 5 3--10 3-- 9 3-- 8
 #> [25] 3-- 7 3-- 6 3-- 5 3-- 4 2--10 2-- 9 2-- 8 2-- 7 2-- 6 2-- 5 2-- 4 2-- 3
diff --git a/reference/component_wise.html b/reference/component_wise.html
index 78656a5674..7ae0b6e007 100644
--- a/reference/component_wise.html
+++ b/reference/component_wise.html
@@ -43,7 +43,7 @@
 

   

       
Component-wise layout

-      Source: R/layout.R
+      Source: R/layout.R
       
component_wise.Rd

     

 
diff --git a/reference/components.html b/reference/components.html
index 1e8b39cd0f..27ced16d67 100644
--- a/reference/components.html
+++ b/reference/components.html
@@ -39,7 +39,7 @@
 

   

       
Connected components of a graph

-      Source: R/components.R, R/structural.properties.R
+      Source: R/components.R, R/structural.properties.R
       
components.Rd

     

 
@@ -201,9 +201,9 @@ 
Examples#> [1] 17
 #> 
 largest_component(g)
-#> IGRAPH b73ebb9 U--- 8 7 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 6a18760 U--- 8 7 -- Erdos-Renyi (gnp) graph
 #> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from b73ebb9:
+#> + edges from 6a18760:
 #> [1] 2--3 1--4 4--5 2--6 5--6 6--7 6--8
 

     
diff --git a/reference/compose.html b/reference/compose.html
index 4768767b24..0a11c6585b 100644
--- a/reference/compose.html
+++ b/reference/compose.html
@@ -39,7 +39,7 @@
 

   

       
Compose two graphs as binary relations

-      Source: R/operators.R
+      Source: R/operators.R
       
compose.Rd

     

 
@@ -146,7 +146,7 @@ 
Examplesg2 <- make_star(10, mode = "undirected")
 gc <- compose(g1, g2)
 print_all(gc)
-#> IGRAPH 4971579 U--- 10 36 -- 
+#> IGRAPH 1ad6fe3 U--- 10 36 -- 
 #> + attr: name_1 (g/c), name_2 (g/c), mutual (g/l), circular (g/l), mode
 #> | (g/c), center (g/n)
 #> + edges:
@@ -161,7 +161,7 @@ 
Examples#>  9 --  1  1  2 10
 #> 10 --  1  2  2  3  4  5  6  7  8  9 10 10
 print_all(simplify(gc))
-#> IGRAPH 8a6f9e8 U--- 10 24 -- 
+#> IGRAPH 162a555 U--- 10 24 -- 
 #> + attr: name_1 (g/c), name_2 (g/c), mutual (g/l), circular (g/l), mode
 #> | (g/c), center (g/n)
 #> + edges:
diff --git a/reference/connect.neighborhood.html b/reference/connect.neighborhood.html
index 1cb97b8cdf..d9ac176f1e 100644
--- a/reference/connect.neighborhood.html
+++ b/reference/connect.neighborhood.html
@@ -43,7 +43,7 @@
 

   

       
Neighborhood of graph vertices

-      Source: R/games.R
+      Source: R/games.R
       
connect.neighborhood.Rd

     

 
diff --git a/reference/consensus_tree.html b/reference/consensus_tree.html
index 4e529cdb6e..a00bff731e 100644
--- a/reference/consensus_tree.html
+++ b/reference/consensus_tree.html
@@ -47,7 +47,7 @@
 

   

       
Create a consensus tree from several hierarchical random graph models

-      Source: R/hrg.R
+      Source: R/hrg.R
       
consensus_tree.Rd

     

 
diff --git a/reference/console.html b/reference/console.html
index 9b21201123..0bd36e4379 100644
--- a/reference/console.html
+++ b/reference/console.html
@@ -41,7 +41,7 @@
 

   

       
The igraph console

-      Source: R/console.R
+      Source: R/console.R
       
console.Rd

     

 
diff --git a/reference/constraint.html b/reference/constraint.html
index 301723b185..996284b972 100644
--- a/reference/constraint.html
+++ b/reference/constraint.html
@@ -41,7 +41,7 @@
 

   

       
Burt's constraint

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
constraint.Rd

     

 
diff --git a/reference/contract.html b/reference/contract.html
index 4ed17bdac8..6a33b2b4ab 100644
--- a/reference/contract.html
+++ b/reference/contract.html
@@ -41,7 +41,7 @@
 

   

       
Contract several vertices into a single one

-      Source: R/community.R
+      Source: R/community.R
       
contract.Rd

     

 
@@ -135,10 +135,10 @@ 
Examples## graph and edge attributes are kept, vertex attributes are
 ## combined using the 'toString' function.
 print(g2, g = TRUE, v = TRUE, e = TRUE)
-#> IGRAPH 1cec622 UNW- 5 10 -- Ring
+#> IGRAPH ad99c65 UNW- 5 10 -- Ring
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
 #> | (e/n)
-#> + edges from 1cec622 (vertex names):
+#> + edges from ad99c65 (vertex names):
 #>  [1] a, b--a, b a, b--c, d c, d--c, d c, d--e, f e, f--e, f e, f--g, h
 #>  [7] g, h--g, h g, h--i, j i, j--i, j a, b--i, j
 
diff --git a/reference/contract.vertices.html b/reference/contract.vertices.html
index a13c2a12a8..c5a227ed5f 100644
--- a/reference/contract.vertices.html
+++ b/reference/contract.vertices.html
@@ -43,7 +43,7 @@
 

   

       
Contract several vertices into a single one

-      Source: R/community.R
+      Source: R/community.R
       
contract.vertices.Rd

     

 
diff --git a/reference/convex.hull.html b/reference/convex.hull.html
index da4775bdfa..a711db0e24 100644
--- a/reference/convex.hull.html
+++ b/reference/convex.hull.html
@@ -43,7 +43,7 @@
 

   

       
Convex hull of a set of vertices

-      Source: R/other.R
+      Source: R/other.R
       
convex.hull.Rd

     

 
diff --git a/reference/convex_hull.html b/reference/convex_hull.html
index 143ab8e070..7af77fc477 100644
--- a/reference/convex_hull.html
+++ b/reference/convex_hull.html
@@ -41,7 +41,7 @@
 

   

       
Convex hull of a set of vertices

-      Source: R/other.R
+      Source: R/other.R
       
convex_hull.Rd

     

 
diff --git a/reference/coreness.html b/reference/coreness.html
index 53c45e011c..f09a8e2102 100644
--- a/reference/coreness.html
+++ b/reference/coreness.html
@@ -43,7 +43,7 @@
 

   

       
K-core decomposition of graphs

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
coreness.Rd

     

 
diff --git a/reference/count.multiple.html b/reference/count.multiple.html
index 60f4969d31..0c1e941425 100644
--- a/reference/count.multiple.html
+++ b/reference/count.multiple.html
@@ -43,7 +43,7 @@
 

   

       
Find the multiple or loop edges in a graph

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
count.multiple.Rd

     

 
diff --git a/reference/count_automorphisms.html b/reference/count_automorphisms.html
index 3fa3f0570c..85beeeca13 100644
--- a/reference/count_automorphisms.html
+++ b/reference/count_automorphisms.html
@@ -41,7 +41,7 @@
 

   

       
Number of automorphisms

-      Source: R/topology.R
+      Source: R/topology.R
       
count_automorphisms.Rd

     

 
diff --git a/reference/count_isomorphisms.html b/reference/count_isomorphisms.html
index 77381aa629..4c30a644dd 100644
--- a/reference/count_isomorphisms.html
+++ b/reference/count_isomorphisms.html
@@ -39,7 +39,7 @@
 

   

       
Count the number of isomorphic mappings between two graphs

-      Source: R/topology.R
+      Source: R/topology.R
       
count_isomorphisms.Rd

     

 
diff --git a/reference/count_motifs.html b/reference/count_motifs.html
index c1acd2edf8..60bdbae969 100644
--- a/reference/count_motifs.html
+++ b/reference/count_motifs.html
@@ -41,7 +41,7 @@
 

   

       
Graph motifs

-      Source: R/motifs.R
+      Source: R/motifs.R
       
count_motifs.Rd

     

 
diff --git a/reference/count_subgraph_isomorphisms.html b/reference/count_subgraph_isomorphisms.html
index 8746d05be0..6246f4aa7b 100644
--- a/reference/count_subgraph_isomorphisms.html
+++ b/reference/count_subgraph_isomorphisms.html
@@ -41,7 +41,7 @@
 

   

       
Count the isomorphic mappings between a graph and the subgraphs of another graph

-      Source: R/topology.R
+      Source: R/topology.R
       
count_subgraph_isomorphisms.Rd

     

 
diff --git a/reference/count_triangles.html b/reference/count_triangles.html
index 96cc7a96ac..9459e8959e 100644
--- a/reference/count_triangles.html
+++ b/reference/count_triangles.html
@@ -41,7 +41,7 @@
 

   

       
Find triangles in graphs

-      Source: R/triangles.R
+      Source: R/triangles.R
       
count_triangles.Rd

     

 
diff --git a/reference/create.communities.html b/reference/create.communities.html
index ffe25ea5f9..ad092e1de8 100644
--- a/reference/create.communities.html
+++ b/reference/create.communities.html
@@ -43,7 +43,7 @@
 

   

       
Creates a communities object.

-      Source: R/community.R
+      Source: R/community.R
       
create.communities.Rd

     

 
diff --git a/reference/curve_multiple.html b/reference/curve_multiple.html
index d84d5fd753..9cb6583cd1 100644
--- a/reference/curve_multiple.html
+++ b/reference/curve_multiple.html
@@ -45,7 +45,7 @@
 

   

       
Optimal edge curvature when plotting graphs

-      Source: R/plot.common.R
+      Source: R/plot.common.R
       
curve_multiple.Rd

     

 
diff --git a/reference/cutat.html b/reference/cutat.html
index 9befff7c51..f478fbd999 100644
--- a/reference/cutat.html
+++ b/reference/cutat.html
@@ -43,7 +43,7 @@
 

   

       
Functions to deal with the result of network community detection

-      Source: R/community.R
+      Source: R/community.R
       
cutat.Rd

     

 
diff --git a/reference/decompose.graph.html b/reference/decompose.graph.html
index 4c78961070..de8d4f0191 100644
--- a/reference/decompose.graph.html
+++ b/reference/decompose.graph.html
@@ -43,7 +43,7 @@
 

   

       
Decompose a graph into components

-      Source: R/components.R
+      Source: R/components.R
       
decompose.graph.Rd

     

 
diff --git a/reference/decompose.html b/reference/decompose.html
index 1d9474b23a..72c665b802 100644
--- a/reference/decompose.html
+++ b/reference/decompose.html
@@ -39,7 +39,7 @@
 

   

       
Decompose a graph into components

-      Source: R/components.R
+      Source: R/components.R
       
decompose.Rd

     

 
diff --git a/reference/degree.distribution.html b/reference/degree.distribution.html
index c374608ffb..5106e5771f 100644
--- a/reference/degree.distribution.html
+++ b/reference/degree.distribution.html
@@ -43,7 +43,7 @@
 

   

       
Degree and degree distribution of the vertices

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
degree.distribution.Rd

     

 
diff --git a/reference/degree.html b/reference/degree.html
index 06a15c69ba..3154b9ca58 100644
--- a/reference/degree.html
+++ b/reference/degree.html
@@ -41,7 +41,7 @@
 

   

       
Degree and degree distribution of the vertices

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
degree.Rd

     

 
diff --git a/reference/degree.sequence.game.html b/reference/degree.sequence.game.html
index b0b80d4913..8d53941327 100644
--- a/reference/degree.sequence.game.html
+++ b/reference/degree.sequence.game.html
@@ -43,7 +43,7 @@
 

   

       
Generate random graphs with a given degree sequence

-      Source: R/games.R
+      Source: R/games.R
       
degree.sequence.game.Rd

     

 
diff --git a/reference/delete.edges.html b/reference/delete.edges.html
index 32a4d9de44..3a70cb14e6 100644
--- a/reference/delete.edges.html
+++ b/reference/delete.edges.html
@@ -43,7 +43,7 @@
 

   

       
Delete edges from a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
delete.edges.Rd

     

 
diff --git a/reference/delete.vertices.html b/reference/delete.vertices.html
index a48f318d48..6251205f9f 100644
--- a/reference/delete.vertices.html
+++ b/reference/delete.vertices.html
@@ -43,7 +43,7 @@
 

   

       
Delete vertices from a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
delete.vertices.Rd

     

 
diff --git a/reference/delete_edge_attr.html b/reference/delete_edge_attr.html
index 940d66825f..0155372613 100644
--- a/reference/delete_edge_attr.html
+++ b/reference/delete_edge_attr.html
@@ -39,7 +39,7 @@
 

   

       
Delete an edge attribute

-      Source: R/attributes.R
+      Source: R/attributes.R
       
delete_edge_attr.Rd

     

 
diff --git a/reference/delete_edges.html b/reference/delete_edges.html
index d6722929ad..244ed30994 100644
--- a/reference/delete_edges.html
+++ b/reference/delete_edges.html
@@ -39,7 +39,7 @@
 

   

       
Delete edges from a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
delete_edges.Rd

     

 
@@ -104,25 +104,25 @@ 
Examples
g <- make_ring(10) %>%
   delete_edges(seq(1, 9, by = 2))
 g
-#> IGRAPH cecc4b5 U--- 10 5 -- Ring graph
+#> IGRAPH 11faf9b U--- 10 5 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from cecc4b5:
+#> + edges from 11faf9b:
 #> [1] 2-- 3 4-- 5 6-- 7 8-- 9 1--10
 
 g <- make_ring(10) %>%
   delete_edges("10|1")
 g
-#> IGRAPH f40ed12 U--- 10 9 -- Ring graph
+#> IGRAPH 1055f5a U--- 10 9 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from f40ed12:
+#> + edges from 1055f5a:
 #> [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10
 
 g <- make_ring(5)
 g <- delete_edges(g, get_edge_ids(g, c(1, 5, 4, 5)))
 g
-#> IGRAPH f9af9cb U--- 5 3 -- Ring graph
+#> IGRAPH b591783 U--- 5 3 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from f9af9cb:
+#> + edges from b591783:
 #> [1] 1--2 2--3 3--4
 

     

diff --git a/reference/delete_graph_attr.html b/reference/delete_graph_attr.html
index 5ea94f76ce..f65525a62f 100644
--- a/reference/delete_graph_attr.html
+++ b/reference/delete_graph_attr.html
@@ -39,7 +39,7 @@
 

   

       
Delete a graph attribute

-      Source: R/attributes.R
+      Source: R/attributes.R
       
delete_graph_attr.Rd

     

 
diff --git a/reference/delete_vertex_attr.html b/reference/delete_vertex_attr.html
index f8e1068642..9068c33dd4 100644
--- a/reference/delete_vertex_attr.html
+++ b/reference/delete_vertex_attr.html
@@ -39,7 +39,7 @@
 

   

       
Delete a vertex attribute

-      Source: R/attributes.R
+      Source: R/attributes.R
       
delete_vertex_attr.Rd

     

 
diff --git a/reference/delete_vertices.html b/reference/delete_vertices.html
index 34c9e7e242..6cf4ff1af1 100644
--- a/reference/delete_vertices.html
+++ b/reference/delete_vertices.html
@@ -39,7 +39,7 @@
 

   

       
Delete vertices from a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
delete_vertices.Rd

     

 
@@ -101,23 +101,23 @@ 
Examples
g <- make_ring(10) %>%
   set_vertex_attr("name", value = LETTERS[1:10])
 g
-#> IGRAPH e139cef UN-- 10 10 -- Ring graph
+#> IGRAPH 101907b UN-- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from e139cef (vertex names):
+#> + edges from 101907b (vertex names):
 #>  [1] A--B B--C C--D D--E E--F F--G G--H H--I I--J A--J
 V(g)
-#> + 10/10 vertices, named, from e139cef:
+#> + 10/10 vertices, named, from 101907b:
 #>  [1] A B C D E F G H I J
 
 g2 <- delete_vertices(g, c(1, 5)) %>%
   delete_vertices("B")
 g2
-#> IGRAPH f04a8d2 UN-- 7 5 -- Ring graph
+#> IGRAPH ebaeb1e UN-- 7 5 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from f04a8d2 (vertex names):
+#> + edges from ebaeb1e (vertex names):
 #> [1] C--D F--G G--H H--I I--J
 V(g2)
-#> + 7/7 vertices, named, from f04a8d2:
+#> + 7/7 vertices, named, from ebaeb1e:
 #> [1] C D F G H I J
 

     

diff --git a/reference/dendPlot.html b/reference/dendPlot.html
index fd1d99acdc..da37202046 100644
--- a/reference/dendPlot.html
+++ b/reference/dendPlot.html
@@ -43,7 +43,7 @@
 

   

       
Community structure dendrogram plots

-      Source: R/community.R
+      Source: R/community.R
       
dendPlot.Rd

     

 
diff --git a/reference/dfs.html b/reference/dfs.html
index 8c3eff1a44..971528d06f 100644
--- a/reference/dfs.html
+++ b/reference/dfs.html
@@ -41,7 +41,7 @@
 

   

       
Depth-first search

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
dfs.Rd

     

 
@@ -232,15 +232,15 @@ 
Examples#> [1] "out"
 #> 
 #> $order
-#> + 20/20 vertices, from 6cb8b1c:
+#> + 20/20 vertices, from 00866a5:
 #>  [1]  1  2  4  8  9  5 10  3  6  7 11 12 14 18 19 15 20 13 16 17
 #> 
 #> $order.out
-#> + 20/20 vertices, from 6cb8b1c:
+#> + 20/20 vertices, from 00866a5:
 #>  [1]  8  9  4 10  5  2  6  7  3  1 18 19 14 20 15 12 16 17 13 11
 #> 
 #> $father
-#> + 20/20 vertices, from 6cb8b1c:
+#> + 20/20 vertices, from 00866a5:
 #>  [1] NA  1  1  2  2  3  3  4  4  5 NA 11 11 12 12 13 13 14 14 15
 #> 
 #> $dist
diff --git a/reference/diameter.html b/reference/diameter.html
index c01b5255ea..50948b7ad2 100644
--- a/reference/diameter.html
+++ b/reference/diameter.html
@@ -39,7 +39,7 @@
 

   

       
Diameter of a graph

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
diameter.Rd

     

 
@@ -131,12 +131,12 @@ 
Examplesdiameter(g)
 #> [1] 27
 get_diameter(g)
-#> + 5/10 vertices, from 1a8a3b0:
+#> + 5/10 vertices, from 62a4607:
 #> [1]  1 10  9  8  7
 diameter(g, weights = NA)
 #> [1] 5
 get_diameter(g, weights = NA)
-#> + 6/10 vertices, from 1a8a3b0:
+#> + 6/10 vertices, from 62a4607:
 #> [1] 1 2 3 4 5 6
 
 

diff --git a/reference/difference.html b/reference/difference.html
index 10b4a1b04f..eeab6e7e23 100644
--- a/reference/difference.html
+++ b/reference/difference.html
@@ -49,7 +49,7 @@
 

   

       
Difference of two sets

-      Source: R/operators.R
+      Source: R/operators.R
       
difference.Rd

     

 
diff --git a/reference/difference.igraph.es.html b/reference/difference.igraph.es.html
index b53b03cdfa..9b55cf6b1f 100644
--- a/reference/difference.igraph.es.html
+++ b/reference/difference.igraph.es.html
@@ -39,7 +39,7 @@
 

   

       
Difference of edge sequences

-      Source: R/iterators.R
+      Source: R/iterators.R
       
difference.igraph.es.Rd

     

 
@@ -104,7 +104,7 @@ 
See alsoExamples

     
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
 difference(V(g), V(g)[6:10])
-#> + 5/10 vertices, named, from c130ca5:
+#> + 5/10 vertices, named, from 0e208cd:
 #> [1] A B C D E
 

     

diff --git a/reference/difference.igraph.html b/reference/difference.igraph.html
index ff75bd0cf6..ee2874a482 100644
--- a/reference/difference.igraph.html
+++ b/reference/difference.igraph.html
@@ -39,7 +39,7 @@
 

   

       
Difference of graphs

-      Source: R/operators.R
+      Source: R/operators.R
       
difference.igraph.Rd

     

 
@@ -143,7 +143,7 @@ 
ExamplesV(sstar)$name <- letters[c(1, 3, 5, 7, 9, 11)]
 G <- wheel %m% sstar
 print_all(G)
-#> IGRAPH 11b9678 UN-- 11 15 -- 
+#> IGRAPH 76364af UN-- 11 15 -- 
 #> + attr: name_1 (g/c), name_2 (g/c), mutual (g/l), circular (g/l), mode
 #> | (g/c), center (g/n), name (v/c)
 #> + edges (vertex names):
diff --git a/reference/difference.igraph.vs.html b/reference/difference.igraph.vs.html
index 1d6fc1e187..f65e4f73e8 100644
--- a/reference/difference.igraph.vs.html
+++ b/reference/difference.igraph.vs.html
@@ -39,7 +39,7 @@
 

   

       
Difference of vertex sequences

-      Source: R/iterators.R
+      Source: R/iterators.R
       
difference.igraph.vs.Rd

     

 
@@ -104,7 +104,7 @@ 
See alsoExamples

     
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
 difference(V(g), V(g)[6:10])
-#> + 5/10 vertices, named, from a96a1b2:
+#> + 5/10 vertices, named, from 70891e1:
 #> [1] A B C D E
 

     

diff --git a/reference/dim_select.html b/reference/dim_select.html
index aa5deff616..0e67fbc587 100644
--- a/reference/dim_select.html
+++ b/reference/dim_select.html
@@ -41,7 +41,7 @@
 

   

       
Dimensionality selection for singular values using profile likelihood.

-      Source: R/embedding.R
+      Source: R/embedding.R
       
dim_select.Rd

     

 
diff --git a/reference/disjoint_union.html b/reference/disjoint_union.html
index 64b79d85fd..85d495e775 100644
--- a/reference/disjoint_union.html
+++ b/reference/disjoint_union.html
@@ -41,7 +41,7 @@
 

   

       
Disjoint union of graphs

-      Source: R/operators.R
+      Source: R/operators.R
       
disjoint_union.Rd

     

 
@@ -133,10 +133,10 @@ 
Examplesg2 <- make_ring(10)
 V(g2)$name <- letters[11:20]
 print_all(g1 %du% g2)
-#> IGRAPH afb4e01 UN-- 20 19 -- 
+#> IGRAPH 75fb615 UN-- 20 19 -- 
 #> + attr: name_1 (g/c), name_2 (g/c), mode (g/c), center (g/n), mutual
 #> | (g/l), circular (g/l), name (v/c)
-#> + edges from afb4e01 (vertex names):
+#> + edges from 75fb615 (vertex names):
 #>  [1] a--b a--c a--d a--e a--f a--g a--h a--i a--j k--l l--m m--n n--o o--p p--q
 #> [16] q--r r--s s--t k--t
 

diff --git a/reference/distances.html b/reference/distances.html
index 263407890e..7743d81735 100644
--- a/reference/distances.html
+++ b/reference/distances.html
@@ -45,7 +45,7 @@
 

   

       
Shortest (directed or undirected) paths between vertices

-      Source: R/paths.R, R/structural.properties.R
+      Source: R/paths.R, R/structural.properties.R
       
distances.Rd

     

 
@@ -362,43 +362,43 @@ 
Examplesshortest_paths(g, 5)
 #> $vpath
 #> $vpath[[1]]
-#> + 5/10 vertices, from 06bc52c:
+#> + 5/10 vertices, from 82eb50e:
 #> [1] 5 4 3 2 1
 #> 
 #> $vpath[[2]]
-#> + 4/10 vertices, from 06bc52c:
+#> + 4/10 vertices, from 82eb50e:
 #> [1] 5 4 3 2
 #> 
 #> $vpath[[3]]
-#> + 3/10 vertices, from 06bc52c:
+#> + 3/10 vertices, from 82eb50e:
 #> [1] 5 4 3
 #> 
 #> $vpath[[4]]
-#> + 2/10 vertices, from 06bc52c:
+#> + 2/10 vertices, from 82eb50e:
 #> [1] 5 4
 #> 
 #> $vpath[[5]]
-#> + 1/10 vertex, from 06bc52c:
+#> + 1/10 vertex, from 82eb50e:
 #> [1] 5
 #> 
 #> $vpath[[6]]
-#> + 2/10 vertices, from 06bc52c:
+#> + 2/10 vertices, from 82eb50e:
 #> [1] 5 6
 #> 
 #> $vpath[[7]]
-#> + 3/10 vertices, from 06bc52c:
+#> + 3/10 vertices, from 82eb50e:
 #> [1] 5 6 7
 #> 
 #> $vpath[[8]]
-#> + 4/10 vertices, from 06bc52c:
+#> + 4/10 vertices, from 82eb50e:
 #> [1] 5 6 7 8
 #> 
 #> $vpath[[9]]
-#> + 5/10 vertices, from 06bc52c:
+#> + 5/10 vertices, from 82eb50e:
 #> [1] 5 6 7 8 9
 #> 
 #> $vpath[[10]]
-#> + 6/10 vertices, from 06bc52c:
+#> + 6/10 vertices, from 82eb50e:
 #> [1]  5  4  3  2  1 10
 #> 
 #> 
@@ -414,19 +414,19 @@ 
Examplesall_shortest_paths(g, 1, 6:8)
 #> $vpaths
 #> $vpaths[[1]]
-#> + 6/10 vertices, from 06bc52c:
+#> + 6/10 vertices, from 82eb50e:
 #> [1]  1 10  9  8  7  6
 #> 
 #> $vpaths[[2]]
-#> + 6/10 vertices, from 06bc52c:
+#> + 6/10 vertices, from 82eb50e:
 #> [1] 1 2 3 4 5 6
 #> 
 #> $vpaths[[3]]
-#> + 5/10 vertices, from 06bc52c:
+#> + 5/10 vertices, from 82eb50e:
 #> [1]  1 10  9  8  7
 #> 
 #> $vpaths[[4]]
-#> + 4/10 vertices, from 06bc52c:
+#> + 4/10 vertices, from 82eb50e:
 #> [1]  1 10  9  8
 #> 
 #> 
@@ -449,19 +449,19 @@ 
Examples#> 
 #> $res
 #> $res[[1]]
-#> + 6/10 vertices, from 06bc52c:
+#> + 6/10 vertices, from 82eb50e:
 #> [1]  1 10  9  8  7  6
 #> 
 #> $res[[2]]
-#> + 6/10 vertices, from 06bc52c:
+#> + 6/10 vertices, from 82eb50e:
 #> [1] 1 2 3 4 5 6
 #> 
 #> $res[[3]]
-#> + 5/10 vertices, from 06bc52c:
+#> + 5/10 vertices, from 82eb50e:
 #> [1]  1 10  9  8  7
 #> 
 #> $res[[4]]
-#> + 4/10 vertices, from 06bc52c:
+#> + 4/10 vertices, from 82eb50e:
 #> [1]  1 10  9  8
 #> 
 #> 
diff --git a/reference/diverging_pal.html b/reference/diverging_pal.html
index ea7058a752..1303050f64 100644
--- a/reference/diverging_pal.html
+++ b/reference/diverging_pal.html
@@ -41,7 +41,7 @@
 

   

       
Diverging palette

-      Source: R/palette.R
+      Source: R/palette.R
       
diverging_pal.Rd

     

 
diff --git a/reference/diversity.html b/reference/diversity.html
index 3c8c22f1cb..04b8992049 100644
--- a/reference/diversity.html
+++ b/reference/diversity.html
@@ -39,7 +39,7 @@
 

   

       
Graph diversity

-      Source: R/centrality.R
+      Source: R/centrality.R
       
diversity.Rd

     

 
diff --git a/reference/dominator.tree.html b/reference/dominator.tree.html
index 4250881101..8d681c5f5d 100644
--- a/reference/dominator.tree.html
+++ b/reference/dominator.tree.html
@@ -43,7 +43,7 @@
 

   

       
Dominator tree

-      Source: R/flow.R
+      Source: R/flow.R
       
dominator.tree.Rd

     

 
diff --git a/reference/dominator_tree.html b/reference/dominator_tree.html
index 0db1849d9c..8bd8a7e1a2 100644
--- a/reference/dominator_tree.html
+++ b/reference/dominator_tree.html
@@ -39,7 +39,7 @@
 

   

       
Dominator tree

-      Source: R/flow.R
+      Source: R/flow.R
       
dominator_tree.Rd

     

 
diff --git a/reference/dot-apply_modifiers.html b/reference/dot-apply_modifiers.html
index ae6036b672..a2610375e6 100644
--- a/reference/dot-apply_modifiers.html
+++ b/reference/dot-apply_modifiers.html
@@ -41,7 +41,7 @@
 

   

       
Applies a set of constructor modifiers to an already constructed graph.

-      Source: R/make.R
+      Source: R/make.R
       
dot-apply_modifiers.Rd

     

 
diff --git a/reference/dot-data.html b/reference/dot-data.html
index 6e2f04a7b1..8f6bde9ff3 100644
--- a/reference/dot-data.html
+++ b/reference/dot-data.html
@@ -71,7 +71,7 @@
 

   

       
.data and .env pronouns

-      Source: R/env-and-data.R
+      Source: R/env-and-data.R
       
dot-data.Rd

     

 
diff --git a/reference/dot-extract_constructor_and_modifiers.html b/reference/dot-extract_constructor_and_modifiers.html
index b4e11c7659..42e8e945b8 100644
--- a/reference/dot-extract_constructor_and_modifiers.html
+++ b/reference/dot-extract_constructor_and_modifiers.html
@@ -41,7 +41,7 @@
 

   

       
Takes an argument list and extracts the constructor specification and constructor modifiers from it.

-      Source: R/make.R
+      Source: R/make.R
       
dot-extract_constructor_and_modifiers.Rd

     

 
diff --git a/reference/dot-igraph.progress.html b/reference/dot-igraph.progress.html
index 9501fa78e3..4985a59854 100644
--- a/reference/dot-igraph.progress.html
+++ b/reference/dot-igraph.progress.html
@@ -39,7 +39,7 @@
 

   

       
igraph progress

-      Source: R/console.R
+      Source: R/console.R
       
dot-igraph.progress.Rd

     

 
diff --git a/reference/dot-igraph.status.html b/reference/dot-igraph.status.html
index 84ab8ca6d7..667abef72c 100644
--- a/reference/dot-igraph.status.html
+++ b/reference/dot-igraph.status.html
@@ -39,7 +39,7 @@
 

   

       
igraph status

-      Source: R/console.R
+      Source: R/console.R
       
dot-igraph.status.Rd

     

 
diff --git a/reference/dyad.census.html b/reference/dyad.census.html
index 87d23aae74..ccd04a6932 100644
--- a/reference/dyad.census.html
+++ b/reference/dyad.census.html
@@ -43,7 +43,7 @@
 

   

       
Dyad census of a graph

-      Source: R/motifs.R
+      Source: R/motifs.R
       
dyad.census.Rd

     

 
diff --git a/reference/dyad_census.html b/reference/dyad_census.html
index 8b63fcdfc4..2358bc0922 100644
--- a/reference/dyad_census.html
+++ b/reference/dyad_census.html
@@ -43,7 +43,7 @@
 

   

       
Dyad census of a graph

-      Source: R/motifs.R
+      Source: R/motifs.R
       
dyad_census.Rd

     

 
diff --git a/reference/each_edge.html b/reference/each_edge.html
index a248e5cd5c..a9283c6746 100644
--- a/reference/each_edge.html
+++ b/reference/each_edge.html
@@ -43,7 +43,7 @@
 

   

       
Rewires the endpoints of the edges of a graph to a random vertex

-      Source: R/rewire.R
+      Source: R/rewire.R
       
each_edge.Rd

     

 
diff --git a/reference/eccentricity.html b/reference/eccentricity.html
index 9cdc8ec3b9..d523251f42 100644
--- a/reference/eccentricity.html
+++ b/reference/eccentricity.html
@@ -41,7 +41,7 @@
 

   

       
Eccentricity of the vertices in a graph

-      Source: R/paths.R
+      Source: R/paths.R
       
eccentricity.Rd

     

 
diff --git a/reference/edge.betweenness.community.html b/reference/edge.betweenness.community.html
index 719e435786..91c09b7bce 100644
--- a/reference/edge.betweenness.community.html
+++ b/reference/edge.betweenness.community.html
@@ -43,7 +43,7 @@
 

   

       
Community structure detection based on edge betweenness

-      Source: R/community.R
+      Source: R/community.R
       
edge.betweenness.community.Rd

     

 
diff --git a/reference/edge.betweenness.html b/reference/edge.betweenness.html
index 3686fa7dce..ca08ec1437 100644
--- a/reference/edge.betweenness.html
+++ b/reference/edge.betweenness.html
@@ -43,7 +43,7 @@
 

   

       
Vertex and edge betweenness centrality

-      Source: R/centrality.R
+      Source: R/centrality.R
       
edge.betweenness.Rd

     

 
diff --git a/reference/edge.connectivity.html b/reference/edge.connectivity.html
index 81b299f013..cc13404859 100644
--- a/reference/edge.connectivity.html
+++ b/reference/edge.connectivity.html
@@ -43,7 +43,7 @@
 

   

       
Edge connectivity

-      Source: R/flow.R
+      Source: R/flow.R
       
edge.connectivity.Rd

     

 
diff --git a/reference/edge.disjoint.paths.html b/reference/edge.disjoint.paths.html
index 9e1ddc17ff..2189cc9c7b 100644
--- a/reference/edge.disjoint.paths.html
+++ b/reference/edge.disjoint.paths.html
@@ -43,7 +43,7 @@
 

   

       
Edge connectivity

-      Source: R/flow.R
+      Source: R/flow.R
       
edge.disjoint.paths.Rd

     

 
diff --git a/reference/edge.html b/reference/edge.html
index 2cb39650ce..0a69f8b4fb 100644
--- a/reference/edge.html
+++ b/reference/edge.html
@@ -41,7 +41,7 @@
 

   

       
Helper function for adding and deleting edges

-      Source: R/operators.R
+      Source: R/operators.R
       
edge.Rd

     

 
@@ -120,7 +120,7 @@ 
Examples  edge("8|9")
 
 E(g)[[]]
-#> + 11/11 edges from 6b3d5ad:
+#> + 11/11 edges from 8fca84b:
 #>    tail head tid hid color
 #> 1     1    2   1   2   red
 #> 2     2    3   2   3   red
diff --git a/reference/edge_attr-set.html b/reference/edge_attr-set.html
index 751b2b12a8..04433f1e80 100644
--- a/reference/edge_attr-set.html
+++ b/reference/edge_attr-set.html
@@ -39,7 +39,7 @@
 

   

       
Set one or more edge attributes

-      Source: R/attributes.R
+      Source: R/attributes.R
       
edge_attr-set.Rd

     

 
@@ -111,10 +111,10 @@ 
Examples)
 edge_attr(g, "label") <- E(g)$name
 g
-#> IGRAPH e79883b U--- 10 10 -- Ring graph
+#> IGRAPH 3c5691c U--- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (e/c), color
 #> | (e/c), label (e/c)
-#> + edges from e79883b:
+#> + edges from 3c5691c:
 #>  [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10
 plot(g)
 
diff --git a/reference/edge_attr.html b/reference/edge_attr.html
index 0e5de30438..ee5c57b109 100644
--- a/reference/edge_attr.html
+++ b/reference/edge_attr.html
@@ -39,7 +39,7 @@
 

   

       
Query edge attributes of a graph

-      Source: R/attributes.R
+      Source: R/attributes.R
       
edge_attr.Rd

     

 
@@ -103,10 +103,10 @@ 
Examples  set_edge_attr("weight", value = 1:10) %>%
   set_edge_attr("color", value = "red")
 g
-#> IGRAPH e8d8654 U-W- 10 10 -- Ring graph
+#> IGRAPH 3b116c8 U-W- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), weight (e/n), color
 #> | (e/c)
-#> + edges from e8d8654:
+#> + edges from 3b116c8:
 #>  [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10
 plot(g, edge.width = E(g)$weight)
 
diff --git a/reference/edge_attr_names.html b/reference/edge_attr_names.html
index 3d9e22fa78..e3f32ae361 100644
--- a/reference/edge_attr_names.html
+++ b/reference/edge_attr_names.html
@@ -39,7 +39,7 @@
 

   

       
List names of edge attributes

-      Source: R/attributes.R
+      Source: R/attributes.R
       
edge_attr_names.Rd

     

 
diff --git a/reference/edge_connectivity.html b/reference/edge_connectivity.html
index 659a168e24..4dc6bc2f51 100644
--- a/reference/edge_connectivity.html
+++ b/reference/edge_connectivity.html
@@ -41,7 +41,7 @@
 

   

       
Edge connectivity

-      Source: R/flow.R
+      Source: R/flow.R
       
edge_connectivity.Rd

     

 
diff --git a/reference/edge_density.html b/reference/edge_density.html
index 9b3c5f72ec..bbf13f13c6 100644
--- a/reference/edge_density.html
+++ b/reference/edge_density.html
@@ -43,7 +43,7 @@
 

   

       
Graph density

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
edge_density.Rd

     

 
diff --git a/reference/ego.html b/reference/ego.html
index 8b13855aeb..867d0aa145 100644
--- a/reference/ego.html
+++ b/reference/ego.html
@@ -49,7 +49,7 @@
 

   

       
Neighborhood of graph vertices

-      Source: R/games.R, R/structural.properties.R
+      Source: R/games.R, R/structural.properties.R
       
ego.Rd

     

 
@@ -250,82 +250,82 @@ 
Examples
 ego(g, order = 0, 1:3)
 #> [[1]]
-#> + 1/10 vertex, from a14006d:
+#> + 1/10 vertex, from 457db9c:
 #> [1] 1
 #> 
 #> [[2]]
-#> + 1/10 vertex, from a14006d:
+#> + 1/10 vertex, from 457db9c:
 #> [1] 2
 #> 
 #> [[3]]
-#> + 1/10 vertex, from a14006d:
+#> + 1/10 vertex, from 457db9c:
 #> [1] 3
 #> 
 ego(g, order = 1, 1:3)
 #> [[1]]
-#> + 3/10 vertices, from a14006d:
+#> + 3/10 vertices, from 457db9c:
 #> [1]  1  2 10
 #> 
 #> [[2]]
-#> + 3/10 vertices, from a14006d:
+#> + 3/10 vertices, from 457db9c:
 #> [1] 2 1 3
 #> 
 #> [[3]]
-#> + 3/10 vertices, from a14006d:
+#> + 3/10 vertices, from 457db9c:
 #> [1] 3 2 4
 #> 
 ego(g, order = 2, 1:3)
 #> [[1]]
-#> + 5/10 vertices, from a14006d:
+#> + 5/10 vertices, from 457db9c:
 #> [1]  1  2 10  3  9
 #> 
 #> [[2]]
-#> + 5/10 vertices, from a14006d:
+#> + 5/10 vertices, from 457db9c:
 #> [1]  2  1  3 10  4
 #> 
 #> [[3]]
-#> + 5/10 vertices, from a14006d:
+#> + 5/10 vertices, from 457db9c:
 #> [1] 3 2 4 1 5
 #> 
 
 # neighborhood() is an alias of ego()
 neighborhood(g, order = 0, 1:3)
 #> [[1]]
-#> + 1/10 vertex, from a14006d:
+#> + 1/10 vertex, from 457db9c:
 #> [1] 1
 #> 
 #> [[2]]
-#> + 1/10 vertex, from a14006d:
+#> + 1/10 vertex, from 457db9c:
 #> [1] 2
 #> 
 #> [[3]]
-#> + 1/10 vertex, from a14006d:
+#> + 1/10 vertex, from 457db9c:
 #> [1] 3
 #> 
 neighborhood(g, order = 1, 1:3)
 #> [[1]]
-#> + 3/10 vertices, from a14006d:
+#> + 3/10 vertices, from 457db9c:
 #> [1]  1  2 10
 #> 
 #> [[2]]
-#> + 3/10 vertices, from a14006d:
+#> + 3/10 vertices, from 457db9c:
 #> [1] 2 1 3
 #> 
 #> [[3]]
-#> + 3/10 vertices, from a14006d:
+#> + 3/10 vertices, from 457db9c:
 #> [1] 3 2 4
 #> 
 neighborhood(g, order = 2, 1:3)
 #> [[1]]
-#> + 5/10 vertices, from a14006d:
+#> + 5/10 vertices, from 457db9c:
 #> [1]  1  2 10  3  9
 #> 
 #> [[2]]
-#> + 5/10 vertices, from a14006d:
+#> + 5/10 vertices, from 457db9c:
 #> [1]  2  1  3 10  4
 #> 
 #> [[3]]
-#> + 5/10 vertices, from a14006d:
+#> + 5/10 vertices, from 457db9c:
 #> [1] 3 2 4 1 5
 #> 
 
@@ -333,41 +333,41 @@ 
ExamplesV(g)$name <- c("a", "b", "c", "d", "e", "f", "g", "h", "i", "j")
 make_ego_graph(g, order = 2, 1:3)
 #> [[1]]
-#> IGRAPH 45bbddb UN-- 5 4 -- Ring graph
+#> IGRAPH 98536d1 UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 45bbddb (vertex names):
+#> + edges from 98536d1 (vertex names):
 #> [1] a--b b--c a--j i--j
 #> 
 #> [[2]]
-#> IGRAPH 4785de9 UN-- 5 4 -- Ring graph
+#> IGRAPH 8e7bbf3 UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 4785de9 (vertex names):
+#> + edges from 8e7bbf3 (vertex names):
 #> [1] a--b b--c c--d a--j
 #> 
 #> [[3]]
-#> IGRAPH 8c27b14 UN-- 5 4 -- Ring graph
+#> IGRAPH 6cfd180 UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 8c27b14 (vertex names):
+#> + edges from 6cfd180 (vertex names):
 #> [1] a--b b--c c--d d--e
 #> 
 # make_neighborhood_graph() is an alias of make_ego_graph()
 make_neighborhood_graph(g, order = 2, 1:3)
 #> [[1]]
-#> IGRAPH 562fe8d UN-- 5 4 -- Ring graph
+#> IGRAPH 31baa30 UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 562fe8d (vertex names):
+#> + edges from 31baa30 (vertex names):
 #> [1] a--b b--c a--j i--j
 #> 
 #> [[2]]
-#> IGRAPH 881ae74 UN-- 5 4 -- Ring graph
+#> IGRAPH d794e7c UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 881ae74 (vertex names):
+#> + edges from d794e7c (vertex names):
 #> [1] a--b b--c c--d a--j
 #> 
 #> [[3]]
-#> IGRAPH 11c990d UN-- 5 4 -- Ring graph
+#> IGRAPH 1611364 UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 11c990d (vertex names):
+#> + edges from 1611364 (vertex names):
 #> [1] a--b b--c c--d d--e
 #> 
 
diff --git a/reference/eigen_centrality.html b/reference/eigen_centrality.html
index 585f9545d9..de85ac062c 100644
--- a/reference/eigen_centrality.html
+++ b/reference/eigen_centrality.html
@@ -41,7 +41,7 @@
 

   

       
Eigenvector centrality of vertices

-      Source: R/centrality.R
+      Source: R/centrality.R
       
eigen_centrality.Rd

     

 
diff --git a/reference/embed_adjacency_matrix.html b/reference/embed_adjacency_matrix.html
index 61a46e4c5f..a67efca506 100644
--- a/reference/embed_adjacency_matrix.html
+++ b/reference/embed_adjacency_matrix.html
@@ -39,7 +39,7 @@
 

   

       
Spectral Embedding of Adjacency Matrices

-      Source: R/embedding.R
+      Source: R/embedding.R
       
embed_adjacency_matrix.Rd

     

 
diff --git a/reference/embed_laplacian_matrix.html b/reference/embed_laplacian_matrix.html
index 064b053e37..996ae3c0c0 100644
--- a/reference/embed_laplacian_matrix.html
+++ b/reference/embed_laplacian_matrix.html
@@ -39,7 +39,7 @@
 

   

       
Spectral Embedding of the Laplacian of a Graph

-      Source: R/embedding.R
+      Source: R/embedding.R
       
embed_laplacian_matrix.Rd

     

 
diff --git a/reference/ends.html b/reference/ends.html
index 2b380fc7c3..78561a7380 100644
--- a/reference/ends.html
+++ b/reference/ends.html
@@ -39,7 +39,7 @@
 

   

       
Incident vertices of some graph edges

-      Source: R/interface.R
+      Source: R/interface.R
       
ends.Rd

     

 
diff --git a/reference/erdos.renyi.game.html b/reference/erdos.renyi.game.html
index 65778040d3..d24258ab95 100644
--- a/reference/erdos.renyi.game.html
+++ b/reference/erdos.renyi.game.html
@@ -47,7 +47,7 @@
 

   

       
Generate random graphs according to the Erdős-Rényi model

-      Source: R/games.R
+      Source: R/games.R
       
erdos.renyi.game.Rd

     

 
diff --git a/reference/establishment.game.html b/reference/establishment.game.html
index a4ad93cd00..c7eda54344 100644
--- a/reference/establishment.game.html
+++ b/reference/establishment.game.html
@@ -43,7 +43,7 @@
 

   

       
Graph generation based on different vertex types

-      Source: R/games.R
+      Source: R/games.R
       
establishment.game.Rd

     

 
diff --git a/reference/estimate_betweenness.html b/reference/estimate_betweenness.html
index f2600a2f26..0752930122 100644
--- a/reference/estimate_betweenness.html
+++ b/reference/estimate_betweenness.html
@@ -41,7 +41,7 @@
 

   

       
Deprecated version of betweenness()

-      Source: R/centrality.R
+      Source: R/centrality.R
       
estimate_betweenness.Rd

     

 
diff --git a/reference/estimate_closeness.html b/reference/estimate_closeness.html
index 35e19a6f8b..78c45cd21e 100644
--- a/reference/estimate_closeness.html
+++ b/reference/estimate_closeness.html
@@ -41,7 +41,7 @@
 

   

       
Deprecated version of closeness()

-      Source: R/centrality.R
+      Source: R/centrality.R
       
estimate_closeness.Rd

     

 
diff --git a/reference/estimate_edge_betweenness.html b/reference/estimate_edge_betweenness.html
index 1200d1cd11..0c1b9d3c99 100644
--- a/reference/estimate_edge_betweenness.html
+++ b/reference/estimate_edge_betweenness.html
@@ -41,7 +41,7 @@
 

   

       
Deprecated version of edge_betweenness()

-      Source: R/centrality.R
+      Source: R/centrality.R
       
estimate_edge_betweenness.Rd

     

 
diff --git a/reference/evcent.html b/reference/evcent.html
index d4bdbb12a5..acec3b44c8 100644
--- a/reference/evcent.html
+++ b/reference/evcent.html
@@ -43,7 +43,7 @@
 

   

       
Find Eigenvector Centrality Scores of Network Positions

-      Source: R/centrality.R
+      Source: R/centrality.R
       
evcent.Rd

     

 
diff --git a/reference/exportPajek.html b/reference/exportPajek.html
index 0a30a31285..7d32d245e0 100644
--- a/reference/exportPajek.html
+++ b/reference/exportPajek.html
@@ -43,7 +43,7 @@
 

   

       
Calculate Cohesive Blocks

-      Source: R/cohesive.blocks.R
+      Source: R/cohesive.blocks.R
       
exportPajek.Rd

     

 
diff --git a/reference/farthest.nodes.html b/reference/farthest.nodes.html
index 52ad321e70..50d90d9df4 100644
--- a/reference/farthest.nodes.html
+++ b/reference/farthest.nodes.html
@@ -43,7 +43,7 @@
 

   

       
Diameter of a graph

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
farthest.nodes.Rd

     

 
diff --git a/reference/fastgreedy.community.html b/reference/fastgreedy.community.html
index 0894407c04..b5216f8704 100644
--- a/reference/fastgreedy.community.html
+++ b/reference/fastgreedy.community.html
@@ -43,7 +43,7 @@
 

   

       
Community structure via greedy optimization of modularity

-      Source: R/community.R
+      Source: R/community.R
       
fastgreedy.community.Rd

     

 
diff --git a/reference/feedback_arc_set.html b/reference/feedback_arc_set.html
index e8eec72115..5d8d37c3eb 100644
--- a/reference/feedback_arc_set.html
+++ b/reference/feedback_arc_set.html
@@ -41,7 +41,7 @@
 

   

       
Finding a feedback arc set in a graph

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
feedback_arc_set.Rd

     

 
@@ -142,10 +142,10 @@ 
Examples

 g <- sample_gnm(20, 40, directed = TRUE)
 feedback_arc_set(g)
-#> + 6/40 edges from a4f1c96:
+#> + 6/40 edges from 67c4f1b:
 #> [1]  6->15  6->19  9->15 11-> 3 16->10 17-> 5
 feedback_arc_set(g, algo = "approx_eades")
-#> + 6/40 edges from a4f1c96:
+#> + 6/40 edges from 67c4f1b:
 #> [1]  6->15  6->19  9->15 11-> 3 16->10 17-> 5
 

     

diff --git a/reference/fit_hrg.html b/reference/fit_hrg.html
index 98064d3f25..3da96cc919 100644
--- a/reference/fit_hrg.html
+++ b/reference/fit_hrg.html
@@ -49,7 +49,7 @@
 

   

       
Fit a hierarchical random graph model

-      Source: R/hrg.R
+      Source: R/hrg.R
       
fit_hrg.Rd

     

 
diff --git a/reference/fit_power_law.html b/reference/fit_power_law.html
index 82a89715a7..96c2a1e03c 100644
--- a/reference/fit_power_law.html
+++ b/reference/fit_power_law.html
@@ -39,7 +39,7 @@
 

   

       
Fitting a power-law distribution function to discrete data

-      Source: R/fit.R
+      Source: R/fit.R
       
fit_power_law.Rd

     

 
diff --git a/reference/forest.fire.game.html b/reference/forest.fire.game.html
index 846ebc7b10..88ccc84af2 100644
--- a/reference/forest.fire.game.html
+++ b/reference/forest.fire.game.html
@@ -43,7 +43,7 @@
 

   

       
Forest Fire Network Model

-      Source: R/games.R
+      Source: R/games.R
       
forest.fire.game.Rd

     

 
diff --git a/reference/from_incidence_matrix.html b/reference/from_incidence_matrix.html
index 6e4608b2ca..4681059302 100644
--- a/reference/from_incidence_matrix.html
+++ b/reference/from_incidence_matrix.html
@@ -43,7 +43,7 @@
 

   

       
Graph from incidence matrix

-      Source: R/incidence.R
+      Source: R/incidence.R
       
from_incidence_matrix.Rd

     

 
diff --git a/reference/get.adjacency.html b/reference/get.adjacency.html
index 7a18271073..1df1e17a90 100644
--- a/reference/get.adjacency.html
+++ b/reference/get.adjacency.html
@@ -43,7 +43,7 @@
 

   

       
Convert a graph to an adjacency matrix

-      Source: R/conversion.R
+      Source: R/conversion.R
       
get.adjacency.Rd

     

 
diff --git a/reference/get.adjedgelist.html b/reference/get.adjedgelist.html
index 246b3b5b17..1cc2d0d9ce 100644
--- a/reference/get.adjedgelist.html
+++ b/reference/get.adjedgelist.html
@@ -43,7 +43,7 @@
 

   

       
Adjacency lists

-      Source: R/conversion.R
+      Source: R/conversion.R
       
get.adjedgelist.Rd

     

 
diff --git a/reference/get.adjlist.html b/reference/get.adjlist.html
index f6d082995f..077a927b37 100644
--- a/reference/get.adjlist.html
+++ b/reference/get.adjlist.html
@@ -43,7 +43,7 @@
 

   

       
Adjacency lists

-      Source: R/conversion.R
+      Source: R/conversion.R
       
get.adjlist.Rd

     

 
diff --git a/reference/get.all.shortest.paths.html b/reference/get.all.shortest.paths.html
index 7981b4479a..0450f6a00a 100644
--- a/reference/get.all.shortest.paths.html
+++ b/reference/get.all.shortest.paths.html
@@ -43,7 +43,7 @@
 

   

       
Shortest (directed or undirected) paths between vertices

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
get.all.shortest.paths.Rd

     

 
diff --git a/reference/get.data.frame.html b/reference/get.data.frame.html
index 9a704ef040..9ba638bc5b 100644
--- a/reference/get.data.frame.html
+++ b/reference/get.data.frame.html
@@ -43,7 +43,7 @@
 

   

       
Creating igraph graphs from data frames or vice-versa

-      Source: R/conversion.R
+      Source: R/conversion.R
       
get.data.frame.Rd

     

 
diff --git a/reference/get.diameter.html b/reference/get.diameter.html
index d4cae24524..f01074699a 100644
--- a/reference/get.diameter.html
+++ b/reference/get.diameter.html
@@ -43,7 +43,7 @@
 

   

       
Diameter of a graph

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
get.diameter.Rd

     

 
diff --git a/reference/get.edge.attribute.html b/reference/get.edge.attribute.html
index 8f4b8c7ba0..c406858273 100644
--- a/reference/get.edge.attribute.html
+++ b/reference/get.edge.attribute.html
@@ -43,7 +43,7 @@
 

   

       
Query edge attributes of a graph

-      Source: R/attributes.R
+      Source: R/attributes.R
       
get.edge.attribute.Rd

     

 
diff --git a/reference/get.edge.html b/reference/get.edge.html
index 1781d47f71..912003dd33 100644
--- a/reference/get.edge.html
+++ b/reference/get.edge.html
@@ -41,7 +41,7 @@
 

   

       
Incident vertices of some graph edges

-      Source: R/basic.R
+      Source: R/basic.R
       
get.edge.Rd

     

 
diff --git a/reference/get.edge.ids.html b/reference/get.edge.ids.html
index 3df3199cb3..ad56b7de68 100644
--- a/reference/get.edge.ids.html
+++ b/reference/get.edge.ids.html
@@ -43,7 +43,7 @@
 

   

       
Find the edge ids based on the incident vertices of the edges

-      Source: R/interface.R
+      Source: R/interface.R
       
get.edge.ids.Rd

     

 
diff --git a/reference/get.edgelist.html b/reference/get.edgelist.html
index 9e5393dfa6..ca3468f3da 100644
--- a/reference/get.edgelist.html
+++ b/reference/get.edgelist.html
@@ -43,7 +43,7 @@
 

   

       
Convert a graph to an edge list

-      Source: R/conversion.R
+      Source: R/conversion.R
       
get.edgelist.Rd

     

 
diff --git a/reference/get.graph.attribute.html b/reference/get.graph.attribute.html
index f4b4019814..b98cedbbe5 100644
--- a/reference/get.graph.attribute.html
+++ b/reference/get.graph.attribute.html
@@ -43,7 +43,7 @@
 

   

       
Graph attributes of a graph

-      Source: R/attributes.R
+      Source: R/attributes.R
       
get.graph.attribute.Rd

     

 
diff --git a/reference/get.incidence.html b/reference/get.incidence.html
index e812e940a9..d0dfaf17af 100644
--- a/reference/get.incidence.html
+++ b/reference/get.incidence.html
@@ -43,7 +43,7 @@
 

   

       
Bipartite adjacency matrix of a bipartite graph

-      Source: R/conversion.R
+      Source: R/conversion.R
       
get.incidence.Rd

     

 
diff --git a/reference/get.shortest.paths.html b/reference/get.shortest.paths.html
index 011bed0a44..7e548bee03 100644
--- a/reference/get.shortest.paths.html
+++ b/reference/get.shortest.paths.html
@@ -43,7 +43,7 @@
 

   

       
Shortest (directed or undirected) paths between vertices

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
get.shortest.paths.Rd

     

 
diff --git a/reference/get.stochastic.html b/reference/get.stochastic.html
index 459d3af677..300256a9a3 100644
--- a/reference/get.stochastic.html
+++ b/reference/get.stochastic.html
@@ -43,7 +43,7 @@
 

   

       
Stochastic matrix of a graph

-      Source: R/stochastic_matrix.R
+      Source: R/stochastic_matrix.R
       
get.stochastic.Rd

     

 
diff --git a/reference/get.vertex.attribute.html b/reference/get.vertex.attribute.html
index 5b04bad9de..6453d311a6 100644
--- a/reference/get.vertex.attribute.html
+++ b/reference/get.vertex.attribute.html
@@ -43,7 +43,7 @@
 

   

       
Query vertex attributes of a graph

-      Source: R/attributes.R
+      Source: R/attributes.R
       
get.vertex.attribute.Rd

     

 
diff --git a/reference/getIgraphOpt.html b/reference/getIgraphOpt.html
index d413f73572..7df639541a 100644
--- a/reference/getIgraphOpt.html
+++ b/reference/getIgraphOpt.html
@@ -43,7 +43,7 @@
 

   

       
Parameters for the igraph package

-      Source: R/par.R
+      Source: R/par.R
       
getIgraphOpt.Rd

     

 
diff --git a/reference/get_edge_ids.html b/reference/get_edge_ids.html
index 4bf64732ff..f8332a7e5d 100644
--- a/reference/get_edge_ids.html
+++ b/reference/get_edge_ids.html
@@ -43,7 +43,7 @@
 

   

       
Find the edge ids based on the incident vertices of the edges

-      Source: R/interface.R
+      Source: R/interface.R
       
get_edge_ids.Rd

     

 
@@ -125,7 +125,7 @@ 
Examplesg <- make_ring(10)
 ei <- get_edge_ids(g, c(1, 2, 4, 5))
 E(g)[ei]
-#> + 2/10 edges from 2208552:
+#> + 2/10 edges from 3fee68c:
 #> [1] 1--2 4--5
 
 ## non-existant edge
@@ -139,7 +139,7 @@ 
Exampleseis
 #> [1] 5 5
 E(g)[eis]
-#> + 2/5 edges from 369804c:
+#> + 2/5 edges from b94605c:
 #> [1] 1->2 1->2
 
 

diff --git a/reference/girth.html b/reference/girth.html
index 374fda8d09..d9d4dfe8ec 100644
--- a/reference/girth.html
+++ b/reference/girth.html
@@ -39,7 +39,7 @@
 

   

       
Girth of a graph

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
girth.Rd

     

 
@@ -139,7 +139,7 @@ 
Examples#> [1] Inf
 #> 
 #> $circle
-#> + 0/1000 vertices, from 54d9382:
+#> + 0/1000 vertices, from 7184227:
 #> 
 
 # The worst case running time is for a ring
@@ -149,7 +149,7 @@ 
Examples#> [1] 100
 #> 
 #> $circle
-#> + 100/100 vertices, from 64b828c:
+#> + 100/100 vertices, from a414efc:
 #>   [1]  51  52  53  54  55  56  57  58  59  60  61  62  63  64  65  66  67  68
 #>  [19]  69  70  71  72  73  74  75  76  77  78  79  80  81  82  83  84  85  86
 #>  [37]  87  88  89  90  91  92  93  94  95  96  97  98  99 100   1   2   3   4
@@ -165,7 +165,7 @@ 
Examples#> [1] 12
 #> 
 #> $circle
-#> + 12/1000 vertices, from 36abb71:
+#> + 12/1000 vertices, from 6add4cd:
 #>  [1] 903 811 514 822 850 938 125 275 732 518 446 475
 #> 
 
diff --git a/reference/global_efficiency.html b/reference/global_efficiency.html
index 1f57a582ac..216bde3c6a 100644
--- a/reference/global_efficiency.html
+++ b/reference/global_efficiency.html
@@ -43,7 +43,7 @@
 

   

       
Efficiency of a graph

-      Source: R/efficiency.R
+      Source: R/efficiency.R
       
global_efficiency.Rd

     

 
diff --git a/reference/gorder.html b/reference/gorder.html
index 93513c0bf1..c5835f12ce 100644
--- a/reference/gorder.html
+++ b/reference/gorder.html
@@ -39,7 +39,7 @@
 

   

       
Order (number of vertices) of a graph

-      Source: R/interface.R
+      Source: R/interface.R
       
gorder.Rd

     

 
diff --git a/reference/graph.adhesion.html b/reference/graph.adhesion.html
index 855e6531c2..17556b5728 100644
--- a/reference/graph.adhesion.html
+++ b/reference/graph.adhesion.html
@@ -43,7 +43,7 @@
 

   

       
Edge connectivity

-      Source: R/flow.R
+      Source: R/flow.R
       
graph.adhesion.Rd

     

 
diff --git a/reference/graph.adjacency.html b/reference/graph.adjacency.html
index 33f9405776..1b6ac8bfad 100644
--- a/reference/graph.adjacency.html
+++ b/reference/graph.adjacency.html
@@ -43,7 +43,7 @@
 

   

       
Create graphs from adjacency matrices

-      Source: R/adjacency.R
+      Source: R/adjacency.R
       
graph.adjacency.Rd

     

 
diff --git a/reference/graph.adjlist.html b/reference/graph.adjlist.html
index d3a9fb0042..cab65352e1 100644
--- a/reference/graph.adjlist.html
+++ b/reference/graph.adjlist.html
@@ -43,7 +43,7 @@
 

   

       
Create graphs from adjacency lists

-      Source: R/conversion.R
+      Source: R/conversion.R
       
graph.adjlist.Rd

     

 
diff --git a/reference/graph.atlas.html b/reference/graph.atlas.html
index 2e3ab1e792..da5794dfe4 100644
--- a/reference/graph.atlas.html
+++ b/reference/graph.atlas.html
@@ -43,7 +43,7 @@
 

   

       
Create a graph from the Graph Atlas

-      Source: R/make.R
+      Source: R/make.R
       
graph.atlas.Rd

     

 
diff --git a/reference/graph.automorphisms.html b/reference/graph.automorphisms.html
index e4c697f801..c1da8c8ee5 100644
--- a/reference/graph.automorphisms.html
+++ b/reference/graph.automorphisms.html
@@ -43,7 +43,7 @@
 

   

       
Number of automorphisms

-      Source: R/topology.R
+      Source: R/topology.R
       
graph.automorphisms.Rd

     

 
diff --git a/reference/graph.bfs.html b/reference/graph.bfs.html
index 5fdcf41f4d..5b00ca13f2 100644
--- a/reference/graph.bfs.html
+++ b/reference/graph.bfs.html
@@ -43,7 +43,7 @@
 

   

       
Breadth-first search

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
graph.bfs.Rd

     

 
diff --git a/reference/graph.bipartite.html b/reference/graph.bipartite.html
index 34d81fa31e..28609528ae 100644
--- a/reference/graph.bipartite.html
+++ b/reference/graph.bipartite.html
@@ -43,7 +43,7 @@
 

   

       
Create a bipartite graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.bipartite.Rd

     

 
diff --git a/reference/graph.cohesion.html b/reference/graph.cohesion.html
index c94fc18986..c8ef487560 100644
--- a/reference/graph.cohesion.html
+++ b/reference/graph.cohesion.html
@@ -43,7 +43,7 @@
 

   

       
Vertex connectivity

-      Source: R/cohesive.blocks.R
+      Source: R/cohesive.blocks.R
       
graph.cohesion.Rd

     

 
diff --git a/reference/graph.complementer.html b/reference/graph.complementer.html
index 73f2da824b..92372c4a2d 100644
--- a/reference/graph.complementer.html
+++ b/reference/graph.complementer.html
@@ -43,7 +43,7 @@
 

   

       
Complementer of a graph

-      Source: R/operators.R
+      Source: R/operators.R
       
graph.complementer.Rd

     

 
diff --git a/reference/graph.compose.html b/reference/graph.compose.html
index d1fb67ee3a..6d88a0cdc6 100644
--- a/reference/graph.compose.html
+++ b/reference/graph.compose.html
@@ -43,7 +43,7 @@
 

   

       
Compose two graphs as binary relations

-      Source: R/operators.R
+      Source: R/operators.R
       
graph.compose.Rd

     

 
diff --git a/reference/graph.coreness.html b/reference/graph.coreness.html
index 1f56a9563d..f5cb3206e9 100644
--- a/reference/graph.coreness.html
+++ b/reference/graph.coreness.html
@@ -43,7 +43,7 @@
 

   

       
K-core decomposition of graphs

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
graph.coreness.Rd

     

 
diff --git a/reference/graph.data.frame.html b/reference/graph.data.frame.html
index 3b1430b5e9..20e9bf8dfa 100644
--- a/reference/graph.data.frame.html
+++ b/reference/graph.data.frame.html
@@ -43,7 +43,7 @@
 

   

       
Creating igraph graphs from data frames or vice-versa

-      Source: R/data_frame.R
+      Source: R/data_frame.R
       
graph.data.frame.Rd

     

 
diff --git a/reference/graph.de.bruijn.html b/reference/graph.de.bruijn.html
index edeaef9506..66b3c8e2a3 100644
--- a/reference/graph.de.bruijn.html
+++ b/reference/graph.de.bruijn.html
@@ -43,7 +43,7 @@
 

   

       
De Bruijn graphs

-      Source: R/make.R
+      Source: R/make.R
       
graph.de.bruijn.Rd

     

 
diff --git a/reference/graph.density.html b/reference/graph.density.html
index ef8e28a28b..5459dfd4d5 100644
--- a/reference/graph.density.html
+++ b/reference/graph.density.html
@@ -43,7 +43,7 @@
 

   

       
Graph density

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
graph.density.Rd

     

 
diff --git a/reference/graph.dfs.html b/reference/graph.dfs.html
index 1127bad522..96db95ad70 100644
--- a/reference/graph.dfs.html
+++ b/reference/graph.dfs.html
@@ -43,7 +43,7 @@
 

   

       
Depth-first search

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
graph.dfs.Rd

     

 
diff --git a/reference/graph.difference.html b/reference/graph.difference.html
index 014a7401a5..ca429d8611 100644
--- a/reference/graph.difference.html
+++ b/reference/graph.difference.html
@@ -43,7 +43,7 @@
 

   

       
Difference of two sets

-      Source: R/operators.R
+      Source: R/operators.R
       
graph.difference.Rd

     

 
diff --git a/reference/graph.disjoint.union.html b/reference/graph.disjoint.union.html
index d501ef29bd..4c043aa2f2 100644
--- a/reference/graph.disjoint.union.html
+++ b/reference/graph.disjoint.union.html
@@ -43,7 +43,7 @@
 

   

       
Disjoint union of graphs

-      Source: R/operators.R
+      Source: R/operators.R
       
graph.disjoint.union.Rd

     

 
diff --git a/reference/graph.diversity.html b/reference/graph.diversity.html
index 241b1d29f9..7f7b06cce0 100644
--- a/reference/graph.diversity.html
+++ b/reference/graph.diversity.html
@@ -43,7 +43,7 @@
 

   

       
Graph diversity

-      Source: R/centrality.R
+      Source: R/centrality.R
       
graph.diversity.Rd

     

 
diff --git a/reference/graph.edgelist.html b/reference/graph.edgelist.html
index d0f021ec5a..b17a2b52c2 100644
--- a/reference/graph.edgelist.html
+++ b/reference/graph.edgelist.html
@@ -43,7 +43,7 @@
 

   

       
Create a graph from an edge list matrix

-      Source: R/data_frame.R
+      Source: R/data_frame.R
       
graph.edgelist.Rd

     

 
diff --git a/reference/graph.eigen.html b/reference/graph.eigen.html
index f1e83a94b9..eafc182290 100644
--- a/reference/graph.eigen.html
+++ b/reference/graph.eigen.html
@@ -43,7 +43,7 @@
 

   

       
Eigenvalues and eigenvectors of the adjacency matrix of a graph

-      Source: R/centrality.R
+      Source: R/centrality.R
       
graph.eigen.Rd

     

 
diff --git a/reference/graph.empty.html b/reference/graph.empty.html
index 1fdaa969eb..186764a66e 100644
--- a/reference/graph.empty.html
+++ b/reference/graph.empty.html
@@ -43,7 +43,7 @@
 

   

       
A graph with no edges

-      Source: R/make.R
+      Source: R/make.R
       
graph.empty.Rd

     

 
diff --git a/reference/graph.extended.chordal.ring.html b/reference/graph.extended.chordal.ring.html
index 8e63b90403..1ea4bf1c10 100644
--- a/reference/graph.extended.chordal.ring.html
+++ b/reference/graph.extended.chordal.ring.html
@@ -43,7 +43,7 @@
 

   

       
Create an extended chordal ring graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.extended.chordal.ring.Rd

     

 
diff --git a/reference/graph.famous.html b/reference/graph.famous.html
index 9cc892faf6..01b558b238 100644
--- a/reference/graph.famous.html
+++ b/reference/graph.famous.html
@@ -43,7 +43,7 @@
 

   

       
Create an igraph graph from a list of edges, or a notable graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.famous.Rd

     

 
diff --git a/reference/graph.formula.html b/reference/graph.formula.html
index 917449ae0c..66065d70aa 100644
--- a/reference/graph.formula.html
+++ b/reference/graph.formula.html
@@ -43,7 +43,7 @@
 

   

       
Creating (small) graphs via a simple interface

-      Source: R/make.R
+      Source: R/make.R
       
graph.formula.Rd

     

 
diff --git a/reference/graph.full.bipartite.html b/reference/graph.full.bipartite.html
index bf69b5a699..1cc767f105 100644
--- a/reference/graph.full.bipartite.html
+++ b/reference/graph.full.bipartite.html
@@ -43,7 +43,7 @@
 

   

       
Create a full bipartite graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.full.bipartite.Rd

     

 
diff --git a/reference/graph.full.citation.html b/reference/graph.full.citation.html
index 0900943db6..c9ce3fe02a 100644
--- a/reference/graph.full.citation.html
+++ b/reference/graph.full.citation.html
@@ -43,7 +43,7 @@
 

   

       
Create a complete (full) citation graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.full.citation.Rd

     

 
diff --git a/reference/graph.full.html b/reference/graph.full.html
index 414a73f85d..102446115c 100644
--- a/reference/graph.full.html
+++ b/reference/graph.full.html
@@ -43,7 +43,7 @@
 

   

       
Create a full graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.full.Rd

     

 
diff --git a/reference/graph.graphdb.html b/reference/graph.graphdb.html
index 132385d8a2..4c83391716 100644
--- a/reference/graph.graphdb.html
+++ b/reference/graph.graphdb.html
@@ -43,7 +43,7 @@
 

   

       
Load a graph from the graph database for testing graph isomorphism.

-      Source: R/foreign.R
+      Source: R/foreign.R
       
graph.graphdb.Rd

     

 
diff --git a/reference/graph.html b/reference/graph.html
index b324992ad7..d02d27cf79 100644
--- a/reference/graph.html
+++ b/reference/graph.html
@@ -43,7 +43,7 @@
 

   

       
Create an igraph graph from a list of edges, or a notable graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.Rd

     

 
diff --git a/reference/graph.incidence.html b/reference/graph.incidence.html
index 112582151b..d338813451 100644
--- a/reference/graph.incidence.html
+++ b/reference/graph.incidence.html
@@ -43,7 +43,7 @@
 

   

       
Create graphs from a bipartite adjacency matrix

-      Source: R/incidence.R
+      Source: R/incidence.R
       
graph.incidence.Rd

     

 
diff --git a/reference/graph.intersection.html b/reference/graph.intersection.html
index b977a875df..6d24b6c560 100644
--- a/reference/graph.intersection.html
+++ b/reference/graph.intersection.html
@@ -43,7 +43,7 @@
 

   

       
Intersection of two or more sets

-      Source: R/operators.R
+      Source: R/operators.R
       
graph.intersection.Rd

     

 
diff --git a/reference/graph.isocreate.html b/reference/graph.isocreate.html
index a22a8c732b..c6a15304c9 100644
--- a/reference/graph.isocreate.html
+++ b/reference/graph.isocreate.html
@@ -43,7 +43,7 @@
 

   

       
Create a graph from an isomorphism class

-      Source: R/topology.R
+      Source: R/topology.R
       
graph.isocreate.Rd

     

 
diff --git a/reference/graph.kautz.html b/reference/graph.kautz.html
index 2227a04365..4fd737c95c 100644
--- a/reference/graph.kautz.html
+++ b/reference/graph.kautz.html
@@ -43,7 +43,7 @@
 

   

       
Kautz graphs

-      Source: R/make.R
+      Source: R/make.R
       
graph.kautz.Rd

     

 
diff --git a/reference/graph.knn.html b/reference/graph.knn.html
index 70eb289851..9fd277eb15 100644
--- a/reference/graph.knn.html
+++ b/reference/graph.knn.html
@@ -43,7 +43,7 @@
 

   

       
Average nearest neighbor degree

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
graph.knn.Rd

     

 
diff --git a/reference/graph.laplacian.html b/reference/graph.laplacian.html
index 052e1a60b5..220e9ed802 100644
--- a/reference/graph.laplacian.html
+++ b/reference/graph.laplacian.html
@@ -43,7 +43,7 @@
 

   

       
Graph Laplacian

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
graph.laplacian.Rd

     

 
diff --git a/reference/graph.lattice.html b/reference/graph.lattice.html
index d4dd0d70d7..23b5a3908b 100644
--- a/reference/graph.lattice.html
+++ b/reference/graph.lattice.html
@@ -43,7 +43,7 @@
 

   

       
Create a lattice graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.lattice.Rd

     

 
diff --git a/reference/graph.lcf.html b/reference/graph.lcf.html
index 9cee9431b5..2f00edfc53 100644
--- a/reference/graph.lcf.html
+++ b/reference/graph.lcf.html
@@ -43,7 +43,7 @@
 

   

       
Creating a graph from LCF notation

-      Source: R/make.R
+      Source: R/make.R
       
graph.lcf.Rd

     

 
diff --git a/reference/graph.maxflow.html b/reference/graph.maxflow.html
index 4ad13e3a62..28375e0609 100644
--- a/reference/graph.maxflow.html
+++ b/reference/graph.maxflow.html
@@ -43,7 +43,7 @@
 

   

       
Maximum flow in a graph

-      Source: R/flow.R
+      Source: R/flow.R
       
graph.maxflow.Rd

     

 
diff --git a/reference/graph.mincut.html b/reference/graph.mincut.html
index 7b0cbb6a29..a50ed10f00 100644
--- a/reference/graph.mincut.html
+++ b/reference/graph.mincut.html
@@ -43,7 +43,7 @@
 

   

       
Minimum cut in a graph

-      Source: R/flow.R
+      Source: R/flow.R
       
graph.mincut.Rd

     

 
diff --git a/reference/graph.motifs.est.html b/reference/graph.motifs.est.html
index fe82ae9e59..807c19d096 100644
--- a/reference/graph.motifs.est.html
+++ b/reference/graph.motifs.est.html
@@ -43,7 +43,7 @@
 

   

       
Graph motifs

-      Source: R/motifs.R
+      Source: R/motifs.R
       
graph.motifs.est.Rd

     

 
diff --git a/reference/graph.motifs.html b/reference/graph.motifs.html
index 18fa32fd77..8ac5bdcf0d 100644
--- a/reference/graph.motifs.html
+++ b/reference/graph.motifs.html
@@ -43,7 +43,7 @@
 

   

       
Graph motifs

-      Source: R/motifs.R
+      Source: R/motifs.R
       
graph.motifs.Rd

     

 
diff --git a/reference/graph.motifs.no.html b/reference/graph.motifs.no.html
index 6fc6c356f3..f934b4cb61 100644
--- a/reference/graph.motifs.no.html
+++ b/reference/graph.motifs.no.html
@@ -43,7 +43,7 @@
 

   

       
Graph motifs

-      Source: R/motifs.R
+      Source: R/motifs.R
       
graph.motifs.no.Rd

     

 
diff --git a/reference/graph.neighborhood.html b/reference/graph.neighborhood.html
index 332e507604..bf28610105 100644
--- a/reference/graph.neighborhood.html
+++ b/reference/graph.neighborhood.html
@@ -43,7 +43,7 @@
 

   

       
Neighborhood of graph vertices

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
graph.neighborhood.Rd

     

 
diff --git a/reference/graph.ring.html b/reference/graph.ring.html
index b9f8857dbd..0bfbac58db 100644
--- a/reference/graph.ring.html
+++ b/reference/graph.ring.html
@@ -43,7 +43,7 @@
 

   

       
Create a ring graph

-      Source: R/make.R
+      Source: R/make.R
       
graph.ring.Rd

     

 
diff --git a/reference/graph.star.html b/reference/graph.star.html
index 229f1e2b72..3ed18611de 100644
--- a/reference/graph.star.html
+++ b/reference/graph.star.html
@@ -43,7 +43,7 @@
 

   

       
Create a star graph, a tree with n vertices and n - 1 leaves

-      Source: R/make.R
+      Source: R/make.R
       
graph.star.Rd

     

 
diff --git a/reference/graph.strength.html b/reference/graph.strength.html
index ecbc8a290f..f1bde8fdc0 100644
--- a/reference/graph.strength.html
+++ b/reference/graph.strength.html
@@ -43,7 +43,7 @@
 

   

       
Strength or weighted vertex degree

-      Source: R/centrality.R
+      Source: R/centrality.R
       
graph.strength.Rd

     

 
diff --git a/reference/graph.tree.html b/reference/graph.tree.html
index 3ee7a65d06..3179cdd748 100644
--- a/reference/graph.tree.html
+++ b/reference/graph.tree.html
@@ -43,7 +43,7 @@
 

   

       
Create tree graphs

-      Source: R/make.R
+      Source: R/make.R
       
graph.tree.Rd

     

 
diff --git a/reference/graph.union.html b/reference/graph.union.html
index a7541828e2..1f1f5c2fd6 100644
--- a/reference/graph.union.html
+++ b/reference/graph.union.html
@@ -43,7 +43,7 @@
 

   

       
Union of graphs

-      Source: R/operators.R
+      Source: R/operators.R
       
graph.union.Rd

     

 
diff --git a/reference/graph_.html b/reference/graph_.html
index babe6357a9..104c3d8b81 100644
--- a/reference/graph_.html
+++ b/reference/graph_.html
@@ -39,7 +39,7 @@
 

   

       
Convert object to a graph

-      Source: R/make.R
+      Source: R/make.R
       
graph_.Rd

     

 
@@ -72,12 +72,12 @@ 
Examples#> Warning: `graph_()` was deprecated in igraph 2.1.0.
 #> ℹ Please use constructors directly, for instance graph_from_edgelist().
 #> ℹ graph_() will be removed in a future version of igraph.
-#> IGRAPH 829d502 U--- 6 5 -- 
-#> + edges from 829d502:
+#> IGRAPH 2155f72 U--- 6 5 -- 
+#> + edges from 2155f72:
 #> [1] 1--2 2--3 3--4 4--5 5--6
 graph_(cbind(1:5, 2:6), from_edgelist(), directed = FALSE)
-#> IGRAPH df4ff5c U--- 6 5 -- 
-#> + edges from df4ff5c:
+#> IGRAPH 9a8628d U--- 6 5 -- 
+#> + edges from 9a8628d:
 #> [1] 1--2 2--3 3--4 4--5 5--6
 

     
diff --git a/reference/graph_attr-set.html b/reference/graph_attr-set.html
index 30f4c1798b..cb30df3a16 100644
--- a/reference/graph_attr-set.html
+++ b/reference/graph_attr-set.html
@@ -39,7 +39,7 @@
 

   

       
Set all or some graph attributes

-      Source: R/attributes.R
+      Source: R/attributes.R
       
graph_attr-set.Rd

     

 
@@ -101,9 +101,9 @@ 
Examples
g <- make_graph(~ A - B:C:D)
 graph_attr(g, "name") <- "4-star"
 g
-#> IGRAPH a89fb87 UN-- 4 3 -- 4-star
+#> IGRAPH 49eef5e UN-- 4 3 -- 4-star
 #> + attr: name (g/c), name (v/c)
-#> + edges from a89fb87 (vertex names):
+#> + edges from 49eef5e (vertex names):
 #> [1] A--B A--C A--D
 
 graph_attr(g) <- list(
diff --git a/reference/graph_attr.html b/reference/graph_attr.html
index e87ec97b0c..3f5cf434f5 100644
--- a/reference/graph_attr.html
+++ b/reference/graph_attr.html
@@ -39,7 +39,7 @@
 

   

       
Graph attributes of a graph

-      Source: R/attributes.R
+      Source: R/attributes.R
       
graph_attr.Rd

     

 
diff --git a/reference/graph_attr_names.html b/reference/graph_attr_names.html
index b58324b0f5..47e96f7d8b 100644
--- a/reference/graph_attr_names.html
+++ b/reference/graph_attr_names.html
@@ -39,7 +39,7 @@
 

   

       
List names of graph attributes

-      Source: R/attributes.R
+      Source: R/attributes.R
       
graph_attr_names.Rd

     

 
diff --git a/reference/graph_center.html b/reference/graph_center.html
index 49cd49cf18..6764ce6484 100644
--- a/reference/graph_center.html
+++ b/reference/graph_center.html
@@ -41,7 +41,7 @@
 

   

       
Central vertices of a graph

-      Source: R/paths.R
+      Source: R/paths.R
       
graph_center.Rd

     

 
@@ -107,13 +107,13 @@ 
Examples

     
tree <- make_tree(100, 7)
 graph_center(tree)
-#> + 2/100 vertices, from 4bfa0bb:
+#> + 2/100 vertices, from ae189e7:
 #> [1] 1 2
 graph_center(tree, mode = "in")
-#> + 1/100 vertex, from 4bfa0bb:
+#> + 1/100 vertex, from ae189e7:
 #> [1] 1
 graph_center(tree, mode = "out")
-#> + 85/100 vertices, from 4bfa0bb:
+#> + 85/100 vertices, from ae189e7:
 #>  [1]  16  17  18  19  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34
 #> [20]  35  36  37  38  39  40  41  42  43  44  45  46  47  48  49  50  51  52  53
 #> [39]  54  55  56  57  58  59  60  61  62  63  64  65  66  67  68  69  70  71  72
@@ -123,12 +123,12 @@ 
Examples# Without and with weights
 ring <- make_ring(10)
 graph_center(ring)
-#> + 10/10 vertices, from 667d044:
+#> + 10/10 vertices, from 3b0cd95:
 #>  [1]  1  2  3  4  5  6  7  8  9 10
 # Add weights
 E(ring)$weight <- seq_len(ecount(ring))
 graph_center(ring)
-#> + 1/10 vertex, from 667d044:
+#> + 1/10 vertex, from 3b0cd95:
 #> [1] 7
 
 

diff --git a/reference/graph_from_adj_list.html b/reference/graph_from_adj_list.html
index 2da99bc57c..61d51a7060 100644
--- a/reference/graph_from_adj_list.html
+++ b/reference/graph_from_adj_list.html
@@ -43,7 +43,7 @@
 

   

       
Create graphs from adjacency lists

-      Source: R/conversion.R
+      Source: R/conversion.R
       
graph_from_adj_list.Rd

     

 
diff --git a/reference/graph_from_adjacency_matrix.html b/reference/graph_from_adjacency_matrix.html
index ba2c10ade7..c840cc0581 100644
--- a/reference/graph_from_adjacency_matrix.html
+++ b/reference/graph_from_adjacency_matrix.html
@@ -41,7 +41,7 @@
 

   

       
Create graphs from adjacency matrices

-      Source: R/adjacency.R
+      Source: R/adjacency.R
       
graph_from_adjacency_matrix.Rd

     

 
@@ -309,7 +309,7 @@ 
Examples  add.rownames = "code"
 )
 summary(g10)
-#> IGRAPH b62b7a3 DNW- 10 56 -- 
+#> IGRAPH 7fa6e37 DNW- 10 56 -- 
 #> + attr: name (v/c), code (v/c), weight (e/n)
 
 

diff --git a/reference/graph_from_atlas.html b/reference/graph_from_atlas.html
index f62fe90d53..2076a32ef9 100644
--- a/reference/graph_from_atlas.html
+++ b/reference/graph_from_atlas.html
@@ -65,7 +65,7 @@
 

   

       
Create a graph from the Graph Atlas

-      Source: R/make.R
+      Source: R/make.R
       
graph_from_atlas.Rd

     

 
@@ -127,14 +127,14 @@ 
See alsoExamples

     
## Some randomly picked graphs from the atlas
 graph_from_atlas(sample(0:1252, 1))
-#> IGRAPH 20ab1ed U--- 7 11 -- Graph from the Atlas #766
+#> IGRAPH cd46672 U--- 7 11 -- Graph from the Atlas #766
 #> + attr: name (g/c), n (g/n)
-#> + edges from 20ab1ed:
+#> + edges from cd46672:
 #>  [1] 4--5 1--5 1--2 2--3 3--4 1--6 4--6 1--4 2--6 3--6 6--7
 graph_from_atlas(sample(0:1252, 1))
-#> IGRAPH 118e55f U--- 7 12 -- Graph from the Atlas #893
+#> IGRAPH c6048db U--- 7 12 -- Graph from the Atlas #893
 #> + attr: name (g/c), n (g/n)
-#> + edges from 118e55f:
+#> + edges from c6048db:
 #>  [1] 1--2 2--3 3--4 5--6 1--5 2--4 2--5 3--5 1--4 4--6 1--3 2--7
 

     

diff --git a/reference/graph_from_biadjacency_matrix.html b/reference/graph_from_biadjacency_matrix.html
index 2f6e8ae36c..8581703d9a 100644
--- a/reference/graph_from_biadjacency_matrix.html
+++ b/reference/graph_from_biadjacency_matrix.html
@@ -41,7 +41,7 @@
 

   

       
Create graphs from a bipartite adjacency matrix

-      Source: R/incidence.R
+      Source: R/incidence.R
       
graph_from_biadjacency_matrix.Rd

     

 
@@ -150,9 +150,9 @@ 
Examplescolnames(inc) <- letters[1:5]
 rownames(inc) <- LETTERS[1:3]
 graph_from_biadjacency_matrix(inc)
-#> IGRAPH ea86ea9 UN-B 8 9 -- 
+#> IGRAPH 1475a63 UN-B 8 9 -- 
 #> + attr: type (v/l), name (v/c)
-#> + edges from ea86ea9 (vertex names):
+#> + edges from 1475a63 (vertex names):
 #> [1] A--c A--d A--e B--a B--d B--e C--b C--c C--e
 
 

diff --git a/reference/graph_from_data_frame.html b/reference/graph_from_data_frame.html
index 97ce611f51..08d6762a60 100644
--- a/reference/graph_from_data_frame.html
+++ b/reference/graph_from_data_frame.html
@@ -41,7 +41,7 @@
 

   

       
Creating igraph graphs from data frames or vice-versa

-      Source: R/conversion.R, R/data_frame.R
+      Source: R/conversion.R, R/data_frame.R
       
graph_from_data_frame.Rd

     

 
@@ -194,10 +194,10 @@ 
Examples)
 g <- graph_from_data_frame(relations, directed = TRUE, vertices = actors)
 print(g, e = TRUE, v = TRUE)
-#> IGRAPH ef203c1 DN-- 5 6 -- 
+#> IGRAPH 4e7d6ba DN-- 5 6 -- 
 #> + attr: name (v/c), age (v/n), gender (v/c), same.dept (e/l),
 #> | friendship (e/n), advice (e/n)
-#> + edges from ef203c1 (vertex names):
+#> + edges from 4e7d6ba (vertex names):
 #> [1] Bob      ->Alice Cecil    ->Bob   Cecil    ->Alice David    ->Alice
 #> [5] David    ->Bob   Esmeralda->Alice
 
diff --git a/reference/graph_from_edgelist.html b/reference/graph_from_edgelist.html
index 1eb3b50c34..1d8ef2845d 100644
--- a/reference/graph_from_edgelist.html
+++ b/reference/graph_from_edgelist.html
@@ -49,7 +49,7 @@
 

   

       
Create a graph from an edge list matrix

-      Source: R/data_frame.R
+      Source: R/data_frame.R
       
graph_from_edgelist.Rd

     

 
@@ -110,15 +110,15 @@ 
See alsoExamples

     
el <- matrix(c("foo", "bar", "bar", "foobar"), nc = 2, byrow = TRUE)
 graph_from_edgelist(el)
-#> IGRAPH f41a20c DN-- 3 2 -- 
+#> IGRAPH 33507b0 DN-- 3 2 -- 
 #> + attr: name (v/c)
-#> + edges from f41a20c (vertex names):
+#> + edges from 33507b0 (vertex names):
 #> [1] foo->bar    bar->foobar
 
 # Create a ring by hand
 graph_from_edgelist(cbind(1:10, c(2:10, 1)))
-#> IGRAPH 9e4cf2f D--- 10 10 -- 
-#> + edges from 9e4cf2f:
+#> IGRAPH 06c5fbb D--- 10 10 -- 
+#> + edges from 06c5fbb:
 #>  [1]  1-> 2  2-> 3  3-> 4  4-> 5  5-> 6  6-> 7  7-> 8  8-> 9  9->10 10-> 1
 

     

diff --git a/reference/graph_from_graphdb.html b/reference/graph_from_graphdb.html
index 2fd023e8bd..8e08b41c92 100644
--- a/reference/graph_from_graphdb.html
+++ b/reference/graph_from_graphdb.html
@@ -41,7 +41,7 @@
 

   

       
Load a graph from the graph database for testing graph isomorphism.

-      Source: R/foreign.R
+      Source: R/foreign.R
       
graph_from_graphdb.Rd

     

 
diff --git a/reference/graph_from_graphnel.html b/reference/graph_from_graphnel.html
index 4ea3384ec0..fe0efd0b7e 100644
--- a/reference/graph_from_graphnel.html
+++ b/reference/graph_from_graphnel.html
@@ -51,7 +51,7 @@
 

   

       
Convert graphNEL objects from the graph package to igraph

-      Source: R/conversion.R
+      Source: R/conversion.R
       
graph_from_graphnel.Rd

     

 
@@ -133,10 +133,10 @@ 
ExamplesGNEL <- as_graphnel(g)
 g2 <- graph_from_graphnel(GNEL)
 g2
-#> IGRAPH 48300c6 UNW- 10 10 -- Ring graph
+#> IGRAPH 530e090 UNW- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
 #> | (e/n)
-#> + edges from 48300c6 (vertex names):
+#> + edges from 530e090 (vertex names):
 #>  [1] a--b a--j b--c c--d d--e e--f f--g g--h h--i i--j
 
 ## Directed
@@ -145,9 +145,9 @@ 
ExamplesGNEL2 <- as_graphnel(g3)
 g4 <- graph_from_graphnel(GNEL2)
 g4
-#> IGRAPH 734722b DNW- 10 9 -- In-star
+#> IGRAPH dab4db2 DNW- 10 9 -- In-star
 #> + attr: name (g/c), mode (g/c), center (g/n), name (v/c), weight (e/n)
-#> + edges from 734722b (vertex names):
+#> + edges from dab4db2 (vertex names):
 #> [1] b->a c->a d->a e->a f->a g->a h->a i->a j->a
 

     
diff --git a/reference/graph_from_incidence_matrix.html b/reference/graph_from_incidence_matrix.html
index 411a6bb508..71922781d9 100644
--- a/reference/graph_from_incidence_matrix.html
+++ b/reference/graph_from_incidence_matrix.html
@@ -43,7 +43,7 @@
 

   

       
From incidence matrix

-      Source: R/incidence.R
+      Source: R/incidence.R
       
graph_from_incidence_matrix.Rd

     

 
diff --git a/reference/graph_from_isomorphism_class.html b/reference/graph_from_isomorphism_class.html
index 6eb6f7abc5..226f0b144b 100644
--- a/reference/graph_from_isomorphism_class.html
+++ b/reference/graph_from_isomorphism_class.html
@@ -47,7 +47,7 @@
 

   

       
Create a graph from an isomorphism class

-      Source: R/topology.R
+      Source: R/topology.R
       
graph_from_isomorphism_class.Rd

     

 
diff --git a/reference/graph_from_lcf.html b/reference/graph_from_lcf.html
index 2367a6679a..548be2715f 100644
--- a/reference/graph_from_lcf.html
+++ b/reference/graph_from_lcf.html
@@ -49,7 +49,7 @@
 

   

       
Creating a graph from LCF notation

-      Source: R/make.R
+      Source: R/make.R
       
graph_from_lcf.Rd

     

 
diff --git a/reference/graph_from_literal.html b/reference/graph_from_literal.html
index f66e9c5c2e..7f4ba6b6f8 100644
--- a/reference/graph_from_literal.html
+++ b/reference/graph_from_literal.html
@@ -41,7 +41,7 @@
 

   

       
Creating (small) graphs via a simple interface

-      Source: R/make.R
+      Source: R/make.R
       
graph_from_literal.Rd

     

 
@@ -146,18 +146,18 @@ 
Examples  Cecil - Gordon
 )
 g
-#> IGRAPH 400863b UN-- 6 6 -- 
+#> IGRAPH b4c43e9 UN-- 6 6 -- 
 #> + attr: name (v/c)
-#> + edges from 400863b (vertex names):
+#> + edges from b4c43e9 (vertex names):
 #> [1] Alice--Bob    Alice--Cecil  Bob  --Cecil  Cecil--Daniel Cecil--Eugene
 #> [6] Cecil--Gordon
 
 # Another undirected graph, ":" notation
 g2 <- graph_from_literal(Alice - Bob:Cecil:Daniel, Cecil:Daniel - Eugene:Gordon)
 g2
-#> IGRAPH a7c75ee UN-- 6 7 -- 
+#> IGRAPH 34e3d68 UN-- 6 7 -- 
 #> + attr: name (v/c)
-#> + edges from a7c75ee (vertex names):
+#> + edges from 34e3d68 (vertex names):
 #> [1] Alice --Bob    Alice --Cecil  Alice --Daniel Cecil --Eugene Cecil --Gordon
 #> [6] Daniel--Eugene Daniel--Gordon
 
@@ -167,18 +167,18 @@ 
Examples  Eugene --+ Gordon:Helen
 )
 g3
-#> IGRAPH 06b1425 DN-- 7 6 -- 
+#> IGRAPH 718b2b2 DN-- 7 6 -- 
 #> + attr: name (v/c)
-#> + edges from 06b1425 (vertex names):
+#> + edges from 718b2b2 (vertex names):
 #> [1] Alice ->Bob    Bob   ->Alice  Bob   ->Cecil  Daniel->Cecil  Eugene->Gordon
 #> [6] Eugene->Helen 
 
 # A graph with isolate vertices
 g4 <- graph_from_literal(Alice -- Bob -- Daniel, Cecil:Gordon, Helen)
 g4
-#> IGRAPH b9c6585 UN-- 6 2 -- 
+#> IGRAPH c2967ca UN-- 6 2 -- 
 #> + attr: name (v/c)
-#> + edges from b9c6585 (vertex names):
+#> + edges from c2967ca (vertex names):
 #> [1] Alice--Bob    Bob  --Daniel
 V(g4)$name
 #> [1] "Alice"  "Bob"    "Daniel" "Cecil"  "Gordon" "Helen" 
@@ -186,17 +186,17 @@ 
Examples# "Arrows" can be arbitrarily long
 g5 <- graph_from_literal(Alice +---------+ Bob)
 g5
-#> IGRAPH a74ffe0 DN-- 2 2 -- 
+#> IGRAPH c3958f5 DN-- 2 2 -- 
 #> + attr: name (v/c)
-#> + edges from a74ffe0 (vertex names):
+#> + edges from c3958f5 (vertex names):
 #> [1] Alice->Bob   Bob  ->Alice
 
 # Special vertex names
 g6 <- graph_from_literal("+" -- "-", "*" -- "/", "%%" -- "%/%")
 g6
-#> IGRAPH cdbc173 UN-- 6 3 -- 
+#> IGRAPH 76b3de7 UN-- 6 3 -- 
 #> + attr: name (v/c)
-#> + edges from cdbc173 (vertex names):
+#> + edges from 76b3de7 (vertex names):
 #> [1] + ---   * --/   %%--%/%
 
 

diff --git a/reference/graph_id.html b/reference/graph_id.html
index 2533e1979f..232ed6bf0e 100644
--- a/reference/graph_id.html
+++ b/reference/graph_id.html
@@ -45,7 +45,7 @@
 

   

       
Get the id of a graph

-      Source: R/iterators.R
+      Source: R/iterators.R
       
graph_id.Rd

     

 
@@ -83,15 +83,15 @@ 
Value
Examples

     
g <- make_ring(10)
 graph_id(g)
-#> [1] "99bb4222-e856-4d8f-b4c5-69f7db3c1d71"
+#> [1] "62a2fa74-4017-44ac-9ad8-385ae5c1e844"
 graph_id(V(g))
-#> [1] "99bb4222-e856-4d8f-b4c5-69f7db3c1d71"
+#> [1] "62a2fa74-4017-44ac-9ad8-385ae5c1e844"
 graph_id(E(g))
-#> [1] "99bb4222-e856-4d8f-b4c5-69f7db3c1d71"
+#> [1] "62a2fa74-4017-44ac-9ad8-385ae5c1e844"
 
 g2 <- g + 1
 graph_id(g2)
-#> [1] "8b3a796f-29bb-4aa6-8021-693fce0ae995"
+#> [1] "943d432d-b3ea-4165-a0ad-54f856e3f5a5"
diff --git a/reference/igraph-dollar.html b/reference/igraph-dollar.html index 22e08afa11..a35ef5345b 100644 --- a/reference/igraph-dollar.html +++ b/reference/igraph-dollar.html @@ -43,7 +43,7 @@

Getting and setting graph attributes, shortcut

- Source: R/attributes.R + Source: R/attributes.R
igraph-dollar.Rd
diff --git a/reference/igraph-es-attributes.html b/reference/igraph-es-attributes.html index e36eba3553..47585b0877 100644 --- a/reference/igraph-es-attributes.html +++ b/reference/igraph-es-attributes.html @@ -41,7 +41,7 @@

Query or set attributes of the edges in an edge sequence

- Source: R/iterators.R + Source: R/iterators.R
igraph-es-attributes.Rd
diff --git a/reference/igraph-es-indexing.html b/reference/igraph-es-indexing.html index ca3253bcae..03d64e88e4 100644 --- a/reference/igraph-es-indexing.html +++ b/reference/igraph-es-indexing.html @@ -41,7 +41,7 @@

Indexing edge sequences

- Source: R/iterators.R + Source: R/iterators.R
igraph-es-indexing.Rd
@@ -197,13 +197,13 @@

Examples# Special operators for indexing based on graph structure g <- sample_pa(100, power = 0.3) E(g)[1:3 %--% 2:6] -#> + 4/99 edges from 2492032: +#> + 4/99 edges from daaa375: #> [1] 2->1 3->1 4->1 6->1 E(g)[1:5 %->% 1:6] -#> + 4/99 edges from 2492032: +#> + 4/99 edges from daaa375: #> [1] 2->1 3->1 4->1 5->4 E(g)[1:3 %<-% 2:6] -#> + 4/99 edges from 2492032: +#> + 4/99 edges from daaa375: #> [1] 2->1 3->1 4->1 6->1 # ----------------------------------------------------------------- @@ -211,7 +211,7 @@

Examplesg <- sample_pa(100, directed = FALSE) d <- get_diameter(g) E(g, path = d) -#> + 11/99 edges from f840ec0: +#> + 11/99 edges from 33c24be: #> [1] 53--81 49--53 43--49 4--43 2-- 4 2-- 5 5-- 9 9--14 14--36 36--58 #> [11] 58--85 @@ -220,7 +220,7 @@

Examplesg <- sample_gnp(20, 3 / 20) %>% set_edge_attr("weight", value = rnorm(gsize(.))) E(g)[[weight < 0]] -#> + 19/32 edges from 15aeaf9: +#> + 19/32 edges from e8479b0: #> tail head tid hid weight #> 2 1 6 1 6 -1.0667237 #> 3 5 6 5 6 -2.7731724 @@ -247,7 +247,7 @@

ExamplesE(g)$x <- E(g)$weight x <- 2 E(g)[.env$x] -#> + 1/32 edge from 15aeaf9: +#> + 1/32 edge from e8479b0: #> [1] 1--6

diff --git a/reference/igraph-es-indexing2.html b/reference/igraph-es-indexing2.html index 602dc50d3f..4a2795b29e 100644 --- a/reference/igraph-es-indexing2.html +++ b/reference/igraph-es-indexing2.html @@ -41,7 +41,7 @@

Select edges and show their metadata

- Source: R/iterators.R + Source: R/iterators.R
igraph-es-indexing2.Rd
@@ -120,10 +120,10 @@

Examples with_edge_(weight = 1:10, color = "green") ) E(g) -#> + 10/10 edges from 4d7d931 (vertex names): +#> + 10/10 edges from ace1746 (vertex names): #> [1] A--B B--C C--D D--E E--F F--G G--H H--I I--J A--J E(g)[[]] -#> + 10/10 edges from 4d7d931 (vertex names): +#> + 10/10 edges from ace1746 (vertex names): #> tail head tid hid weight color #> 1 A B 1 2 1 green #> 2 B C 2 3 2 green @@ -136,7 +136,7 @@

Examples#> 9 I J 9 10 9 green #> 10 A J 1 10 10 green E(g)[[.inc("A")]] -#> + 2/10 edges from 4d7d931 (vertex names): +#> + 2/10 edges from ace1746 (vertex names): #> tail head tid hid weight color #> 1 A B 1 2 1 green #> 10 A J 1 10 10 green diff --git a/reference/igraph-minus.html b/reference/igraph-minus.html index 3c7b9c05fd..d00ff83d7e 100644 --- a/reference/igraph-minus.html +++ b/reference/igraph-minus.html @@ -39,7 +39,7 @@

Delete vertices or edges from a graph

- Source: R/operators.R + Source: R/operators.R
igraph-minus.Rd
diff --git a/reference/igraph-vs-attributes.html b/reference/igraph-vs-attributes.html index beea65a1cb..b88fe30cff 100644 --- a/reference/igraph-vs-attributes.html +++ b/reference/igraph-vs-attributes.html @@ -41,7 +41,7 @@

Query or set attributes of the vertices in a vertex sequence

- Source: R/iterators.R + Source: R/iterators.R
igraph-vs-attributes.Rd
diff --git a/reference/igraph-vs-indexing.html b/reference/igraph-vs-indexing.html index efdda0e096..1387a837a6 100644 --- a/reference/igraph-vs-indexing.html +++ b/reference/igraph-vs-indexing.html @@ -41,7 +41,7 @@

Indexing vertex sequences

- Source: R/iterators.R + Source: R/iterators.R
igraph-vs-indexing.Rd
@@ -215,26 +215,26 @@

Examples# nei() special function g <- make_graph(c(1, 2, 2, 3, 2, 4, 4, 2)) V(g)[.nei(c(2, 4))] -#> + 4/4 vertices, from eeb2d16: +#> + 4/4 vertices, from 6db9202: #> [1] 1 2 3 4 V(g)[.nei(c(2, 4), "in")] -#> + 3/4 vertices, from eeb2d16: +#> + 3/4 vertices, from 6db9202: #> [1] 1 2 4 V(g)[.nei(c(2, 4), "out")] -#> + 3/4 vertices, from eeb2d16: +#> + 3/4 vertices, from 6db9202: #> [1] 2 3 4 # ----------------------------------------------------------------- # The same with vertex names g <- make_graph(~ A -+ B, B -+ C:D, D -+ B) V(g)[.nei(c("B", "D"))] -#> + 4/4 vertices, named, from bd1c3ea: +#> + 4/4 vertices, named, from fd56ac4: #> [1] A B C D V(g)[.nei(c("B", "D"), "in")] -#> + 3/4 vertices, named, from bd1c3ea: +#> + 3/4 vertices, named, from fd56ac4: #> [1] A B D V(g)[.nei(c("B", "D"), "out")] -#> + 3/4 vertices, named, from bd1c3ea: +#> + 3/4 vertices, named, from fd56ac4: #> [1] B C D # ----------------------------------------------------------------- @@ -242,7 +242,7 @@

Examplesg <- make_graph(~ A -+ B, B -+ C:D, D -+ B) V(g)$color <- c("red", "red", "green", "green") V(g)[color == "red"] -#> + 2/4 vertices, named, from d875854: +#> + 2/4 vertices, named, from b559c85: #> [1] A B # Indexing with a variable whose name matches the name of an attribute @@ -250,7 +250,7 @@

ExamplesV(g)$x <- 10:13 x <- 2 V(g)[.env$x] -#> + 1/4 vertex, named, from d875854: +#> + 1/4 vertex, named, from b559c85: #> [1] B

diff --git a/reference/igraph-vs-indexing2.html b/reference/igraph-vs-indexing2.html index 115069f633..7807ba664b 100644 --- a/reference/igraph-vs-indexing2.html +++ b/reference/igraph-vs-indexing2.html @@ -41,7 +41,7 @@

Select vertices and show their metadata

- Source: R/iterators.R + Source: R/iterators.R
igraph-vs-indexing2.Rd
@@ -118,10 +118,10 @@

Examples set_vertex_attr("color", value = "red") %>% set_vertex_attr("name", value = LETTERS[1:10]) V(g) -#> + 10/10 vertices, named, from f6a7867: +#> + 10/10 vertices, named, from 862164c: #> [1] A B C D E F G H I J V(g)[[]] -#> + 10/10 vertices, named, from f6a7867: +#> + 10/10 vertices, named, from 862164c: #> color name #> 1 red A #> 2 red B @@ -134,10 +134,10 @@

Examples#> 9 red I #> 10 red J V(g)[1:5] -#> + 5/10 vertices, named, from f6a7867: +#> + 5/10 vertices, named, from 862164c: #> [1] A B C D E V(g)[[1:5]] -#> + 5/10 vertices, named, from f6a7867: +#> + 5/10 vertices, named, from 862164c: #> color name #> 1 red A #> 2 red B diff --git a/reference/igraph.console.html b/reference/igraph.console.html index c044e8ef91..6dc7dc51ee 100644 --- a/reference/igraph.console.html +++ b/reference/igraph.console.html @@ -43,7 +43,7 @@

The igraph console

- Source: R/console.R + Source: R/console.R
igraph.console.Rd
diff --git a/reference/igraph.from.graphNEL.html b/reference/igraph.from.graphNEL.html index 2bbf73cd1a..e98e654af7 100644 --- a/reference/igraph.from.graphNEL.html +++ b/reference/igraph.from.graphNEL.html @@ -43,7 +43,7 @@

Convert graphNEL objects from the graph package to igraph

- Source: R/conversion.R + Source: R/conversion.R
igraph.from.graphNEL.Rd
diff --git a/reference/igraph.options.html b/reference/igraph.options.html index cc9850b519..dc2813db87 100644 --- a/reference/igraph.options.html +++ b/reference/igraph.options.html @@ -43,7 +43,7 @@

Parameters for the igraph package

- Source: R/par.R + Source: R/par.R
igraph.options.Rd
diff --git a/reference/igraph.sample.html b/reference/igraph.sample.html index d30fcc3655..ac55e5c398 100644 --- a/reference/igraph.sample.html +++ b/reference/igraph.sample.html @@ -43,7 +43,7 @@

Sampling a random integer sequence

- Source: R/other.R + Source: R/other.R
igraph.sample.Rd
diff --git a/reference/igraph.shape.noclip.html b/reference/igraph.shape.noclip.html index 604cf53bfb..7092ecc564 100644 --- a/reference/igraph.shape.noclip.html +++ b/reference/igraph.shape.noclip.html @@ -43,7 +43,7 @@

Various vertex shapes when plotting igraph graphs

- Source: R/plot.shapes.R + Source: R/plot.shapes.R
igraph.shape.noclip.Rd
diff --git a/reference/igraph.shape.noplot.html b/reference/igraph.shape.noplot.html index cb8dcd5c22..38ecc822e6 100644 --- a/reference/igraph.shape.noplot.html +++ b/reference/igraph.shape.noplot.html @@ -43,7 +43,7 @@

Various vertex shapes when plotting igraph graphs

- Source: R/plot.shapes.R + Source: R/plot.shapes.R
igraph.shape.noplot.Rd
diff --git a/reference/igraph.to.graphNEL.html b/reference/igraph.to.graphNEL.html index 21b2034cf2..995d4bed8b 100644 --- a/reference/igraph.to.graphNEL.html +++ b/reference/igraph.to.graphNEL.html @@ -43,7 +43,7 @@

Convert igraph graphs to graphNEL objects from the graph package

- Source: R/conversion.R + Source: R/conversion.R
igraph.to.graphNEL.Rd
diff --git a/reference/igraph.version.html b/reference/igraph.version.html index b7dc916bad..abbaffeda0 100644 --- a/reference/igraph.version.html +++ b/reference/igraph.version.html @@ -43,7 +43,7 @@

Query igraph's version string

- Source: R/test.R + Source: R/test.R
igraph.version.Rd
diff --git a/reference/igraph_demo.html b/reference/igraph_demo.html index 339a0b2739..bd020e60c9 100644 --- a/reference/igraph_demo.html +++ b/reference/igraph_demo.html @@ -41,7 +41,7 @@

Run igraph demos, step by step

- Source: R/demo.R + Source: R/demo.R
igraph_demo.Rd
diff --git a/reference/igraph_options.html b/reference/igraph_options.html index 63ade1e111..eb2f656656 100644 --- a/reference/igraph_options.html +++ b/reference/igraph_options.html @@ -41,7 +41,7 @@

Parameters for the igraph package

- Source: R/par.R + Source: R/par.R
igraph_options.Rd
diff --git a/reference/igraph_version.html b/reference/igraph_version.html index bf6fe00ff1..51f82c192d 100644 --- a/reference/igraph_version.html +++ b/reference/igraph_version.html @@ -39,7 +39,7 @@

Query igraph's version string

- Source: R/test.R + Source: R/test.R
igraph_version.Rd
diff --git a/reference/igraphdemo.html b/reference/igraphdemo.html index fef2fb8bfa..79b5287d55 100644 --- a/reference/igraphdemo.html +++ b/reference/igraphdemo.html @@ -43,7 +43,7 @@

Run igraph demos, step by step

- Source: R/demo.R + Source: R/demo.R
igraphdemo.Rd
diff --git a/reference/incident.html b/reference/incident.html index 4f4bfc9f67..f5e3c009cd 100644 --- a/reference/incident.html +++ b/reference/incident.html @@ -39,7 +39,7 @@

Incident edges of a vertex in a graph

- Source: R/interface.R + Source: R/interface.R
incident.Rd
@@ -97,11 +97,11 @@

See alsoExamples

g <- make_graph("Zachary")
 incident(g, 1)
-#> + 16/78 edges from bbd14e3:
+#> + 16/78 edges from fbfdb64:
 #>  [1] 1-- 2 1-- 3 1-- 4 1-- 5 1-- 6 1-- 7 1-- 8 1-- 9 1--11 1--12 1--13 1--14
 #> [13] 1--18 1--20 1--22 1--32
 incident(g, 34)
-#> + 17/78 edges from bbd14e3:
+#> + 17/78 edges from fbfdb64:
 #>  [1]  9--34 10--34 14--34 15--34 16--34 19--34 20--34 21--34 23--34 24--34
 #> [11] 27--34 28--34 29--34 30--34 31--34 32--34 33--34
diff --git a/reference/incident_edges.html b/reference/incident_edges.html index 54c77939f7..cde74581f3 100644 --- a/reference/incident_edges.html +++ b/reference/incident_edges.html @@ -41,7 +41,7 @@

Incident edges of multiple vertices in a graph

- Source: R/interface.R + Source: R/interface.R
incident_edges.Rd
@@ -100,12 +100,12 @@

Examples
g <- make_graph("Zachary")
 incident_edges(g, c(1, 34))
 #> [[1]]
-#> + 16/78 edges from f1c8123:
+#> + 16/78 edges from 97d8fb2:
 #>  [1] 1-- 2 1-- 3 1-- 4 1-- 5 1-- 6 1-- 7 1-- 8 1-- 9 1--11 1--12 1--13 1--14
 #> [13] 1--18 1--20 1--22 1--32
 #> 
 #> [[2]]
-#> + 17/78 edges from f1c8123:
+#> + 17/78 edges from 97d8fb2:
 #>  [1]  9--34 10--34 14--34 15--34 16--34 19--34 20--34 21--34 23--34 24--34
 #> [11] 27--34 28--34 29--34 30--34 31--34 32--34 33--34
 #> 
diff --git a/reference/indent_print.html b/reference/indent_print.html
index 255db3b726..14d228f299 100644
--- a/reference/indent_print.html
+++ b/reference/indent_print.html
@@ -39,7 +39,7 @@
 

   

       
Indent a printout

-      Source: R/printr.R
+      Source: R/printr.R
       
indent_print.Rd

     

 
diff --git a/reference/independence.number.html b/reference/independence.number.html
index f8cb129127..bd0d1b4266 100644
--- a/reference/independence.number.html
+++ b/reference/independence.number.html
@@ -43,7 +43,7 @@
 

   

       
Independent vertex sets

-      Source: R/cliques.R
+      Source: R/cliques.R
       
independence.number.Rd

     

 
diff --git a/reference/independent.vertex.sets.html b/reference/independent.vertex.sets.html
index 2841b99fbe..f3d5fb15f6 100644
--- a/reference/independent.vertex.sets.html
+++ b/reference/independent.vertex.sets.html
@@ -43,7 +43,7 @@
 

   

       
Independent vertex sets

-      Source: R/cliques.R
+      Source: R/cliques.R
       
independent.vertex.sets.Rd

     

 
diff --git a/reference/induced.subgraph.html b/reference/induced.subgraph.html
index 78ad46f511..6c68475a81 100644
--- a/reference/induced.subgraph.html
+++ b/reference/induced.subgraph.html
@@ -43,7 +43,7 @@
 

   

       
Subgraph of a graph

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
induced.subgraph.Rd

     

 
diff --git a/reference/infomap.community.html b/reference/infomap.community.html
index 7b906b23da..8cc3adb196 100644
--- a/reference/infomap.community.html
+++ b/reference/infomap.community.html
@@ -43,7 +43,7 @@
 

   

       
Infomap community finding

-      Source: R/community.R
+      Source: R/community.R
       
infomap.community.Rd

     

 
diff --git a/reference/inside-square-error.html b/reference/inside-square-error.html
index a102f8bec8..6914860935 100644
--- a/reference/inside-square-error.html
+++ b/reference/inside-square-error.html
@@ -39,7 +39,7 @@
 

   

       
Helpers within vertex/index sequences

-      Source: R/iterators.R
+      Source: R/iterators.R
       
inside-square-error.Rd

     

 
diff --git a/reference/interconnected.islands.game.html b/reference/interconnected.islands.game.html
index 76fa574d86..8bb0cdb768 100644
--- a/reference/interconnected.islands.game.html
+++ b/reference/interconnected.islands.game.html
@@ -43,7 +43,7 @@
 

   

       
A graph with subgraphs that are each a random graph.

-      Source: R/games.R
+      Source: R/games.R
       
interconnected.islands.game.Rd

     

 
diff --git a/reference/intersection.html b/reference/intersection.html
index c886cfcb80..70794eda88 100644
--- a/reference/intersection.html
+++ b/reference/intersection.html
@@ -49,7 +49,7 @@
 

   

       
Intersection of two or more sets

-      Source: R/operators.R
+      Source: R/operators.R
       
intersection.Rd

     

 
diff --git a/reference/intersection.igraph.es.html b/reference/intersection.igraph.es.html
index 5b763b8f1c..f2e514b202 100644
--- a/reference/intersection.igraph.es.html
+++ b/reference/intersection.igraph.es.html
@@ -39,7 +39,7 @@
 

   

       
Intersection of edge sequences

-      Source: R/iterators.R
+      Source: R/iterators.R
       
intersection.igraph.es.Rd

     

 
@@ -96,7 +96,7 @@ 
See alsoExamples

     
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
 intersection(E(g)[1:6], E(g)[5:9])
-#> + 2/10 edges from 43bbe84 (vertex names):
+#> + 2/10 edges from 482153e (vertex names):
 #> [1] E--F F--G
 

     

diff --git a/reference/intersection.igraph.html b/reference/intersection.igraph.html
index fea7ca72b6..98d2869b4f 100644
--- a/reference/intersection.igraph.html
+++ b/reference/intersection.igraph.html
@@ -41,7 +41,7 @@
 

   

       
Intersection of graphs

-      Source: R/operators.R
+      Source: R/operators.R
       
intersection.igraph.Rd

     

 
@@ -141,7 +141,7 @@ 
Examples)
 net2 <- graph_from_literal(D - A:F:Y, B - A - X - F - H - Z, F - Y)
 print_all(net1 %s% net2)
-#> IGRAPH 6e7c59a UN-- 13 4 -- 
+#> IGRAPH 4048d74 UN-- 13 4 -- 
 #> + attr: name (v/c)
 #> + vertex attributes:
 #> |      name
@@ -158,7 +158,7 @@ 
Examples#> | [11]    Y
 #> | [12]    X
 #> | [13]    Z
-#> + edges from 6e7c59a (vertex names):
+#> + edges from 4048d74 (vertex names):
 #> [1] F--H A--B D--F D--A

diff --git a/reference/intersection.igraph.vs.html b/reference/intersection.igraph.vs.html index 2cf416a7c5..5266c9dbbe 100644 --- a/reference/intersection.igraph.vs.html +++ b/reference/intersection.igraph.vs.html @@ -39,7 +39,7 @@

Intersection of vertex sequences

- Source: R/iterators.R + Source: R/iterators.R
intersection.igraph.vs.Rd
@@ -96,7 +96,7 @@

See alsoExamples

g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
 intersection(E(g)[1:6], E(g)[5:9])
-#> + 2/10 edges from fbb1af2 (vertex names):
+#> + 2/10 edges from 6428a30 (vertex names):
 #> [1] E--F F--G
diff --git a/reference/is.bipartite.html b/reference/is.bipartite.html index 9d66720805..f0738a106a 100644 --- a/reference/is.bipartite.html +++ b/reference/is.bipartite.html @@ -43,7 +43,7 @@

Checks whether the graph has a vertex attribute called type

- Source: R/attributes.R + Source: R/attributes.R
is.bipartite.Rd
diff --git a/reference/is.chordal.html b/reference/is.chordal.html index bd41c32de0..b4c1daa90a 100644 --- a/reference/is.chordal.html +++ b/reference/is.chordal.html @@ -43,7 +43,7 @@

Chordality of a graph

- Source: R/decomposition.R + Source: R/decomposition.R
is.chordal.Rd
diff --git a/reference/is.connected.html b/reference/is.connected.html index db51262768..67107387f9 100644 --- a/reference/is.connected.html +++ b/reference/is.connected.html @@ -43,7 +43,7 @@

Connected components of a graph

- Source: R/structural.properties.R + Source: R/structural.properties.R
is.connected.Rd
diff --git a/reference/is.dag.html b/reference/is.dag.html index f1392fb3b7..9894239b51 100644 --- a/reference/is.dag.html +++ b/reference/is.dag.html @@ -43,7 +43,7 @@

Directed acyclic graphs

- Source: R/paths.R + Source: R/paths.R
is.dag.Rd
diff --git a/reference/is.degree.sequence.html b/reference/is.degree.sequence.html index 1d505c017a..1b6cf2f8e7 100644 --- a/reference/is.degree.sequence.html +++ b/reference/is.degree.sequence.html @@ -43,7 +43,7 @@

Check if a degree sequence is valid for a multi-graph

- Source: R/degseq.R + Source: R/degseq.R
is.degree.sequence.Rd
diff --git a/reference/is.directed.html b/reference/is.directed.html index cfb75b1952..83e026d545 100644 --- a/reference/is.directed.html +++ b/reference/is.directed.html @@ -43,7 +43,7 @@

Check whether a graph is directed

- Source: R/interface.R + Source: R/interface.R
is.directed.Rd
diff --git a/reference/is.graphical.degree.sequence.html b/reference/is.graphical.degree.sequence.html index 4b93b613a4..773dafb382 100644 --- a/reference/is.graphical.degree.sequence.html +++ b/reference/is.graphical.degree.sequence.html @@ -43,7 +43,7 @@

Is a degree sequence graphical?

- Source: R/degseq.R + Source: R/degseq.R
is.graphical.degree.sequence.Rd
diff --git a/reference/is.hierarchical.html b/reference/is.hierarchical.html index ed23719904..304b61e77e 100644 --- a/reference/is.hierarchical.html +++ b/reference/is.hierarchical.html @@ -43,7 +43,7 @@

Functions to deal with the result of network community detection

- Source: R/community.R + Source: R/community.R
is.hierarchical.Rd
diff --git a/reference/is.igraph.html b/reference/is.igraph.html index 63a9c5fa8f..c9ef20a23d 100644 --- a/reference/is.igraph.html +++ b/reference/is.igraph.html @@ -43,7 +43,7 @@

Is this object an igraph graph?

- Source: R/basic.R + Source: R/basic.R
is.igraph.Rd
diff --git a/reference/is.loop.html b/reference/is.loop.html index 039c48e9cf..0254a9c910 100644 --- a/reference/is.loop.html +++ b/reference/is.loop.html @@ -43,7 +43,7 @@

Find the multiple or loop edges in a graph

- Source: R/structural.properties.R + Source: R/structural.properties.R
is.loop.Rd
diff --git a/reference/is.matching.html b/reference/is.matching.html index 4e9ab9f1a6..38850acc44 100644 --- a/reference/is.matching.html +++ b/reference/is.matching.html @@ -43,7 +43,7 @@

Matching

- Source: R/structural.properties.R + Source: R/structural.properties.R
is.matching.Rd
diff --git a/reference/is.maximal.matching.html b/reference/is.maximal.matching.html index f3804e63d1..dfac767538 100644 --- a/reference/is.maximal.matching.html +++ b/reference/is.maximal.matching.html @@ -43,7 +43,7 @@

Matching

- Source: R/structural.properties.R + Source: R/structural.properties.R
is.maximal.matching.Rd
diff --git a/reference/is.minimal.separator.html b/reference/is.minimal.separator.html index 442297854c..8a63f2cce8 100644 --- a/reference/is.minimal.separator.html +++ b/reference/is.minimal.separator.html @@ -43,7 +43,7 @@

Minimal vertex separators

- Source: R/flow.R + Source: R/flow.R
is.minimal.separator.Rd
diff --git a/reference/is.multiple.html b/reference/is.multiple.html index 0d922e89d0..2cfa0f3105 100644 --- a/reference/is.multiple.html +++ b/reference/is.multiple.html @@ -43,7 +43,7 @@

Find the multiple or loop edges in a graph

- Source: R/structural.properties.R + Source: R/structural.properties.R
is.multiple.Rd
diff --git a/reference/is.mutual.html b/reference/is.mutual.html index c0b2446c7f..51a61e7f79 100644 --- a/reference/is.mutual.html +++ b/reference/is.mutual.html @@ -43,7 +43,7 @@

Find mutual edges in a directed graph

- Source: R/structural.properties.R + Source: R/structural.properties.R
is.mutual.Rd
diff --git a/reference/is.named.html b/reference/is.named.html index 67eeb97544..b500b0c803 100644 --- a/reference/is.named.html +++ b/reference/is.named.html @@ -43,7 +43,7 @@

Named graphs

- Source: R/attributes.R + Source: R/attributes.R
is.named.Rd
diff --git a/reference/is.separator.html b/reference/is.separator.html index 1ff0c0305a..5948a19e22 100644 --- a/reference/is.separator.html +++ b/reference/is.separator.html @@ -43,7 +43,7 @@

Vertex separators

- Source: R/flow.R + Source: R/flow.R
is.separator.Rd
diff --git a/reference/is.simple.html b/reference/is.simple.html index 8299dba8c8..4caba9223c 100644 --- a/reference/is.simple.html +++ b/reference/is.simple.html @@ -43,7 +43,7 @@

Simple graphs

- Source: R/simple.R + Source: R/simple.R
is.simple.Rd
diff --git a/reference/is.weighted.html b/reference/is.weighted.html index 6187ab3042..711147b809 100644 --- a/reference/is.weighted.html +++ b/reference/is.weighted.html @@ -43,7 +43,7 @@

Weighted graphs

- Source: R/attributes.R + Source: R/attributes.R
is.weighted.Rd
diff --git a/reference/is_acyclic.html b/reference/is_acyclic.html index a306b99192..0b3546565c 100644 --- a/reference/is_acyclic.html +++ b/reference/is_acyclic.html @@ -39,7 +39,7 @@

Acyclic graphs

- Source: R/paths.R + Source: R/paths.R
is_acyclic.Rd
diff --git a/reference/is_biconnected.html b/reference/is_biconnected.html index c0283cc495..51fda1aa97 100644 --- a/reference/is_biconnected.html +++ b/reference/is_biconnected.html @@ -41,7 +41,7 @@

Check biconnectedness

- Source: R/components.R + Source: R/components.R
is_biconnected.Rd
diff --git a/reference/is_bipartite.html b/reference/is_bipartite.html index 410b8ce4e6..8b189e0ca5 100644 --- a/reference/is_bipartite.html +++ b/reference/is_bipartite.html @@ -41,7 +41,7 @@

Checks whether the graph has a vertex attribute called type.

- Source: R/attributes.R + Source: R/attributes.R
is_bipartite.Rd
diff --git a/reference/is_chordal.html b/reference/is_chordal.html index 648553ad56..1f90023f55 100644 --- a/reference/is_chordal.html +++ b/reference/is_chordal.html @@ -45,7 +45,7 @@

Chordality of a graph

- Source: R/decomposition.R + Source: R/decomposition.R
is_chordal.Rd
@@ -152,7 +152,7 @@

Examples#> [1] 9 4 6 8 3 5 7 2 1 #> #> $alpham1 -#> + 9/9 vertices, named, from ca6142d: +#> + 9/9 vertices, named, from 715408e: #> [1] G F D B E C H I A #> is_chordal(g1, fillin = TRUE) @@ -176,7 +176,7 @@

Examples#> [1] 10 8 9 6 7 5 4 2 3 1 #> #> $alpham1 -#> + 10/10 vertices, named, from 297fc9c: +#> + 10/10 vertices, named, from 96f9682: #> [1] J H I G C F D B E A #> is_chordal(g2, fillin = TRUE) diff --git a/reference/is_dag.html b/reference/is_dag.html index f600ceb7e7..52e1b686d2 100644 --- a/reference/is_dag.html +++ b/reference/is_dag.html @@ -41,7 +41,7 @@

Directed acyclic graphs

- Source: R/paths.R + Source: R/paths.R
is_dag.Rd
diff --git a/reference/is_degseq.html b/reference/is_degseq.html index d76b206d14..327118f769 100644 --- a/reference/is_degseq.html +++ b/reference/is_degseq.html @@ -51,7 +51,7 @@

Check if a degree sequence is valid for a multi-graph

- Source: R/degseq.R + Source: R/degseq.R
is_degseq.Rd
diff --git a/reference/is_directed.html b/reference/is_directed.html index c3ba37e27a..05b02fc3c8 100644 --- a/reference/is_directed.html +++ b/reference/is_directed.html @@ -39,7 +39,7 @@

Check whether a graph is directed

- Source: R/interface.R + Source: R/interface.R
is_directed.Rd
diff --git a/reference/is_forest.html b/reference/is_forest.html index 4176292440..fa002bb291 100644 --- a/reference/is_forest.html +++ b/reference/is_forest.html @@ -41,7 +41,7 @@

Decide whether a graph is a forest.

- Source: R/trees.R + Source: R/trees.R
is_forest.Rd
@@ -122,7 +122,7 @@

Examples#> [1] TRUE #> #> $roots -#> + 2/8 vertices, from 411a41d: +#> + 2/8 vertices, from c99c724: #> [1] 1 4 #> diff --git a/reference/is_graphical.html b/reference/is_graphical.html index 08c5947fbd..74a757cdc2 100644 --- a/reference/is_graphical.html +++ b/reference/is_graphical.html @@ -41,7 +41,7 @@

Is a degree sequence graphical?

- Source: R/degseq.R + Source: R/degseq.R
is_graphical.Rd
diff --git a/reference/is_igraph.html b/reference/is_igraph.html index 7a505049e9..ce3d5680bd 100644 --- a/reference/is_igraph.html +++ b/reference/is_igraph.html @@ -39,7 +39,7 @@

Is this object an igraph graph?

- Source: R/basic.R + Source: R/basic.R
is_igraph.Rd
diff --git a/reference/is_min_separator.html b/reference/is_min_separator.html index ed01e9718a..f7e07fca3d 100644 --- a/reference/is_min_separator.html +++ b/reference/is_min_separator.html @@ -39,7 +39,7 @@

Minimal vertex separators

- Source: R/flow.R + Source: R/flow.R
is_min_separator.Rd
diff --git a/reference/is_named.html b/reference/is_named.html index 78754dfe2d..128f3f3fc1 100644 --- a/reference/is_named.html +++ b/reference/is_named.html @@ -41,7 +41,7 @@

Named graphs

- Source: R/attributes.R + Source: R/attributes.R
is_named.Rd
@@ -95,7 +95,7 @@

Examplesis_named(g) #> [1] TRUE neighbors(g, "a") -#> + 2/10 vertices, named, from 3529942: +#> + 2/10 vertices, named, from c47e227: #> [1] b j

diff --git a/reference/is_printer_callback.html b/reference/is_printer_callback.html index 71e37bf4f7..2bf32526dd 100644 --- a/reference/is_printer_callback.html +++ b/reference/is_printer_callback.html @@ -39,7 +39,7 @@

Is this a printer callback?

- Source: R/printr.R + Source: R/printr.R
is_printer_callback.Rd
diff --git a/reference/is_separator.html b/reference/is_separator.html index 4d2284c806..673cf2b8da 100644 --- a/reference/is_separator.html +++ b/reference/is_separator.html @@ -47,7 +47,7 @@

Check whether removing this set of vertices would disconnect the graph.

- Source: R/flow.R + Source: R/flow.R
is_separator.Rd
@@ -108,11 +108,11 @@

Examples
ring <- make_ring(4)
 min_st_separators(ring)
 #> [[1]]
-#> + 2/4 vertices, from 55779e4:
+#> + 2/4 vertices, from b380c4c:
 #> [1] 2 4
 #> 
 #> [[2]]
-#> + 2/4 vertices, from 55779e4:
+#> + 2/4 vertices, from b380c4c:
 #> [1] 1 3
 #> 
 is_separator(ring, 1)
diff --git a/reference/is_tree.html b/reference/is_tree.html
index e879aab286..edc73c5996 100644
--- a/reference/is_tree.html
+++ b/reference/is_tree.html
@@ -41,7 +41,7 @@
 

   

       
Decide whether a graph is a tree.

-      Source: R/trees.R
+      Source: R/trees.R
       
is_tree.Rd

     

 
@@ -123,7 +123,7 @@ 
Examples#> [1] TRUE
 #> 
 #> $root
-#> + 1/7 vertex, from 2569e7d:
+#> + 1/7 vertex, from 45d9605:
 #> [1] 1
 #> 
 
diff --git a/reference/is_weighted.html b/reference/is_weighted.html
index 1160602121..39174c2089 100644
--- a/reference/is_weighted.html
+++ b/reference/is_weighted.html
@@ -41,7 +41,7 @@
 

   

       
Weighted graphs

-      Source: R/attributes.R
+      Source: R/attributes.R
       
is_weighted.Rd

     

 
@@ -91,7 +91,7 @@ 
Examplesshortest_paths(g, 8, 2)
 #> $vpath
 #> $vpath[[1]]
-#> + 5/10 vertices, from 925568d:
+#> + 5/10 vertices, from ac92bec:
 #> [1]  8  9 10  1  2
 #> 
 #> 
@@ -108,7 +108,7 @@ 
Examplesshortest_paths(g, 8, 2)
 #> $vpath
 #> $vpath[[1]]
-#> + 7/10 vertices, from 925568d:
+#> + 7/10 vertices, from ac92bec:
 #> [1] 8 7 6 5 4 3 2
 #> 
 #> 
diff --git a/reference/isomorphic.html b/reference/isomorphic.html
index b0c80b0b24..87472805e5 100644
--- a/reference/isomorphic.html
+++ b/reference/isomorphic.html
@@ -39,7 +39,7 @@
 

   

       
Decide if two graphs are isomorphic

-      Source: R/topology.R
+      Source: R/topology.R
       
isomorphic.Rd

     

 
diff --git a/reference/isomorphism_class.html b/reference/isomorphism_class.html
index cd988dc53e..2f1d982ccc 100644
--- a/reference/isomorphism_class.html
+++ b/reference/isomorphism_class.html
@@ -47,7 +47,7 @@
 

   

       
Isomorphism class of a graph

-      Source: R/topology.R
+      Source: R/topology.R
       
isomorphism_class.Rd

     

 
diff --git a/reference/isomorphisms.html b/reference/isomorphisms.html
index dc10974e36..e5ae0871ae 100644
--- a/reference/isomorphisms.html
+++ b/reference/isomorphisms.html
@@ -39,7 +39,7 @@
 

   

       
Calculate all isomorphic mappings between the vertices of two graphs

-      Source: R/topology.R
+      Source: R/topology.R
       
isomorphisms.Rd

     

 
diff --git a/reference/ivs.html b/reference/ivs.html
index d976a68260..b590831236 100644
--- a/reference/ivs.html
+++ b/reference/ivs.html
@@ -43,7 +43,7 @@
 

   

       
Independent vertex sets

-      Source: R/cliques.R
+      Source: R/cliques.R
       
ivs.Rd

     

 
@@ -143,83 +143,83 @@ 
Examples#> [1] 4
 ivs(g, min = ivs_size(g))
 #> [[1]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  7 37 55 56
 #> 
 #> [[2]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  7 55 56 69
 #> 
 #> [[3]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  7 56 69 74
 #> 
 #> [[4]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  8 15 73 80
 #> 
 #> [[5]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  8 15 73 84
 #> 
 #> [[6]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1] 13 16 37 40
 #> 
 #> [[7]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1] 21 32 45 61
 #> 
 #> [[8]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1] 22 55 56 64
 #> 
 #> [[9]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1] 23 69 75 90
 #> 
 largest_ivs(g)
 #> [[1]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1] 21 32 45 61
 #> 
 #> [[2]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  7 37 55 56
 #> 
 #> [[3]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  7 55 56 69
 #> 
 #> [[4]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  7 56 69 74
 #> 
 #> [[5]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  8 15 73 80
 #> 
 #> [[6]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1]  8 15 73 84
 #> 
 #> [[7]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1] 22 55 56 64
 #> 
 #> [[8]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1] 23 69 75 90
 #> 
 #> [[9]]
-#> + 4/100 vertices, from 459c764:
+#> + 4/100 vertices, from 8b6a4a4:
 #> [1] 13 16 37 40
 #> 
 # Empty graph
 induced_subgraph(g, largest_ivs(g)[[1]])
-#> IGRAPH 11cc012 U--- 4 0 -- Erdos-Renyi (gnp) graph
+#> IGRAPH efbad88 U--- 4 0 -- Erdos-Renyi (gnp) graph
 #> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from 11cc012:
+#> + edges from efbad88:
 
 length(max_ivs(g))
 #> [1] 326
diff --git a/reference/k.regular.game.html b/reference/k.regular.game.html
index e1b4752039..c42a7022ad 100644
--- a/reference/k.regular.game.html
+++ b/reference/k.regular.game.html
@@ -43,7 +43,7 @@
 

   

       
Create a random regular graph

-      Source: R/games.R
+      Source: R/games.R
       
k.regular.game.Rd

     

 
diff --git a/reference/k_shortest_paths.html b/reference/k_shortest_paths.html
index f84b5c5ed5..390db3b872 100644
--- a/reference/k_shortest_paths.html
+++ b/reference/k_shortest_paths.html
@@ -43,7 +43,7 @@
 

   

       
Find the \(k\) shortest paths between two vertices

-      Source: R/structural.properties.R
+      Source: R/structural.properties.R
       
k_shortest_paths.Rd

     

 
diff --git a/reference/keeping_degseq.html b/reference/keeping_degseq.html
index 28efd25b72..5f54e26631 100644
--- a/reference/keeping_degseq.html
+++ b/reference/keeping_degseq.html
@@ -43,7 +43,7 @@
 

   

       
Graph rewiring while preserving the degree distribution

-      Source: R/rewire.R
+      Source: R/rewire.R
       
keeping_degseq.Rd

     

 
@@ -98,7 +98,7 @@ 
Examples  degree()
 #>  [1] 2 2 2 2 2 2 2 2 2 2
 print_all(rewire(g, with = keeping_degseq(niter = vcount(g) * 10)))
-#> IGRAPH db32abb U--- 10 10 -- Ring graph
+#> IGRAPH fe854f3 U--- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
 #> + graph attributes:
 #> | + name:
@@ -107,7 +107,7 @@ 
Examples#> |   [1] FALSE
 #> | + circular:
 #> |   [1] TRUE
-#> + edges from db32abb:
+#> + edges from fe854f3:
 #>  [1] 2-- 8 3-- 7 6-- 9 4-- 5 5--10 1-- 7 6--10 2-- 3 4-- 9 1-- 8

diff --git a/reference/knn.html b/reference/knn.html index 711694c9d2..397232cfcf 100644 --- a/reference/knn.html +++ b/reference/knn.html @@ -41,7 +41,7 @@

Average nearest neighbor degree

- Source: R/structural.properties.R + Source: R/structural.properties.R
knn.Rd
diff --git a/reference/label.propagation.community.html b/reference/label.propagation.community.html index 73251fec60..1208cb4562 100644 --- a/reference/label.propagation.community.html +++ b/reference/label.propagation.community.html @@ -43,7 +43,7 @@

Finding communities based on propagating labels

- Source: R/community.R + Source: R/community.R
label.propagation.community.Rd
diff --git a/reference/laplacian_matrix.html b/reference/laplacian_matrix.html index 576cdc9335..a6bf6cc232 100644 --- a/reference/laplacian_matrix.html +++ b/reference/laplacian_matrix.html @@ -39,7 +39,7 @@

Graph Laplacian

- Source: R/structural.properties.R + Source: R/structural.properties.R
laplacian_matrix.Rd
diff --git a/reference/largest.cliques.html b/reference/largest.cliques.html index c617728024..df6330a14c 100644 --- a/reference/largest.cliques.html +++ b/reference/largest.cliques.html @@ -43,7 +43,7 @@

Functions to find cliques, i.e. complete subgraphs in a graph

- Source: R/cliques.R + Source: R/cliques.R
largest.cliques.Rd
diff --git a/reference/largest.independent.vertex.sets.html b/reference/largest.independent.vertex.sets.html index 1a7e035da0..ffb17ee414 100644 --- a/reference/largest.independent.vertex.sets.html +++ b/reference/largest.independent.vertex.sets.html @@ -43,7 +43,7 @@

Independent vertex sets

- Source: R/cliques.R + Source: R/cliques.R
largest.independent.vertex.sets.Rd
diff --git a/reference/lastcit.game.html b/reference/lastcit.game.html index c9ecc79402..a24583de37 100644 --- a/reference/lastcit.game.html +++ b/reference/lastcit.game.html @@ -43,7 +43,7 @@

Random citation graphs

- Source: R/games.R + Source: R/games.R
lastcit.game.Rd
diff --git a/reference/layout.auto.html b/reference/layout.auto.html index ddf9dfbd79..1de41736d6 100644 --- a/reference/layout.auto.html +++ b/reference/layout.auto.html @@ -43,7 +43,7 @@

Choose an appropriate graph layout algorithm automatically

- Source: R/layout.R + Source: R/layout.R
layout.auto.Rd
diff --git a/reference/layout.bipartite.html b/reference/layout.bipartite.html index de2ec2d798..7fb23a31b0 100644 --- a/reference/layout.bipartite.html +++ b/reference/layout.bipartite.html @@ -43,7 +43,7 @@

Simple two-row layout for bipartite graphs

- Source: R/layout.R + Source: R/layout.R
layout.bipartite.Rd
diff --git a/reference/layout.circle.html b/reference/layout.circle.html index cac2c8ff39..52ddddca91 100644 --- a/reference/layout.circle.html +++ b/reference/layout.circle.html @@ -43,7 +43,7 @@

Graph layout with vertices on a circle

- Source: R/layout.R + Source: R/layout.R
layout.circle.Rd
diff --git a/reference/layout.davidson.harel.html b/reference/layout.davidson.harel.html index 9c6f18ec85..e9310538f6 100644 --- a/reference/layout.davidson.harel.html +++ b/reference/layout.davidson.harel.html @@ -43,7 +43,7 @@

The Davidson-Harel layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout.davidson.harel.Rd
diff --git a/reference/layout.drl.html b/reference/layout.drl.html index 9884d650ff..58e16b743e 100644 --- a/reference/layout.drl.html +++ b/reference/layout.drl.html @@ -43,7 +43,7 @@

The DrL graph layout generator

- Source: R/layout_drl.R + Source: R/layout_drl.R
layout.drl.Rd
diff --git a/reference/layout.fruchterman.reingold.grid.html b/reference/layout.fruchterman.reingold.grid.html index 866b179ba8..afccdf09e0 100644 --- a/reference/layout.fruchterman.reingold.grid.html +++ b/reference/layout.fruchterman.reingold.grid.html @@ -41,7 +41,7 @@

Grid Fruchterman-Reingold layout, this was removed from igraph

- Source: R/layout.R + Source: R/layout.R
layout.fruchterman.reingold.grid.Rd
diff --git a/reference/layout.fruchterman.reingold.html b/reference/layout.fruchterman.reingold.html index 49a0ddbae2..afd4b830b0 100644 --- a/reference/layout.fruchterman.reingold.html +++ b/reference/layout.fruchterman.reingold.html @@ -43,7 +43,7 @@

The Fruchterman-Reingold layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout.fruchterman.reingold.Rd
diff --git a/reference/layout.gem.html b/reference/layout.gem.html index 887d24390c..091bbb8412 100644 --- a/reference/layout.gem.html +++ b/reference/layout.gem.html @@ -43,7 +43,7 @@

The GEM layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout.gem.Rd
diff --git a/reference/layout.graphopt.html b/reference/layout.graphopt.html index 6172b2d1ef..4793cf3d3e 100644 --- a/reference/layout.graphopt.html +++ b/reference/layout.graphopt.html @@ -43,7 +43,7 @@

The graphopt layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout.graphopt.Rd
diff --git a/reference/layout.grid.3d.html b/reference/layout.grid.3d.html index f41e7f48ca..4b946e200c 100644 --- a/reference/layout.grid.3d.html +++ b/reference/layout.grid.3d.html @@ -41,7 +41,7 @@

Simple grid layout

- Source: R/layout.R + Source: R/layout.R
layout.grid.3d.Rd
diff --git a/reference/layout.grid.html b/reference/layout.grid.html index aa643d2325..024c859256 100644 --- a/reference/layout.grid.html +++ b/reference/layout.grid.html @@ -43,7 +43,7 @@

Simple grid layout

- Source: R/layout.R + Source: R/layout.R
layout.grid.Rd
diff --git a/reference/layout.kamada.kawai.html b/reference/layout.kamada.kawai.html index 007c7aaad2..bbcf678180 100644 --- a/reference/layout.kamada.kawai.html +++ b/reference/layout.kamada.kawai.html @@ -43,7 +43,7 @@

The Kamada-Kawai layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout.kamada.kawai.Rd
diff --git a/reference/layout.lgl.html b/reference/layout.lgl.html index 7dd6b37488..e7fdaeb612 100644 --- a/reference/layout.lgl.html +++ b/reference/layout.lgl.html @@ -43,7 +43,7 @@

Large Graph Layout

- Source: R/layout.R + Source: R/layout.R
layout.lgl.Rd
diff --git a/reference/layout.mds.html b/reference/layout.mds.html index 1f47c7c02d..469a2fc3df 100644 --- a/reference/layout.mds.html +++ b/reference/layout.mds.html @@ -43,7 +43,7 @@

Graph layout by multidimensional scaling

- Source: R/layout.R + Source: R/layout.R
layout.mds.Rd
diff --git a/reference/layout.merge.html b/reference/layout.merge.html index b0c81b7de9..f94a069951 100644 --- a/reference/layout.merge.html +++ b/reference/layout.merge.html @@ -43,7 +43,7 @@

Merging graph layouts

- Source: R/layout.R + Source: R/layout.R
layout.merge.Rd
diff --git a/reference/layout.norm.html b/reference/layout.norm.html index 3bfb48fa11..ddd6e5f8a8 100644 --- a/reference/layout.norm.html +++ b/reference/layout.norm.html @@ -43,7 +43,7 @@

Normalize coordinates for plotting graphs

- Source: R/layout.R + Source: R/layout.R
layout.norm.Rd
diff --git a/reference/layout.random.html b/reference/layout.random.html index 386cf27c1f..ecfa9c0725 100644 --- a/reference/layout.random.html +++ b/reference/layout.random.html @@ -43,7 +43,7 @@

Randomly place vertices on a plane or in 3d space

- Source: R/layout.R + Source: R/layout.R
layout.random.Rd
diff --git a/reference/layout.reingold.tilford.html b/reference/layout.reingold.tilford.html index 335b95b1df..7e5a1b6488 100644 --- a/reference/layout.reingold.tilford.html +++ b/reference/layout.reingold.tilford.html @@ -43,7 +43,7 @@

The Reingold-Tilford graph layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout.reingold.tilford.Rd
diff --git a/reference/layout.sphere.html b/reference/layout.sphere.html index 1807c166b1..b1b762b686 100644 --- a/reference/layout.sphere.html +++ b/reference/layout.sphere.html @@ -43,7 +43,7 @@

Graph layout with vertices on the surface of a sphere

- Source: R/layout.R + Source: R/layout.R
layout.sphere.Rd
diff --git a/reference/layout.spring.html b/reference/layout.spring.html index ebc8f98a8f..70793f662b 100644 --- a/reference/layout.spring.html +++ b/reference/layout.spring.html @@ -41,7 +41,7 @@

Spring layout, this was removed from igraph

- Source: R/layout.R + Source: R/layout.R
layout.spring.Rd
diff --git a/reference/layout.star.html b/reference/layout.star.html index 6603f4415b..efd8e8c70e 100644 --- a/reference/layout.star.html +++ b/reference/layout.star.html @@ -43,7 +43,7 @@

Generate coordinates to place the vertices of a graph in a star-shape

- Source: R/layout.R + Source: R/layout.R
layout.star.Rd
diff --git a/reference/layout.sugiyama.html b/reference/layout.sugiyama.html index 39b8258cfc..042da6bd37 100644 --- a/reference/layout.sugiyama.html +++ b/reference/layout.sugiyama.html @@ -43,7 +43,7 @@

The Sugiyama graph layout generator

- Source: R/layout.R + Source: R/layout.R
layout.sugiyama.Rd
diff --git a/reference/layout.svd.html b/reference/layout.svd.html index 6cf85cb2b9..39591e1c9b 100644 --- a/reference/layout.svd.html +++ b/reference/layout.svd.html @@ -41,7 +41,7 @@

SVD layout, this was removed from igraph

- Source: R/layout.R + Source: R/layout.R
layout.svd.Rd
diff --git a/reference/layout_.html b/reference/layout_.html index baf61a7c5d..73302eefb4 100644 --- a/reference/layout_.html +++ b/reference/layout_.html @@ -41,7 +41,7 @@

Graph layouts

- Source: R/layout.R + Source: R/layout.R
layout_.Rd
diff --git a/reference/layout_as_bipartite.html b/reference/layout_as_bipartite.html index d5cc8c8956..dd1432bd18 100644 --- a/reference/layout_as_bipartite.html +++ b/reference/layout_as_bipartite.html @@ -41,7 +41,7 @@

Simple two-row layout for bipartite graphs

- Source: R/layout.R + Source: R/layout.R
layout_as_bipartite.Rd
diff --git a/reference/layout_as_star.html b/reference/layout_as_star.html index d56f767d23..60c5d53cca 100644 --- a/reference/layout_as_star.html +++ b/reference/layout_as_star.html @@ -41,7 +41,7 @@

Generate coordinates to place the vertices of a graph in a star-shape

- Source: R/layout.R + Source: R/layout.R
layout_as_star.Rd
diff --git a/reference/layout_as_tree.html b/reference/layout_as_tree.html index 6035c05cb4..b4df529ce2 100644 --- a/reference/layout_as_tree.html +++ b/reference/layout_as_tree.html @@ -41,7 +41,7 @@

The Reingold-Tilford graph layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout_as_tree.Rd
diff --git a/reference/layout_in_circle.html b/reference/layout_in_circle.html index 8d77145dc3..b6fb3f2778 100644 --- a/reference/layout_in_circle.html +++ b/reference/layout_in_circle.html @@ -39,7 +39,7 @@

Graph layout with vertices on a circle.

- Source: R/layout.R + Source: R/layout.R
layout_in_circle.Rd
diff --git a/reference/layout_nicely.html b/reference/layout_nicely.html index 2dc96f442d..8cc6de4eb3 100644 --- a/reference/layout_nicely.html +++ b/reference/layout_nicely.html @@ -41,7 +41,7 @@

Choose an appropriate graph layout algorithm automatically

- Source: R/layout.R + Source: R/layout.R
layout_nicely.Rd
diff --git a/reference/layout_on_grid.html b/reference/layout_on_grid.html index 35266f2019..5c6858be2a 100644 --- a/reference/layout_on_grid.html +++ b/reference/layout_on_grid.html @@ -41,7 +41,7 @@

Simple grid layout

- Source: R/layout.R + Source: R/layout.R
layout_on_grid.Rd
diff --git a/reference/layout_on_sphere.html b/reference/layout_on_sphere.html index 97c055c24c..6a3fafe8c3 100644 --- a/reference/layout_on_sphere.html +++ b/reference/layout_on_sphere.html @@ -41,7 +41,7 @@

Graph layout with vertices on the surface of a sphere

- Source: R/layout.R + Source: R/layout.R
layout_on_sphere.Rd
diff --git a/reference/layout_randomly.html b/reference/layout_randomly.html index 0867485865..40b8c6def5 100644 --- a/reference/layout_randomly.html +++ b/reference/layout_randomly.html @@ -41,7 +41,7 @@

Randomly place vertices on a plane or in 3d space

- Source: R/layout.R + Source: R/layout.R
layout_randomly.Rd
diff --git a/reference/layout_with_dh.html b/reference/layout_with_dh.html index 240b1ced6c..9acbe85bec 100644 --- a/reference/layout_with_dh.html +++ b/reference/layout_with_dh.html @@ -41,7 +41,7 @@

The Davidson-Harel layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout_with_dh.Rd
diff --git a/reference/layout_with_drl.html b/reference/layout_with_drl.html index cf30c8cefd..05e255c8ae 100644 --- a/reference/layout_with_drl.html +++ b/reference/layout_with_drl.html @@ -43,7 +43,7 @@

The DrL graph layout generator

- Source: R/layout_drl.R + Source: R/layout_drl.R
layout_with_drl.Rd
diff --git a/reference/layout_with_fr.html b/reference/layout_with_fr.html index 531279b04c..7afdfd5fe5 100644 --- a/reference/layout_with_fr.html +++ b/reference/layout_with_fr.html @@ -41,7 +41,7 @@

The Fruchterman-Reingold layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout_with_fr.Rd
diff --git a/reference/layout_with_gem.html b/reference/layout_with_gem.html index 3361f5e5df..87ab58fa63 100644 --- a/reference/layout_with_gem.html +++ b/reference/layout_with_gem.html @@ -39,7 +39,7 @@

The GEM layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout_with_gem.Rd
diff --git a/reference/layout_with_graphopt.html b/reference/layout_with_graphopt.html index 8d463b0231..92b817f78f 100644 --- a/reference/layout_with_graphopt.html +++ b/reference/layout_with_graphopt.html @@ -41,7 +41,7 @@

The graphopt layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout_with_graphopt.Rd
diff --git a/reference/layout_with_kk.html b/reference/layout_with_kk.html index 68afe3c4fb..4698e355cc 100644 --- a/reference/layout_with_kk.html +++ b/reference/layout_with_kk.html @@ -41,7 +41,7 @@

The Kamada-Kawai layout algorithm

- Source: R/layout.R + Source: R/layout.R
layout_with_kk.Rd
diff --git a/reference/layout_with_lgl.html b/reference/layout_with_lgl.html index 913967ba32..756221dc96 100644 --- a/reference/layout_with_lgl.html +++ b/reference/layout_with_lgl.html @@ -39,7 +39,7 @@

Large Graph Layout

- Source: R/layout.R + Source: R/layout.R
layout_with_lgl.Rd
diff --git a/reference/layout_with_mds.html b/reference/layout_with_mds.html index ef332aad2d..39c52365e7 100644 --- a/reference/layout_with_mds.html +++ b/reference/layout_with_mds.html @@ -41,7 +41,7 @@

Graph layout by multidimensional scaling

- Source: R/layout.R + Source: R/layout.R
layout_with_mds.Rd
diff --git a/reference/layout_with_sugiyama.html b/reference/layout_with_sugiyama.html index 86305bc1b9..e92cde2364 100644 --- a/reference/layout_with_sugiyama.html +++ b/reference/layout_with_sugiyama.html @@ -41,7 +41,7 @@

The Sugiyama graph layout generator

- Source: R/layout.R + Source: R/layout.R
layout_with_sugiyama.Rd
diff --git a/reference/leading.eigenvector.community.html b/reference/leading.eigenvector.community.html index a23343661d..12ae70082d 100644 --- a/reference/leading.eigenvector.community.html +++ b/reference/leading.eigenvector.community.html @@ -43,7 +43,7 @@

Community structure detecting based on the leading eigenvector of the community matrix

- Source: R/community.R + Source: R/community.R
leading.eigenvector.community.Rd
diff --git a/reference/line.graph.html b/reference/line.graph.html index cb89c4ed00..65f5ac2bcc 100644 --- a/reference/line.graph.html +++ b/reference/line.graph.html @@ -43,7 +43,7 @@

Line graph of a graph

- Source: R/make.R + Source: R/make.R
line.graph.Rd
diff --git a/reference/list.edge.attributes.html b/reference/list.edge.attributes.html index e645e36b62..b8c757cccb 100644 --- a/reference/list.edge.attributes.html +++ b/reference/list.edge.attributes.html @@ -43,7 +43,7 @@

List names of edge attributes

- Source: R/attributes.R + Source: R/attributes.R
list.edge.attributes.Rd
diff --git a/reference/list.graph.attributes.html b/reference/list.graph.attributes.html index e69bf0363d..6c21cd5a22 100644 --- a/reference/list.graph.attributes.html +++ b/reference/list.graph.attributes.html @@ -43,7 +43,7 @@

List names of graph attributes

- Source: R/attributes.R + Source: R/attributes.R
list.graph.attributes.Rd
diff --git a/reference/list.vertex.attributes.html b/reference/list.vertex.attributes.html index 510280ea63..285b616b39 100644 --- a/reference/list.vertex.attributes.html +++ b/reference/list.vertex.attributes.html @@ -43,7 +43,7 @@

List names of vertex attributes

- Source: R/attributes.R + Source: R/attributes.R
list.vertex.attributes.Rd
diff --git a/reference/local_scan.html b/reference/local_scan.html index 194ff098a0..c15bf60b0a 100644 --- a/reference/local_scan.html +++ b/reference/local_scan.html @@ -45,7 +45,7 @@

Compute local scan statistics on graphs

- Source: R/scan.R + Source: R/scan.R
local_scan.Rd
diff --git a/reference/make_.html b/reference/make_.html index 411a56c0d2..4846c7fd48 100644 --- a/reference/make_.html +++ b/reference/make_.html @@ -39,7 +39,7 @@

Make a new graph

- Source: R/make.R + Source: R/make.R
make_.Rd
diff --git a/reference/make_bipartite_graph.html b/reference/make_bipartite_graph.html index 3675973ac1..1849d65108 100644 --- a/reference/make_bipartite_graph.html +++ b/reference/make_bipartite_graph.html @@ -41,7 +41,7 @@

Create a bipartite graph

- Source: R/make.R + Source: R/make.R
make_bipartite_graph.Rd
@@ -121,9 +121,9 @@

Examples

 g <- make_bipartite_graph(rep(0:1, length.out = 10), c(1:10))
 print(g, v = TRUE)
-#> IGRAPH 59e2a50 U--B 10 5 -- 
+#> IGRAPH 5da9123 U--B 10 5 -- 
 #> + attr: type (v/l)
-#> + edges from 59e2a50:
+#> + edges from 5da9123:
 #> [1] 1-- 2 3-- 4 5-- 6 7-- 8 9--10

diff --git a/reference/make_chordal_ring.html b/reference/make_chordal_ring.html index baae7a374a..a174e0fe14 100644 --- a/reference/make_chordal_ring.html +++ b/reference/make_chordal_ring.html @@ -59,7 +59,7 @@

Create an extended chordal ring graph

- Source: R/make.R + Source: R/make.R
make_chordal_ring.Rd
diff --git a/reference/make_clusters.html b/reference/make_clusters.html index 21023e4f11..6f1b495b1a 100644 --- a/reference/make_clusters.html +++ b/reference/make_clusters.html @@ -41,7 +41,7 @@

Creates a communities object.

- Source: R/community.R + Source: R/community.R
make_clusters.Rd
diff --git a/reference/make_de_bruijn_graph.html b/reference/make_de_bruijn_graph.html index 860dcfed53..3f3b21e911 100644 --- a/reference/make_de_bruijn_graph.html +++ b/reference/make_de_bruijn_graph.html @@ -39,7 +39,7 @@

De Bruijn graphs

- Source: R/make.R + Source: R/make.R
make_de_bruijn_graph.Rd
@@ -103,14 +103,14 @@

Examples# de Bruijn graphs can be created recursively by line graphs as well g <- make_de_bruijn_graph(2, 1) make_de_bruijn_graph(2, 2) -#> IGRAPH 44f71b9 D--- 4 8 -- De-Bruijn graph 2-2 +#> IGRAPH 2471c8b D--- 4 8 -- De-Bruijn graph 2-2 #> + attr: name (g/c), m (g/n), n (g/n) -#> + edges from 44f71b9: +#> + edges from 2471c8b: #> [1] 1->1 1->2 2->3 2->4 3->1 3->2 4->3 4->4 make_line_graph(g) -#> IGRAPH 6ebe0a8 D--- 4 8 -- Line graph +#> IGRAPH 3228cc6 D--- 4 8 -- Line graph #> + attr: name (g/c) -#> + edges from 6ebe0a8: +#> + edges from 3228cc6: #> [1] 1->1 3->1 1->2 3->2 2->3 4->3 2->4 4->4

diff --git a/reference/make_empty_graph.html b/reference/make_empty_graph.html index 6743213a8d..4358e1c648 100644 --- a/reference/make_empty_graph.html +++ b/reference/make_empty_graph.html @@ -39,7 +39,7 @@

A graph with no edges

- Source: R/make.R + Source: R/make.R
make_empty_graph.Rd
@@ -98,11 +98,11 @@