From c2ea2b565cad0ee5803f9593bdcab23d271561fe Mon Sep 17 00:00:00 2001 From: krlmlr Date: Sat, 30 Nov 2024 20:35:40 +0000 Subject: [PATCH] Built site for igraph@2.1.1.9905: f5dc296 --- articles/igraph.html | 30 +- articles/igraph_ES.html | 30 +- pkgdown.yml | 2 +- reference/E.html | 4 +- reference/V.html | 4 +- reference/add_edges.html | 2 +- reference/add_vertices.html | 6 +- reference/adjacent_vertices.html | 4 +- reference/all_simple_paths.html | 12 +- reference/are_adjacent.html | 8 +- reference/articulation_points.html | 4 +- reference/as.igraph.html | 4 +- reference/as_adj_list.html | 40 +- reference/as_directed.html | 16 +- reference/as_graphnel.html | 8 +- reference/automorphism_group.html | 4 +- reference/bfs.html | 10 +- reference/bipartite_projection.html | 8 +- reference/c.igraph.es.html | 2 +- reference/c.igraph.vs.html | 2 +- reference/cliques.html | 358 ++++++++-------- reference/cohesive_blocks.html | 10 +- reference/complementer.html | 8 +- reference/components.html | 4 +- reference/compose.html | 4 +- reference/contract.html | 4 +- reference/delete_edges.html | 12 +- reference/delete_vertices.html | 12 +- reference/dfs.html | 6 +- reference/diameter.html | 4 +- reference/difference.igraph.es.html | 2 +- reference/difference.igraph.html | 2 +- reference/difference.igraph.vs.html | 2 +- reference/disjoint_union.html | 4 +- reference/distances.html | 36 +- reference/edge.html | 2 +- reference/edge_attr-set.html | 4 +- reference/edge_attr.html | 4 +- reference/ego.html | 60 +-- reference/feedback_arc_set.html | 4 +- reference/get_edge_ids.html | 4 +- reference/girth.html | 6 +- reference/graph_.html | 8 +- reference/graph_attr-set.html | 4 +- reference/graph_center.html | 10 +- reference/graph_from_adjacency_matrix.html | 2 +- reference/graph_from_atlas.html | 8 +- reference/graph_from_biadjacency_matrix.html | 4 +- reference/graph_from_data_frame.html | 4 +- reference/graph_from_edgelist.html | 8 +- reference/graph_from_graphnel.html | 8 +- reference/graph_from_literal.html | 24 +- reference/graph_id.html | 8 +- reference/has_eulerian_path.html | 4 +- reference/igraph-attribute-combination.html | 20 +- reference/igraph-es-indexing.html | 12 +- reference/igraph-es-indexing2.html | 6 +- reference/igraph-vs-indexing.html | 16 +- reference/igraph-vs-indexing2.html | 8 +- reference/incident.html | 4 +- reference/incident_edges.html | 4 +- reference/intersection.igraph.es.html | 2 +- reference/intersection.igraph.html | 4 +- reference/intersection.igraph.vs.html | 2 +- reference/is_chordal.html | 4 +- reference/is_forest.html | 2 +- reference/is_named.html | 2 +- reference/is_separator.html | 4 +- reference/is_tree.html | 2 +- reference/is_weighted.html | 4 +- reference/ivs.html | 40 +- reference/keeping_degseq.html | 4 +- reference/make_bipartite_graph.html | 4 +- reference/make_de_bruijn_graph.html | 8 +- reference/make_empty_graph.html | 8 +- reference/make_full_citation_graph.html | 2 +- reference/make_full_graph.html | 6 +- reference/make_graph.html | 8 +- reference/make_kautz_graph.html | 8 +- reference/make_lattice.html | 8 +- reference/make_line_graph.html | 12 +- reference/make_ring.html | 8 +- reference/make_star.html | 8 +- reference/make_tree.html | 8 +- reference/matching.html | 8 +- reference/max_cardinality.html | 4 +- reference/max_flow.html | 6 +- reference/min_cut.html | 12 +- reference/min_separators.html | 54 +-- reference/min_st_separators.html | 68 +-- reference/neighbors.html | 2 +- reference/path.html | 4 +- reference/print.igraph.es.html | 14 +- reference/print.igraph.html | 6 +- reference/print.igraph.vs.html | 12 +- reference/rev.igraph.es.html | 4 +- reference/rev.igraph.vs.html | 2 +- reference/reverse_edges.html | 4 +- reference/rewire.html | 4 +- reference/sample_bipartite.html | 16 +- reference/sample_correlated_gnp.html | 8 +- reference/sample_correlated_gnp_pair.html | 8 +- reference/sample_dot_product.html | 8 +- reference/sample_hierarchical_sbm.html | 4 +- reference/sample_sbm.html | 4 +- reference/set_edge_attr.html | 4 +- reference/set_graph_attr.html | 4 +- reference/set_vertex_attr.html | 4 +- reference/simplified.html | 8 +- reference/st_cuts.html | 60 +-- reference/st_min_cuts.html | 12 +- reference/subcomponent.html | 6 +- reference/subgraph_isomorphic.html | 50 +-- reference/topo_sort.html | 2 +- reference/union.igraph.es.html | 2 +- reference/union.igraph.html | 4 +- reference/union.igraph.vs.html | 2 +- reference/unique.igraph.es.html | 4 +- reference/unique.igraph.vs.html | 4 +- reference/vertex.html | 4 +- reference/vertex_attr-set.html | 4 +- reference/weighted_cliques.html | 414 +++++++++---------- reference/with_graph_.html | 4 +- reference/without_attr.html | 8 +- reference/without_loops.html | 8 +- reference/without_multiples.html | 8 +- search.json | 2 +- 127 files changed, 971 insertions(+), 971 deletions(-) diff --git a/articles/igraph.html b/articles/igraph.html index fb1a3a81ba..c2bbef9ccd 100644 --- a/articles/igraph.html +++ b/articles/igraph.html @@ -145,9 +145,9 @@

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

 g
-
## IGRAPH f05a066 UN-- 10 2 -- 
+
## IGRAPH 870b15a UN-- 10 2 -- 
 ## + attr: name (v/c)
-## + edges from f05a066 (vertex names):
+## + edges from 870b15a (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 f05a066 UN-- 10 2 -- 
+
## IGRAPH 870b15a 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 856960b U--- 40 86 -- Zachary
+
## IGRAPH 28db48e U--- 40 86 -- Zachary
 ## + attr: name (g/c)
-## + edges from 856960b:
+## + edges from 28db48e:
 ##  [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 8962743 U--- 127 126 -- Tree
+
## IGRAPH e73b002 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 086681d U--- 100 524 -- Geometric random graph
+
## IGRAPH 04cbf8c 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 51df074 UN-- 7 9 -- 
+
## IGRAPH 95906ec 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 51df074:
+
## + 7/7 vertices, named, from 95906ec:
 ## [1] Alejandra Bruno     Carmina   Moshe     Nang      Samira    Ibrahim

 
To delete attributes:

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

-
## + 3/10 vertices, from b290d0d:
+
## + 3/10 vertices, from 0d00294:
 ## [1] 2 3 7

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

-
## + 2/10 vertices, from b290d0d:
+
## + 2/10 vertices, from 0d00294:
 ## [1] 2 7

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

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

-
## + 4/9 edges from 51df074 (vertex names):
+
## + 4/9 edges from 95906ec (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 51df074 (vertex names):
+
## + 4/9 edges from 95906ec (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
@@ -689,7 +689,7 @@ 
Selecting edges
 
 E(g)[3:5 %--% 5:6]

-
## + 3/9 edges from 51df074 (vertex names):
+
## + 3/9 edges from 95906ec (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
@@ -708,7 +708,7 @@ 
Selecting edges## [1] "Alejandra" "Carmina"   "Samira"

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

-
## + 5/9 edges from 51df074 (vertex names):
+
## + 5/9 edges from 95906ec (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 169dd1f1ab..49275aa33e 100644
--- a/articles/igraph_ES.html
+++ b/articles/igraph_ES.html
@@ -149,9 +149,9 @@ 
Crear un grafo
 
 g

-
## IGRAPH 21087e5 UN-- 10 2 -- 
+
## IGRAPH c761b85 UN-- 10 2 -- 
 ## + attr: name (v/c)
-## + edges from 21087e5 (vertex names):
+## + edges from c761b85 (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 21087e5 UN-- 10 2 -- 
+
## IGRAPH c761b85 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 160be22 U--- 40 86 -- Zachary
+
## IGRAPH 5c0bc40 U--- 40 86 -- Zachary
 ## + attr: name (g/c)
-## + edges from 160be22:
+## + edges from 5c0bc40:
 ##  [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 c99ba3e U--- 5 3 -- Ring graph
+
## IGRAPH 570678a 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 6dc4ef0 U--- 100 524 -- Geometric random graph
+
## IGRAPH 2db3e97 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 68f945b UN-- 7 9 -- 
+
## IGRAPH cabfb64 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 68f945b:
+
## + 7/7 vertices, named, from cabfb64:
 ## [1] Alejandra Bruno     Carmina   Moshe     Nang      Samira    Ibrahim

 
Para eliminar atributos:

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

-
## + 3/10 vertices, from 5aefe93:
+
## + 3/10 vertices, from b59487a:
 ## [1] 2 3 7

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

-
## + 2/10 vertices, from 5aefe93:
+
## + 2/10 vertices, from b59487a:
 ## [1] 2 7

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

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

-
## + 4/9 edges from 68f945b (vertex names):
+
## + 4/9 edges from cabfb64 (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 68f945b (vertex names):
+
## + 4/9 edges from cabfb64 (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
@@ -713,7 +713,7 @@ 
Selección de aristas
 
 E(g) [ 3:5 %--% 5:6 ]

-
## + 3/9 edges from 68f945b (vertex names):
+
## + 3/9 edges from cabfb64 (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
@@ -733,7 +733,7 @@ 
Selección de aristas## [1] "Alejandra" "Carmina"   "Samira"

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

-
## + 5/9 edges from 68f945b (vertex names):
+
## + 5/9 edges from cabfb64 (vertex names):
 ## [1] Alejandra--Bruno  Alejandra--Moshe  Carmina  --Moshe  Carmina  --Nang  
 ## [5] Nang     --Samira

 

diff --git a/pkgdown.yml b/pkgdown.yml
index 85e5cb8906..04fdeb6f7c 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: 2024-11-30T18:18Z
+last_built: 2024-11-30T20:32Z
 urls:
   reference: https://r.igraph.org/reference
   article: https://r.igraph.org/articles
diff --git a/reference/E.html b/reference/E.html
index fd1ea508c7..f6c1cdde19 100644
--- a/reference/E.html
+++ b/reference/E.html
@@ -140,14 +140,14 @@ 
Examples
# Edges of an unnamed graph
 g <- make_ring(10)
 E(g)
-#> + 10/10 edges from bac2d7c:
+#> + 10/10 edges from 11d42ce:
 #>  [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 dae5a1c (vertex names):
+#> + 10/10 edges from c7f503a (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 91c0218393..5172bbf561 100644
--- a/reference/V.html
+++ b/reference/V.html
@@ -120,14 +120,14 @@ 
Examples
# Vertex ids of an unnamed graph
 g <- make_ring(10)
 V(g)
-#> + 10/10 vertices, from a2dbad0:
+#> + 10/10 vertices, from b5a4d5c:
 #>  [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 6f1f0b0:
+#> + 10/10 vertices, named, from 337108a:
 #>  [1] a b c d e f g h i j
 

     
diff --git a/reference/add_edges.html b/reference/add_edges.html
index ef2df34d1a..1ec833713d 100644
--- a/reference/add_edges.html
+++ b/reference/add_edges.html
@@ -135,7 +135,7 @@ 
Examples  set_edge_attr("color", value = "red") %>%
   add_edges(c(5, 1), color = "green")
 E(g)[[]]
-#> + 5/5 edges from 8c5d27f:
+#> + 5/5 edges from c3ee4e9:
 #>   tail head tid hid color
 #> 1    1    2   1   2   red
 #> 2    2    3   2   3   red
diff --git a/reference/add_vertices.html b/reference/add_vertices.html
index 3d82705536..9c0ad66556 100644
--- a/reference/add_vertices.html
+++ b/reference/add_vertices.html
@@ -126,12 +126,12 @@ 
Examples    4, 5
   ))
 g
-#> IGRAPH 3a534df D--- 5 4 -- 
+#> IGRAPH 6248d14 D--- 5 4 -- 
 #> + attr: color (v/c)
-#> + edges from 3a534df:
+#> + edges from 6248d14:
 #> [1] 1->2 2->3 3->4 4->5
 V(g)[[]]
-#> + 5/5 vertices, from 3a534df:
+#> + 5/5 vertices, from 6248d14:
 #>   color
 #> 1   red
 #> 2   red
diff --git a/reference/adjacent_vertices.html b/reference/adjacent_vertices.html
index be78b40a26..0d576540f3 100644
--- a/reference/adjacent_vertices.html
+++ b/reference/adjacent_vertices.html
@@ -100,11 +100,11 @@ 
Examples
g <- make_graph("Zachary")
 adjacent_vertices(g, c(1, 34))
 #> [[1]]
-#> + 16/34 vertices, from c5d70e9:
+#> + 16/34 vertices, from 0371e26:
 #>  [1]  2  3  4  5  6  7  8  9 11 12 13 14 18 20 22 32
 #> 
 #> [[2]]
-#> + 17/34 vertices, from c5d70e9:
+#> + 17/34 vertices, from 0371e26:
 #>  [1]  9 10 14 15 16 19 20 21 23 24 27 28 29 30 31 32 33
 #> 
 

diff --git a/reference/all_simple_paths.html b/reference/all_simple_paths.html
index 6d7e599510..a2ea24f2f7 100644
--- a/reference/all_simple_paths.html
+++ b/reference/all_simple_paths.html
@@ -120,28 +120,28 @@ 
Examplesg <- make_ring(10)
 all_simple_paths(g, 1, 5)
 #> [[1]]
-#> + 5/10 vertices, from ea4921c:
+#> + 5/10 vertices, from 3f40f0f:
 #> [1] 1 2 3 4 5
 #> 
 #> [[2]]
-#> + 7/10 vertices, from ea4921c:
+#> + 7/10 vertices, from 3f40f0f:
 #> [1]  1 10  9  8  7  6  5
 #> 
 all_simple_paths(g, 1, c(3, 5))
 #> [[1]]
-#> + 3/10 vertices, from ea4921c:
+#> + 3/10 vertices, from 3f40f0f:
 #> [1] 1 2 3
 #> 
 #> [[2]]
-#> + 5/10 vertices, from ea4921c:
+#> + 5/10 vertices, from 3f40f0f:
 #> [1] 1 2 3 4 5
 #> 
 #> [[3]]
-#> + 7/10 vertices, from ea4921c:
+#> + 7/10 vertices, from 3f40f0f:
 #> [1]  1 10  9  8  7  6  5
 #> 
 #> [[4]]
-#> + 9/10 vertices, from ea4921c:
+#> + 9/10 vertices, from 3f40f0f:
 #> [1]  1 10  9  8  7  6  5  4  3
 #> 
 
diff --git a/reference/are_adjacent.html b/reference/are_adjacent.html
index 7f7fa93bd5..fd55e21ac0 100644
--- a/reference/are_adjacent.html
+++ b/reference/are_adjacent.html
@@ -101,9 +101,9 @@ 
Examples

     
ug <- make_ring(10)
 ug
-#> IGRAPH 1b181c6 U--- 10 10 -- Ring graph
+#> IGRAPH 63d5661 U--- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 1b181c6:
+#> + edges from 63d5661:
 #>  [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 8c33890 D--- 10 10 -- Ring graph
+#> IGRAPH 9ed7b98 D--- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 8c33890:
+#> + edges from 9ed7b98:
 #>  [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/articulation_points.html b/reference/articulation_points.html
index 38225348f7..0fd8b3e95f 100644
--- a/reference/articulation_points.html
+++ b/reference/articulation_points.html
@@ -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 88d04bc:
+#> + 2/10 vertices, from 70960c8:
 #> [1] 6 1
 
 g <- make_graph("krackhardt_kite")
 bridges(g)
-#> + 2/18 edges from 8540041:
+#> + 2/18 edges from f3006f6:
 #> [1] 9--10 8-- 9
 
 

diff --git a/reference/as.igraph.html b/reference/as.igraph.html
index fda048f6c2..5f64805a51 100644
--- a/reference/as.igraph.html
+++ b/reference/as.igraph.html
@@ -86,9 +86,9 @@ 
Examplesg <- make_full_graph(5) + make_full_graph(5)
 hrg <- fit_hrg(g)
 as.igraph(hrg)
-#> IGRAPH c973d92 DN-- 19 18 -- Fitted HRG
+#> IGRAPH 8920ba2 DN-- 19 18 -- Fitted HRG
 #> + attr: name (g/c), name (v/c), prob (v/n)
-#> + edges from c973d92 (vertex names):
+#> + edges from 8920ba2 (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_adj_list.html b/reference/as_adj_list.html
index dd00a58a87..45bcff50a5 100644
--- a/reference/as_adj_list.html
+++ b/reference/as_adj_list.html
@@ -136,84 +136,84 @@ 
Examplesg <- make_ring(10)
 as_adj_list(g)
 #> [[1]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1]  2 10
 #> 
 #> [[2]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1] 1 3
 #> 
 #> [[3]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1] 2 4
 #> 
 #> [[4]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1] 3 5
 #> 
 #> [[5]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1] 4 6
 #> 
 #> [[6]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1] 5 7
 #> 
 #> [[7]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1] 6 8
 #> 
 #> [[8]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1] 7 9
 #> 
 #> [[9]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1]  8 10
 #> 
 #> [[10]]
-#> + 2/10 vertices, from af82f51:
+#> + 2/10 vertices, from 414fb98:
 #> [1] 1 9
 #> 
 as_adj_edge_list(g)
 #> [[1]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 1-- 2 1--10
 #> 
 #> [[2]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 1--2 2--3
 #> 
 #> [[3]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 2--3 3--4
 #> 
 #> [[4]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 3--4 4--5
 #> 
 #> [[5]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 4--5 5--6
 #> 
 #> [[6]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 5--6 6--7
 #> 
 #> [[7]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 6--7 7--8
 #> 
 #> [[8]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 7--8 8--9
 #> 
 #> [[9]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 8-- 9 9--10
 #> 
 #> [[10]]
-#> + 2/10 edges from af82f51:
+#> + 2/10 edges from 414fb98:
 #> [1] 1--10 9--10
 #> 
 
diff --git a/reference/as_directed.html b/reference/as_directed.html
index 8e9d1ce6bd..b1ca287e28 100644
--- a/reference/as_directed.html
+++ b/reference/as_directed.html
@@ -163,16 +163,16 @@ 
Examples

 g <- make_ring(10)
 as_directed(g, "mutual")
-#> IGRAPH 669eebf D--- 10 20 -- Ring graph
+#> IGRAPH 37dc62e D--- 10 20 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 669eebf:
+#> + edges from 37dc62e:
 #>  [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 1b99a6e U--- 10 10 -- Ring graph
+#> IGRAPH 02fc552 U--- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 1b99a6e:
+#> + edges from 02fc552:
 #>  [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 f7376b7 U-W- 10 10 -- Ring graph
+#> IGRAPH 5787b8b U-W- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), weight (e/n)
-#> + edges from f7376b7:
+#> + edges from 5787b8b:
 #>  [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 3d5c110 U-W- 10 7 -- 
+#> IGRAPH 7c140b7 U-W- 10 7 -- 
 #> + attr: weight (e/n)
-#> + edges from 3d5c110:
+#> + edges from 7c140b7:
 #> [1]  6-- 7  7-- 8  8-- 9  8-- 9  9-- 9 10--10 10--10
 
 

diff --git a/reference/as_graphnel.html b/reference/as_graphnel.html
index 6f3d6391c7..01a8222639 100644
--- a/reference/as_graphnel.html
+++ b/reference/as_graphnel.html
@@ -105,10 +105,10 @@ 
ExamplesGNEL <- as_graphnel(g)
 g2 <- graph_from_graphnel(GNEL)
 g2
-#> IGRAPH 41a62c9 UNW- 10 10 -- Ring graph
+#> IGRAPH d237569 UNW- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
 #> | (e/n)
-#> + edges from 41a62c9 (vertex names):
+#> + edges from d237569 (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 478d040 DNW- 10 9 -- In-star
+#> IGRAPH c8f67b7 DNW- 10 9 -- In-star
 #> + attr: name (g/c), mode (g/c), center (g/n), name (v/c), weight (e/n)
-#> + edges from 478d040 (vertex names):
+#> + edges from c8f67b7 (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/automorphism_group.html b/reference/automorphism_group.html
index c513ebc07a..d61bd093eb 100644
--- a/reference/automorphism_group.html
+++ b/reference/automorphism_group.html
@@ -148,11 +148,11 @@ 
Examplesg <- make_ring(10)
 automorphism_group(g)
 #> [[1]]
-#> + 10/10 vertices, from 930f4b6:
+#> + 10/10 vertices, from d3ae321:
 #>  [1]  1 10  9  8  7  6  5  4  3  2
 #> 
 #> [[2]]
-#> + 10/10 vertices, from 930f4b6:
+#> + 10/10 vertices, from d3ae321:
 #>  [1]  2  3  4  5  6  7  8  9 10  1
 #> 
 

diff --git a/reference/bfs.html b/reference/bfs.html
index 33c84e41cc..6aa2a9ea08 100644
--- a/reference/bfs.html
+++ b/reference/bfs.html
@@ -261,22 +261,22 @@ 
Examples#> [1] "out"
 #> 
 #> $order
-#> + 20/20 vertices, from 2e622ac:
+#> + 20/20 vertices, from 637a2e3:
 #>  [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 2e622ac:
+#> + 20/20 vertices, from 637a2e3:
 #>  [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 2e622ac:
+#> + 20/20 vertices, from 637a2e3:
 #>  [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 2e622ac:
+#> + 20/20 vertices, from 637a2e3:
 #>  [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 aa0e7e0:
+#> + 20/20 vertices, from 09f6dcf:
 #>  [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/bipartite_projection.html b/reference/bipartite_projection.html
index e4612ac281..250f34d3fe 100644
--- a/reference/bipartite_projection.html
+++ b/reference/bipartite_projection.html
@@ -167,15 +167,15 @@ 
Examplesg2$name <- "Event network"
 proj2 <- bipartite_projection(g2)
 print(proj2[[1]], g = TRUE, e = TRUE)
-#> IGRAPH ccb706a UNW- 5 6 -- Event network
+#> IGRAPH 7bfb01d UNW- 5 6 -- Event network
 #> + attr: name (g/c), name (v/c), weight (e/n)
-#> + edges from ccb706a (vertex names):
+#> + edges from 7bfb01d (vertex names):
 #> [1] Alice--Bob   Alice--Cecil Alice--Dan   Bob  --Cecil Bob  --Dan  
 #> [6] Cecil--Dan  
 print(proj2[[2]], g = TRUE, e = TRUE)
-#> IGRAPH 14306a8 UNW- 3 2 -- Event network
+#> IGRAPH fd7b304 UNW- 3 2 -- Event network
 #> + attr: name (g/c), name (v/c), weight (e/n)
-#> + edges from 14306a8 (vertex names):
+#> + edges from fd7b304 (vertex names):
 #> [1] Party --Skiing    Skiing--Badminton
 
 

diff --git a/reference/c.igraph.es.html b/reference/c.igraph.es.html
index 7a5b41ac8f..6e4431bd82 100644
--- a/reference/c.igraph.es.html
+++ b/reference/c.igraph.es.html
@@ -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 456b643 (vertex names):
+#> + 6/10 edges from 3316c08 (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 89a12ab3e1..d26260144c 100644
--- a/reference/c.igraph.vs.html
+++ b/reference/c.igraph.vs.html
@@ -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 bfecbdc:
+#> + 6/10 vertices, named, from bbf0071:
 #> [1] A A A B C D
 

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

diff --git a/reference/cohesive_blocks.html b/reference/cohesive_blocks.html
index 2de26b7a79..c76d97a87b 100644
--- a/reference/cohesive_blocks.html
+++ b/reference/cohesive_blocks.html
@@ -302,23 +302,23 @@ 
Examples#>    '- B-5   c 3, n  4   ......o.oo o......... ... 
 blocks(mwBlocks)
 #> [[1]]
-#> + 23/23 vertices, named, from c2f7640:
+#> + 23/23 vertices, named, from 805180a:
 #>  [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 c2f7640:
+#> + 14/23 vertices, named, from 805180a:
 #>  [1] 1  2  3  4  5  6  7  21 19 17 18 20 22 23
 #> 
 #> [[3]]
-#> + 10/23 vertices, named, from c2f7640:
+#> + 10/23 vertices, named, from 805180a:
 #>  [1] 7  8  11 14 9  10 12 13 16 15
 #> 
 #> [[4]]
-#> + 7/23 vertices, named, from c2f7640:
+#> + 7/23 vertices, named, from 805180a:
 #> [1] 1 2 3 4 5 6 7
 #> 
 #> [[5]]
-#> + 4/23 vertices, named, from c2f7640:
+#> + 4/23 vertices, named, from 805180a:
 #> [1] 7  8  11 14
 #> 
 cohesion(mwBlocks)
diff --git a/reference/complementer.html b/reference/complementer.html
index 36fd57321a..189ffba63b 100644
--- a/reference/complementer.html
+++ b/reference/complementer.html
@@ -117,9 +117,9 @@ 
Examples## Complementer of a ring
 g <- make_ring(10)
 complementer(g)
-#> IGRAPH 3d6c3d8 U--- 10 35 -- Ring graph
+#> IGRAPH c8bcad9 U--- 10 35 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 3d6c3d8:
+#> + edges from c8bcad9:
 #>  [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 2b2de90 U--- 10 45 -- 
+#> IGRAPH 427e8d0 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 2b2de90:
+#> + edges from 427e8d0:
 #>  [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/components.html b/reference/components.html
index 6d5305f1d4..0a41df768c 100644
--- a/reference/components.html
+++ b/reference/components.html
@@ -201,9 +201,9 @@ 
Examples#> [1] 17
 #> 
 largest_component(g)
-#> IGRAPH 4facc56 U--- 8 7 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 50654ec U--- 8 7 -- Erdos-Renyi (gnp) graph
 #> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from 4facc56:
+#> + edges from 50654ec:
 #> [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 4bb1f4f3a4..1a094e89a4 100644
--- a/reference/compose.html
+++ b/reference/compose.html
@@ -146,7 +146,7 @@ 
Examplesg2 <- make_star(10, mode = "undirected")
 gc <- compose(g1, g2)
 print_all(gc)
-#> IGRAPH 9d88871 U--- 10 36 -- 
+#> IGRAPH d35c910 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 57e04a3 U--- 10 24 -- 
+#> IGRAPH 881e330 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/contract.html b/reference/contract.html
index a7169e2ef9..bb1b85de7d 100644
--- a/reference/contract.html
+++ b/reference/contract.html
@@ -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 3b6cb82 UNW- 5 10 -- Ring
+#> IGRAPH e9f9042 UNW- 5 10 -- Ring
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
 #> | (e/n)
-#> + edges from 3b6cb82 (vertex names):
+#> + edges from e9f9042 (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/delete_edges.html b/reference/delete_edges.html
index 503aefb0cb..e63f999172 100644
--- a/reference/delete_edges.html
+++ b/reference/delete_edges.html
@@ -104,25 +104,25 @@ 
Examples
g <- make_ring(10) %>%
   delete_edges(seq(1, 9, by = 2))
 g
-#> IGRAPH 2feaab0 U--- 10 5 -- Ring graph
+#> IGRAPH 9c39334 U--- 10 5 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 2feaab0:
+#> + edges from 9c39334:
 #> [1] 2-- 3 4-- 5 6-- 7 8-- 9 1--10
 
 g <- make_ring(10) %>%
   delete_edges("10|1")
 g
-#> IGRAPH bd0a0cd U--- 10 9 -- Ring graph
+#> IGRAPH 3fd2a11 U--- 10 9 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from bd0a0cd:
+#> + edges from 3fd2a11:
 #> [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 79e3445 U--- 5 3 -- Ring graph
+#> IGRAPH c6a74c8 U--- 5 3 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 79e3445:
+#> + edges from c6a74c8:
 #> [1] 1--2 2--3 3--4
 

     
diff --git a/reference/delete_vertices.html b/reference/delete_vertices.html
index 0e8ad4632b..39a1bc77d7 100644
--- a/reference/delete_vertices.html
+++ b/reference/delete_vertices.html
@@ -101,23 +101,23 @@ 
Examples
g <- make_ring(10) %>%
   set_vertex_attr("name", value = LETTERS[1:10])
 g
-#> IGRAPH 7ed4b81 UN-- 10 10 -- Ring graph
+#> IGRAPH a1b94f8 UN-- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 7ed4b81 (vertex names):
+#> + edges from a1b94f8 (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 7ed4b81:
+#> + 10/10 vertices, named, from a1b94f8:
 #>  [1] A B C D E F G H I J
 
 g2 <- delete_vertices(g, c(1, 5)) %>%
   delete_vertices("B")
 g2
-#> IGRAPH eb9d5fb UN-- 7 5 -- Ring graph
+#> IGRAPH ecbe678 UN-- 7 5 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from eb9d5fb (vertex names):
+#> + edges from ecbe678 (vertex names):
 #> [1] C--D F--G G--H H--I I--J
 V(g2)
-#> + 7/7 vertices, named, from eb9d5fb:
+#> + 7/7 vertices, named, from ecbe678:
 #> [1] C D F G H I J
 

     
diff --git a/reference/dfs.html b/reference/dfs.html
index faf83afa59..ba2ca6af17 100644
--- a/reference/dfs.html
+++ b/reference/dfs.html
@@ -232,15 +232,15 @@ 
Examples#> [1] "out"
 #> 
 #> $order
-#> + 20/20 vertices, from a94a92b:
+#> + 20/20 vertices, from fafaa7d:
 #>  [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 a94a92b:
+#> + 20/20 vertices, from fafaa7d:
 #>  [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 a94a92b:
+#> + 20/20 vertices, from fafaa7d:
 #>  [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 88c10e99f3..9df23d8643 100644
--- a/reference/diameter.html
+++ b/reference/diameter.html
@@ -131,12 +131,12 @@ 
Examplesdiameter(g)
 #> [1] 27
 get_diameter(g)
-#> + 5/10 vertices, from 7be4f18:
+#> + 5/10 vertices, from c337fb4:
 #> [1]  1 10  9  8  7
 diameter(g, weights = NA)
 #> [1] 5
 get_diameter(g, weights = NA)
-#> + 6/10 vertices, from 7be4f18:
+#> + 6/10 vertices, from c337fb4:
 #> [1] 1 2 3 4 5 6
 
 

diff --git a/reference/difference.igraph.es.html b/reference/difference.igraph.es.html
index 932de5788d..f93729176b 100644
--- a/reference/difference.igraph.es.html
+++ b/reference/difference.igraph.es.html
@@ -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 676b75e:
+#> + 5/10 vertices, named, from 625fd7c:
 #> [1] A B C D E
 

     
diff --git a/reference/difference.igraph.html b/reference/difference.igraph.html
index c879bda7af..15844f8aa0 100644
--- a/reference/difference.igraph.html
+++ b/reference/difference.igraph.html
@@ -143,7 +143,7 @@ 
ExamplesV(sstar)$name <- letters[c(1, 3, 5, 7, 9, 11)]
 G <- wheel %m% sstar
 print_all(G)
-#> IGRAPH 1373ede UN-- 11 15 -- 
+#> IGRAPH b9f98c1 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 8965b25381..0bf1c659bf 100644
--- a/reference/difference.igraph.vs.html
+++ b/reference/difference.igraph.vs.html
@@ -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 4769dfe:
+#> + 5/10 vertices, named, from 7f8674b:
 #> [1] A B C D E
 

     
diff --git a/reference/disjoint_union.html b/reference/disjoint_union.html
index 50f4c391bc..90bf5a4cad 100644
--- a/reference/disjoint_union.html
+++ b/reference/disjoint_union.html
@@ -132,10 +132,10 @@ 
Examplesg2 <- make_ring(10)
 V(g2)$name <- letters[11:20]
 print_all(g1 %du% g2)
-#> IGRAPH 37f7ff4 UN-- 20 19 -- 
+#> IGRAPH 45768a2 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 37f7ff4 (vertex names):
+#> + edges from 45768a2 (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 09ce4796fb..211ff60db8 100644
--- a/reference/distances.html
+++ b/reference/distances.html
@@ -362,43 +362,43 @@ 
Examplesshortest_paths(g, 5)
 #> $vpath
 #> $vpath[[1]]
-#> + 5/10 vertices, from a309ada:
+#> + 5/10 vertices, from 387e7f7:
 #> [1] 5 4 3 2 1
 #> 
 #> $vpath[[2]]
-#> + 4/10 vertices, from a309ada:
+#> + 4/10 vertices, from 387e7f7:
 #> [1] 5 4 3 2
 #> 
 #> $vpath[[3]]
-#> + 3/10 vertices, from a309ada:
+#> + 3/10 vertices, from 387e7f7:
 #> [1] 5 4 3
 #> 
 #> $vpath[[4]]
-#> + 2/10 vertices, from a309ada:
+#> + 2/10 vertices, from 387e7f7:
 #> [1] 5 4
 #> 
 #> $vpath[[5]]
-#> + 1/10 vertex, from a309ada:
+#> + 1/10 vertex, from 387e7f7:
 #> [1] 5
 #> 
 #> $vpath[[6]]
-#> + 2/10 vertices, from a309ada:
+#> + 2/10 vertices, from 387e7f7:
 #> [1] 5 6
 #> 
 #> $vpath[[7]]
-#> + 3/10 vertices, from a309ada:
+#> + 3/10 vertices, from 387e7f7:
 #> [1] 5 6 7
 #> 
 #> $vpath[[8]]
-#> + 4/10 vertices, from a309ada:
+#> + 4/10 vertices, from 387e7f7:
 #> [1] 5 6 7 8
 #> 
 #> $vpath[[9]]
-#> + 5/10 vertices, from a309ada:
+#> + 5/10 vertices, from 387e7f7:
 #> [1] 5 6 7 8 9
 #> 
 #> $vpath[[10]]
-#> + 6/10 vertices, from a309ada:
+#> + 6/10 vertices, from 387e7f7:
 #> [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 a309ada:
+#> + 6/10 vertices, from 387e7f7:
 #> [1]  1 10  9  8  7  6
 #> 
 #> $vpaths[[2]]
-#> + 6/10 vertices, from a309ada:
+#> + 6/10 vertices, from 387e7f7:
 #> [1] 1 2 3 4 5 6
 #> 
 #> $vpaths[[3]]
-#> + 5/10 vertices, from a309ada:
+#> + 5/10 vertices, from 387e7f7:
 #> [1]  1 10  9  8  7
 #> 
 #> $vpaths[[4]]
-#> + 4/10 vertices, from a309ada:
+#> + 4/10 vertices, from 387e7f7:
 #> [1]  1 10  9  8
 #> 
 #> 
@@ -449,19 +449,19 @@ 
Examples#> 
 #> $res
 #> $res[[1]]
-#> + 6/10 vertices, from a309ada:
+#> + 6/10 vertices, from 387e7f7:
 #> [1]  1 10  9  8  7  6
 #> 
 #> $res[[2]]
-#> + 6/10 vertices, from a309ada:
+#> + 6/10 vertices, from 387e7f7:
 #> [1] 1 2 3 4 5 6
 #> 
 #> $res[[3]]
-#> + 5/10 vertices, from a309ada:
+#> + 5/10 vertices, from 387e7f7:
 #> [1]  1 10  9  8  7
 #> 
 #> $res[[4]]
-#> + 4/10 vertices, from a309ada:
+#> + 4/10 vertices, from 387e7f7:
 #> [1]  1 10  9  8
 #> 
 #> 
diff --git a/reference/edge.html b/reference/edge.html
index b80710f084..d1e8dc1cfb 100644
--- a/reference/edge.html
+++ b/reference/edge.html
@@ -120,7 +120,7 @@ 
Examples  edge("8|9")
 
 E(g)[[]]
-#> + 11/11 edges from 0182621:
+#> + 11/11 edges from 3d70890:
 #>    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 9c17124011..a643696998 100644
--- a/reference/edge_attr-set.html
+++ b/reference/edge_attr-set.html
@@ -111,10 +111,10 @@ 
Examples)
 edge_attr(g, "label") <- E(g)$name
 g
-#> IGRAPH 32253c8 U--- 10 10 -- Ring graph
+#> IGRAPH aa4030d 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 32253c8:
+#> + edges from aa4030d:
 #>  [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 13b2bf8234..a4996521bf 100644
--- a/reference/edge_attr.html
+++ b/reference/edge_attr.html
@@ -103,10 +103,10 @@ 
Examples  set_edge_attr("weight", value = 1:10) %>%
   set_edge_attr("color", value = "red")
 g
-#> IGRAPH a0ff4de U-W- 10 10 -- Ring graph
+#> IGRAPH c8acb1a U-W- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), weight (e/n), color
 #> | (e/c)
-#> + edges from a0ff4de:
+#> + edges from c8acb1a:
 #>  [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/ego.html b/reference/ego.html
index 188d977f2c..8293ff6098 100644
--- a/reference/ego.html
+++ b/reference/ego.html
@@ -250,82 +250,82 @@ 
Examples
 ego(g, order = 0, 1:3)
 #> [[1]]
-#> + 1/10 vertex, from c0c96f6:
+#> + 1/10 vertex, from df574fd:
 #> [1] 1
 #> 
 #> [[2]]
-#> + 1/10 vertex, from c0c96f6:
+#> + 1/10 vertex, from df574fd:
 #> [1] 2
 #> 
 #> [[3]]
-#> + 1/10 vertex, from c0c96f6:
+#> + 1/10 vertex, from df574fd:
 #> [1] 3
 #> 
 ego(g, order = 1, 1:3)
 #> [[1]]
-#> + 3/10 vertices, from c0c96f6:
+#> + 3/10 vertices, from df574fd:
 #> [1]  1  2 10
 #> 
 #> [[2]]
-#> + 3/10 vertices, from c0c96f6:
+#> + 3/10 vertices, from df574fd:
 #> [1] 2 1 3
 #> 
 #> [[3]]
-#> + 3/10 vertices, from c0c96f6:
+#> + 3/10 vertices, from df574fd:
 #> [1] 3 2 4
 #> 
 ego(g, order = 2, 1:3)
 #> [[1]]
-#> + 5/10 vertices, from c0c96f6:
+#> + 5/10 vertices, from df574fd:
 #> [1]  1  2 10  3  9
 #> 
 #> [[2]]
-#> + 5/10 vertices, from c0c96f6:
+#> + 5/10 vertices, from df574fd:
 #> [1]  2  1  3 10  4
 #> 
 #> [[3]]
-#> + 5/10 vertices, from c0c96f6:
+#> + 5/10 vertices, from df574fd:
 #> [1] 3 2 4 1 5
 #> 
 
 # neighborhood() is an alias of ego()
 neighborhood(g, order = 0, 1:3)
 #> [[1]]
-#> + 1/10 vertex, from c0c96f6:
+#> + 1/10 vertex, from df574fd:
 #> [1] 1
 #> 
 #> [[2]]
-#> + 1/10 vertex, from c0c96f6:
+#> + 1/10 vertex, from df574fd:
 #> [1] 2
 #> 
 #> [[3]]
-#> + 1/10 vertex, from c0c96f6:
+#> + 1/10 vertex, from df574fd:
 #> [1] 3
 #> 
 neighborhood(g, order = 1, 1:3)
 #> [[1]]
-#> + 3/10 vertices, from c0c96f6:
+#> + 3/10 vertices, from df574fd:
 #> [1]  1  2 10
 #> 
 #> [[2]]
-#> + 3/10 vertices, from c0c96f6:
+#> + 3/10 vertices, from df574fd:
 #> [1] 2 1 3
 #> 
 #> [[3]]
-#> + 3/10 vertices, from c0c96f6:
+#> + 3/10 vertices, from df574fd:
 #> [1] 3 2 4
 #> 
 neighborhood(g, order = 2, 1:3)
 #> [[1]]
-#> + 5/10 vertices, from c0c96f6:
+#> + 5/10 vertices, from df574fd:
 #> [1]  1  2 10  3  9
 #> 
 #> [[2]]
-#> + 5/10 vertices, from c0c96f6:
+#> + 5/10 vertices, from df574fd:
 #> [1]  2  1  3 10  4
 #> 
 #> [[3]]
-#> + 5/10 vertices, from c0c96f6:
+#> + 5/10 vertices, from df574fd:
 #> [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 7830edf UN-- 5 4 -- Ring graph
+#> IGRAPH 57bbb94 UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 7830edf (vertex names):
+#> + edges from 57bbb94 (vertex names):
 #> [1] a--b b--c a--j i--j
 #> 
 #> [[2]]
-#> IGRAPH 9412897 UN-- 5 4 -- Ring graph
+#> IGRAPH d1c588e UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 9412897 (vertex names):
+#> + edges from d1c588e (vertex names):
 #> [1] a--b b--c c--d a--j
 #> 
 #> [[3]]
-#> IGRAPH 7d45e84 UN-- 5 4 -- Ring graph
+#> IGRAPH 4a5c61b UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 7d45e84 (vertex names):
+#> + edges from 4a5c61b (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 ac39617 UN-- 5 4 -- Ring graph
+#> IGRAPH 2562fc5 UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from ac39617 (vertex names):
+#> + edges from 2562fc5 (vertex names):
 #> [1] a--b b--c a--j i--j
 #> 
 #> [[2]]
-#> IGRAPH 427f2d5 UN-- 5 4 -- Ring graph
+#> IGRAPH f6da17f UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 427f2d5 (vertex names):
+#> + edges from f6da17f (vertex names):
 #> [1] a--b b--c c--d a--j
 #> 
 #> [[3]]
-#> IGRAPH 803c758 UN-- 5 4 -- Ring graph
+#> IGRAPH f04b451 UN-- 5 4 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 803c758 (vertex names):
+#> + edges from f04b451 (vertex names):
 #> [1] a--b b--c c--d d--e
 #> 
 
diff --git a/reference/feedback_arc_set.html b/reference/feedback_arc_set.html
index 8c46476cfe..ea02857457 100644
--- a/reference/feedback_arc_set.html
+++ b/reference/feedback_arc_set.html
@@ -142,10 +142,10 @@ 
Examples

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

     
diff --git a/reference/get_edge_ids.html b/reference/get_edge_ids.html
index fc7aa5b5fb..2b3cf3e11a 100644
--- a/reference/get_edge_ids.html
+++ b/reference/get_edge_ids.html
@@ -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 89e8c54:
+#> + 2/10 edges from e627d71:
 #> [1] 1--2 4--5
 
 ## non-existant edge
@@ -139,7 +139,7 @@ 
Exampleseis
 #> [1] 5 5
 E(g)[eis]
-#> + 2/5 edges from b191208:
+#> + 2/5 edges from 6e4e0e6:
 #> [1] 1->2 1->2
 
 

diff --git a/reference/girth.html b/reference/girth.html
index 1cf3cf96bc..676e4e6aa3 100644
--- a/reference/girth.html
+++ b/reference/girth.html
@@ -139,7 +139,7 @@ 
Examples#> [1] Inf
 #> 
 #> $circle
-#> + 0/1000 vertices, from 774089b:
+#> + 0/1000 vertices, from e1c36a0:
 #> 
 
 # The worst case running time is for a ring
@@ -149,7 +149,7 @@ 
Examples#> [1] 100
 #> 
 #> $circle
-#> + 100/100 vertices, from bd9d22b:
+#> + 100/100 vertices, from dc5dd65:
 #>   [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 dcaf177:
+#> + 12/1000 vertices, from 1afde48:
 #>  [1] 903 811 514 822 850 938 125 275 732 518 446 475
 #> 
 
diff --git a/reference/graph_.html b/reference/graph_.html
index 5384117018..c592ab94e5 100644
--- a/reference/graph_.html
+++ b/reference/graph_.html
@@ -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 11c4e1b U--- 6 5 -- 
-#> + edges from 11c4e1b:
+#> IGRAPH 1fab820 U--- 6 5 -- 
+#> + edges from 1fab820:
 #> [1] 1--2 2--3 3--4 4--5 5--6
 graph_(cbind(1:5, 2:6), from_edgelist(), directed = FALSE)
-#> IGRAPH 2fda9d5 U--- 6 5 -- 
-#> + edges from 2fda9d5:
+#> IGRAPH 8394588 U--- 6 5 -- 
+#> + edges from 8394588:
 #> [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 987f817d62..197765adf3 100644
--- a/reference/graph_attr-set.html
+++ b/reference/graph_attr-set.html
@@ -101,9 +101,9 @@ 
Examples
g <- make_graph(~ A - B:C:D)
 graph_attr(g, "name") <- "4-star"
 g
-#> IGRAPH 0f2266a UN-- 4 3 -- 4-star
+#> IGRAPH 6b68b14 UN-- 4 3 -- 4-star
 #> + attr: name (g/c), name (v/c)
-#> + edges from 0f2266a (vertex names):
+#> + edges from 6b68b14 (vertex names):
 #> [1] A--B A--C A--D
 
 graph_attr(g) <- list(
diff --git a/reference/graph_center.html b/reference/graph_center.html
index 06478e3f58..77a129d440 100644
--- a/reference/graph_center.html
+++ b/reference/graph_center.html
@@ -107,13 +107,13 @@ 
Examples

     
tree <- make_tree(100, 7)
 graph_center(tree)
-#> + 2/100 vertices, from 7e02fa0:
+#> + 2/100 vertices, from a785f32:
 #> [1] 1 2
 graph_center(tree, mode = "in")
-#> + 1/100 vertex, from 7e02fa0:
+#> + 1/100 vertex, from a785f32:
 #> [1] 1
 graph_center(tree, mode = "out")
-#> + 85/100 vertices, from 7e02fa0:
+#> + 85/100 vertices, from a785f32:
 #>  [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 76b4059:
+#> + 10/10 vertices, from 1d64daa:
 #>  [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 76b4059:
+#> + 1/10 vertex, from 1d64daa:
 #> [1] 7
 
 

diff --git a/reference/graph_from_adjacency_matrix.html b/reference/graph_from_adjacency_matrix.html
index 53605cd2af..27705015a5 100644
--- a/reference/graph_from_adjacency_matrix.html
+++ b/reference/graph_from_adjacency_matrix.html
@@ -309,7 +309,7 @@ 
Examples  add.rownames = "code"
 )
 summary(g10)
-#> IGRAPH 05c5d39 DNW- 10 56 -- 
+#> IGRAPH 3a728df 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 c622a69351..f413eaad45 100644
--- a/reference/graph_from_atlas.html
+++ b/reference/graph_from_atlas.html
@@ -127,14 +127,14 @@ 
See alsoExamples

     
## Some randomly picked graphs from the atlas
 graph_from_atlas(sample(0:1252, 1))
-#> IGRAPH d360c71 U--- 7 11 -- Graph from the Atlas #766
+#> IGRAPH af0fbbb U--- 7 11 -- Graph from the Atlas #766
 #> + attr: name (g/c), n (g/n)
-#> + edges from d360c71:
+#> + edges from af0fbbb:
 #>  [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 2a5f2de U--- 7 12 -- Graph from the Atlas #893
+#> IGRAPH ffc062a U--- 7 12 -- Graph from the Atlas #893
 #> + attr: name (g/c), n (g/n)
-#> + edges from 2a5f2de:
+#> + edges from ffc062a:
 #>  [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 15aff115e9..c610a6de4c 100644
--- a/reference/graph_from_biadjacency_matrix.html
+++ b/reference/graph_from_biadjacency_matrix.html
@@ -150,9 +150,9 @@ 
Examplescolnames(inc) <- letters[1:5]
 rownames(inc) <- LETTERS[1:3]
 graph_from_biadjacency_matrix(inc)
-#> IGRAPH 9161e5b UN-B 8 9 -- 
+#> IGRAPH 1aa59a1 UN-B 8 9 -- 
 #> + attr: type (v/l), name (v/c)
-#> + edges from 9161e5b (vertex names):
+#> + edges from 1aa59a1 (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 76b7a32908..2463ae5122 100644
--- a/reference/graph_from_data_frame.html
+++ b/reference/graph_from_data_frame.html
@@ -194,10 +194,10 @@ 
Examples)
 g <- graph_from_data_frame(relations, directed = TRUE, vertices = actors)
 print(g, e = TRUE, v = TRUE)
-#> IGRAPH 376407a DN-- 5 6 -- 
+#> IGRAPH 0711adc 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 376407a (vertex names):
+#> + edges from 0711adc (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 b47d6a6f26..b508c3b9d4 100644
--- a/reference/graph_from_edgelist.html
+++ b/reference/graph_from_edgelist.html
@@ -110,15 +110,15 @@ 
See alsoExamples

     
el <- matrix(c("foo", "bar", "bar", "foobar"), nc = 2, byrow = TRUE)
 graph_from_edgelist(el)
-#> IGRAPH 1ac5f5b DN-- 3 2 -- 
+#> IGRAPH d3e8f71 DN-- 3 2 -- 
 #> + attr: name (v/c)
-#> + edges from 1ac5f5b (vertex names):
+#> + edges from d3e8f71 (vertex names):
 #> [1] foo->bar    bar->foobar
 
 # Create a ring by hand
 graph_from_edgelist(cbind(1:10, c(2:10, 1)))
-#> IGRAPH a2cfb7e D--- 10 10 -- 
-#> + edges from a2cfb7e:
+#> IGRAPH 7374ce6 D--- 10 10 -- 
+#> + edges from 7374ce6:
 #>  [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_graphnel.html b/reference/graph_from_graphnel.html
index c5318f3759..181c020064 100644
--- a/reference/graph_from_graphnel.html
+++ b/reference/graph_from_graphnel.html
@@ -133,10 +133,10 @@ 
ExamplesGNEL <- as_graphnel(g)
 g2 <- graph_from_graphnel(GNEL)
 g2
-#> IGRAPH a9883f1 UNW- 10 10 -- Ring graph
+#> IGRAPH 4c4413d UNW- 10 10 -- Ring graph
 #> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
 #> | (e/n)
-#> + edges from a9883f1 (vertex names):
+#> + edges from 4c4413d (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 f0a50ae DNW- 10 9 -- In-star
+#> IGRAPH a4b1011 DNW- 10 9 -- In-star
 #> + attr: name (g/c), mode (g/c), center (g/n), name (v/c), weight (e/n)
-#> + edges from f0a50ae (vertex names):
+#> + edges from a4b1011 (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_literal.html b/reference/graph_from_literal.html
index 37ac8874da..d06362ee9d 100644
--- a/reference/graph_from_literal.html
+++ b/reference/graph_from_literal.html
@@ -146,18 +146,18 @@ 
Examples  Cecil - Gordon
 )
 g
-#> IGRAPH d9b94b4 UN-- 6 6 -- 
+#> IGRAPH f20d1ee UN-- 6 6 -- 
 #> + attr: name (v/c)
-#> + edges from d9b94b4 (vertex names):
+#> + edges from f20d1ee (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 ed1770e UN-- 6 7 -- 
+#> IGRAPH 464bc4c UN-- 6 7 -- 
 #> + attr: name (v/c)
-#> + edges from ed1770e (vertex names):
+#> + edges from 464bc4c (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 20e3bc5 DN-- 7 6 -- 
+#> IGRAPH f70b99a DN-- 7 6 -- 
 #> + attr: name (v/c)
-#> + edges from 20e3bc5 (vertex names):
+#> + edges from f70b99a (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 8f6bd25 UN-- 6 2 -- 
+#> IGRAPH f4fe2b5 UN-- 6 2 -- 
 #> + attr: name (v/c)
-#> + edges from 8f6bd25 (vertex names):
+#> + edges from f4fe2b5 (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 0a22070 DN-- 2 2 -- 
+#> IGRAPH 41a21ab DN-- 2 2 -- 
 #> + attr: name (v/c)
-#> + edges from 0a22070 (vertex names):
+#> + edges from 41a21ab (vertex names):
 #> [1] Alice->Bob   Bob  ->Alice
 
 # Special vertex names
 g6 <- graph_from_literal("+" -- "-", "*" -- "/", "%%" -- "%/%")
 g6
-#> IGRAPH 2cde184 UN-- 6 3 -- 
+#> IGRAPH 6700e87 UN-- 6 3 -- 
 #> + attr: name (v/c)
-#> + edges from 2cde184 (vertex names):
+#> + edges from 6700e87 (vertex names):
 #> [1] + ---   * --/   %%--%/%
 
 

diff --git a/reference/graph_id.html b/reference/graph_id.html
index e21e524002..f271b176f6 100644
--- a/reference/graph_id.html
+++ b/reference/graph_id.html
@@ -83,15 +83,15 @@ 
Value
Examples

     
g <- make_ring(10)
 graph_id(g)
-#> [1] "2e3305a7-5614-433b-bd49-46190be07398"
+#> [1] "a00b253c-3bdc-4787-801e-56b258b027ab"
 graph_id(V(g))
-#> [1] "2e3305a7-5614-433b-bd49-46190be07398"
+#> [1] "a00b253c-3bdc-4787-801e-56b258b027ab"
 graph_id(E(g))
-#> [1] "2e3305a7-5614-433b-bd49-46190be07398"
+#> [1] "a00b253c-3bdc-4787-801e-56b258b027ab"
 
 g2 <- g + 1
 graph_id(g2)
-#> [1] "db1aa8ec-5b2f-407d-acdc-c8cae9a35e10"
+#> [1] "50fc7974-59a1-4424-93b8-a7694ec9f76a"
 

     
   

     
diff --git a/reference/igraph-es-indexing.html b/reference/igraph-es-indexing.html
index fcad15df58..ba8da08da2 100644
--- a/reference/igraph-es-indexing.html
+++ b/reference/igraph-es-indexing.html
@@ -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 3d87d0e:
+#> + 4/99 edges from 37d1484:
 #> [1] 2->1 3->1 4->1 6->1
 E(g)[1:5 %->% 1:6]
-#> + 4/99 edges from 3d87d0e:
+#> + 4/99 edges from 37d1484:
 #> [1] 2->1 3->1 4->1 5->4
 E(g)[1:3 %<-% 2:6]
-#> + 4/99 edges from 3d87d0e:
+#> + 4/99 edges from 37d1484:
 #> [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 b2e474c:
+#> + 11/99 edges from 8b26a89:
 #>  [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 122dfd6:
+#> + 19/32 edges from 83d30ce:
 #>    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 122dfd6:
+#> + 1/32 edge from 83d30ce:
 #> [1] 1--6
 
 

diff --git a/reference/igraph-es-indexing2.html b/reference/igraph-es-indexing2.html
index 8eb7a4ad3d..2e1dc722d0 100644
--- a/reference/igraph-es-indexing2.html
+++ b/reference/igraph-es-indexing2.html
@@ -120,10 +120,10 @@ 
Examples  with_edge_(weight = 1:10, color = "green")
 )
 E(g)
-#> + 10/10 edges from 092d7d8 (vertex names):
+#> + 10/10 edges from 069065c (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 092d7d8 (vertex names):
+#> + 10/10 edges from 069065c (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 092d7d8 (vertex names):
+#> + 2/10 edges from 069065c (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-vs-indexing.html b/reference/igraph-vs-indexing.html
index 54c16dc685..34eb2f83df 100644
--- a/reference/igraph-vs-indexing.html
+++ b/reference/igraph-vs-indexing.html
@@ -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 eb7ae20:
+#> + 4/4 vertices, from 5b5c2ea:
 #> [1] 1 2 3 4
 V(g)[.nei(c(2, 4), "in")]
-#> + 3/4 vertices, from eb7ae20:
+#> + 3/4 vertices, from 5b5c2ea:
 #> [1] 1 2 4
 V(g)[.nei(c(2, 4), "out")]
-#> + 3/4 vertices, from eb7ae20:
+#> + 3/4 vertices, from 5b5c2ea:
 #> [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 d765ec8:
+#> + 4/4 vertices, named, from ffb80c2:
 #> [1] A B C D
 V(g)[.nei(c("B", "D"), "in")]
-#> + 3/4 vertices, named, from d765ec8:
+#> + 3/4 vertices, named, from ffb80c2:
 #> [1] A B D
 V(g)[.nei(c("B", "D"), "out")]
-#> + 3/4 vertices, named, from d765ec8:
+#> + 3/4 vertices, named, from ffb80c2:
 #> [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 c2a2b0c:
+#> + 2/4 vertices, named, from d128a76:
 #> [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 c2a2b0c:
+#> + 1/4 vertex, named, from d128a76:
 #> [1] B
 
 

diff --git a/reference/igraph-vs-indexing2.html b/reference/igraph-vs-indexing2.html
index d50de6958e..bfd3d7c51c 100644
--- a/reference/igraph-vs-indexing2.html
+++ b/reference/igraph-vs-indexing2.html
@@ -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 d17acc1:
+#> + 10/10 vertices, named, from dd300f1:
 #>  [1] A B C D E F G H I J
 V(g)[[]]
-#> + 10/10 vertices, named, from d17acc1:
+#> + 10/10 vertices, named, from dd300f1:
 #>    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 d17acc1:
+#> + 5/10 vertices, named, from dd300f1:
 #> [1] A B C D E
 V(g)[[1:5]]
-#> + 5/10 vertices, named, from d17acc1:
+#> + 5/10 vertices, named, from dd300f1:
 #>   color name
 #> 1   red    A
 #> 2   red    B
diff --git a/reference/incident.html b/reference/incident.html
index 7d66f8471a..54140a78b1 100644
--- a/reference/incident.html
+++ b/reference/incident.html
@@ -97,11 +97,11 @@ 
See alsoExamples

     
g <- make_graph("Zachary")
 incident(g, 1)
-#> + 16/78 edges from 607a747:
+#> + 16/78 edges from 4014a00:
 #>  [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 607a747:
+#> + 17/78 edges from 4014a00:
 #>  [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 5a456db780..2ea65c1b72 100644
--- a/reference/incident_edges.html
+++ b/reference/incident_edges.html
@@ -100,12 +100,12 @@ 
Examples
g <- make_graph("Zachary")
 incident_edges(g, c(1, 34))
 #> [[1]]
-#> + 16/78 edges from ea43813:
+#> + 16/78 edges from 64b323d:
 #>  [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 ea43813:
+#> + 17/78 edges from 64b323d:
 #>  [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/intersection.igraph.es.html b/reference/intersection.igraph.es.html
index f902566d1b..3c9cfaacbe 100644
--- a/reference/intersection.igraph.es.html
+++ b/reference/intersection.igraph.es.html
@@ -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 20e6438 (vertex names):
+#> + 2/10 edges from 888f962 (vertex names):
 #> [1] E--F F--G
 

     
diff --git a/reference/intersection.igraph.html b/reference/intersection.igraph.html
index 2ac150ca30..f4c8c918fa 100644
--- a/reference/intersection.igraph.html
+++ b/reference/intersection.igraph.html
@@ -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 dc54949 UN-- 13 4 -- 
+#> IGRAPH ca651d4 UN-- 13 4 -- 
 #> + attr: name (v/c)
 #> + vertex attributes:
 #> |      name
@@ -158,7 +158,7 @@ 
Examples#> | [11]    Y
 #> | [12]    X
 #> | [13]    Z
-#> + edges from dc54949 (vertex names):
+#> + edges from ca651d4 (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 19c81ed632..10cec77cb1 100644
--- a/reference/intersection.igraph.vs.html
+++ b/reference/intersection.igraph.vs.html
@@ -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 c772abd (vertex names):
+#> + 2/10 edges from ce5e1b0 (vertex names):
 #> [1] E--F F--G
 

     
diff --git a/reference/is_chordal.html b/reference/is_chordal.html
index e53ccba171..7fcb949297 100644
--- a/reference/is_chordal.html
+++ b/reference/is_chordal.html
@@ -152,7 +152,7 @@ 
Examples#> [1] 9 4 6 8 3 5 7 2 1
 #> 
 #> $alpham1
-#> + 9/9 vertices, named, from 07d9486:
+#> + 9/9 vertices, named, from a69fab4:
 #> [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 4d55c10:
+#> + 10/10 vertices, named, from 431073c:
 #>  [1] J H I G C F D B E A
 #> 
 is_chordal(g2, fillin = TRUE)
diff --git a/reference/is_forest.html b/reference/is_forest.html
index 6a84d011f9..666cf6335f 100644
--- a/reference/is_forest.html
+++ b/reference/is_forest.html
@@ -122,7 +122,7 @@ 
Examples#> [1] TRUE
 #> 
 #> $roots
-#> + 2/8 vertices, from 63da6e0:
+#> + 2/8 vertices, from 708516e:
 #> [1] 1 4
 #> 
 
diff --git a/reference/is_named.html b/reference/is_named.html
index e473e5dd8a..9c356064d8 100644
--- a/reference/is_named.html
+++ b/reference/is_named.html
@@ -95,7 +95,7 @@ 
Examplesis_named(g)
 #> [1] TRUE
 neighbors(g, "a")
-#> + 2/10 vertices, named, from ad37912:
+#> + 2/10 vertices, named, from 760936d:
 #> [1] b j
diff --git a/reference/is_separator.html b/reference/is_separator.html index a3842d5419..b543c6f7f5 100644 --- a/reference/is_separator.html +++ b/reference/is_separator.html @@ -108,11 +108,11 @@

Examples
ring <- make_ring(4)
 min_st_separators(ring)
 #> [[1]]
-#> + 2/4 vertices, from f99c323:
+#> + 2/4 vertices, from 49f7d49:
 #> [1] 2 4
 #> 
 #> [[2]]
-#> + 2/4 vertices, from f99c323:
+#> + 2/4 vertices, from 49f7d49:
 #> [1] 1 3
 #> 
 is_separator(ring, 1)
diff --git a/reference/is_tree.html b/reference/is_tree.html
index 3e906dfe4e..1e2df5ee67 100644
--- a/reference/is_tree.html
+++ b/reference/is_tree.html
@@ -123,7 +123,7 @@ 
Examples#> [1] TRUE
 #> 
 #> $root
-#> + 1/7 vertex, from 9863bf3:
+#> + 1/7 vertex, from 3a827e4:
 #> [1] 1
 #> 
 
diff --git a/reference/is_weighted.html b/reference/is_weighted.html
index 9e979e1943..d051bf294a 100644
--- a/reference/is_weighted.html
+++ b/reference/is_weighted.html
@@ -91,7 +91,7 @@ 
Examplesshortest_paths(g, 8, 2)
 #> $vpath
 #> $vpath[[1]]
-#> + 5/10 vertices, from 9634e06:
+#> + 5/10 vertices, from b0de97f:
 #> [1]  8  9 10  1  2
 #> 
 #> 
@@ -108,7 +108,7 @@ 
Examplesshortest_paths(g, 8, 2)
 #> $vpath
 #> $vpath[[1]]
-#> + 7/10 vertices, from 9634e06:
+#> + 7/10 vertices, from b0de97f:
 #> [1] 8 7 6 5 4 3 2
 #> 
 #> 
diff --git a/reference/ivs.html b/reference/ivs.html
index 7c9a9c54ba..fd093ab7a6 100644
--- a/reference/ivs.html
+++ b/reference/ivs.html
@@ -143,83 +143,83 @@ 
Examples#> [1] 4
 ivs(g, min = ivs_size(g))
 #> [[1]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  7 37 55 56
 #> 
 #> [[2]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  7 55 56 69
 #> 
 #> [[3]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  7 56 69 74
 #> 
 #> [[4]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  8 15 73 80
 #> 
 #> [[5]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  8 15 73 84
 #> 
 #> [[6]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1] 13 16 37 40
 #> 
 #> [[7]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1] 21 32 45 61
 #> 
 #> [[8]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1] 22 55 56 64
 #> 
 #> [[9]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1] 23 69 75 90
 #> 
 largest_ivs(g)
 #> [[1]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1] 21 32 45 61
 #> 
 #> [[2]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  7 37 55 56
 #> 
 #> [[3]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  7 55 56 69
 #> 
 #> [[4]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  7 56 69 74
 #> 
 #> [[5]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  8 15 73 80
 #> 
 #> [[6]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1]  8 15 73 84
 #> 
 #> [[7]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1] 22 55 56 64
 #> 
 #> [[8]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1] 23 69 75 90
 #> 
 #> [[9]]
-#> + 4/100 vertices, from a790bf5:
+#> + 4/100 vertices, from e136bfe:
 #> [1] 13 16 37 40
 #> 
 # Empty graph
 induced_subgraph(g, largest_ivs(g)[[1]])
-#> IGRAPH 56be2e6 U--- 4 0 -- Erdos-Renyi (gnp) graph
+#> IGRAPH fa5b58d U--- 4 0 -- Erdos-Renyi (gnp) graph
 #> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from 56be2e6:
+#> + edges from fa5b58d:
 
 length(max_ivs(g))
 #> [1] 326
diff --git a/reference/keeping_degseq.html b/reference/keeping_degseq.html
index 11e7d132d1..13a982420c 100644
--- a/reference/keeping_degseq.html
+++ b/reference/keeping_degseq.html
@@ -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 1f2d770 U--- 10 10 -- Ring graph
+#> IGRAPH d69b363 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 1f2d770:
+#> + edges from d69b363:
 #>  [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/make_bipartite_graph.html b/reference/make_bipartite_graph.html index f019d72bbb..358cd4634d 100644 --- a/reference/make_bipartite_graph.html +++ b/reference/make_bipartite_graph.html @@ -121,9 +121,9 @@

Examples

 g <- make_bipartite_graph(rep(0:1, length.out = 10), c(1:10))
 print(g, v = TRUE)
-#> IGRAPH 673e0f2 U--B 10 5 -- 
+#> IGRAPH aaf6c47 U--B 10 5 -- 
 #> + attr: type (v/l)
-#> + edges from 673e0f2:
+#> + edges from aaf6c47:
 #> [1] 1-- 2 3-- 4 5-- 6 7-- 8 9--10
diff --git a/reference/make_de_bruijn_graph.html b/reference/make_de_bruijn_graph.html index 7a49b9034c..98033ab319 100644 --- a/reference/make_de_bruijn_graph.html +++ b/reference/make_de_bruijn_graph.html @@ -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 c9c7022 D--- 4 8 -- De-Bruijn graph 2-2 +#> IGRAPH 5b1208c D--- 4 8 -- De-Bruijn graph 2-2 #> + attr: name (g/c), m (g/n), n (g/n) -#> + edges from c9c7022: +#> + edges from 5b1208c: #> [1] 1->1 1->2 2->3 2->4 3->1 3->2 4->3 4->4 make_line_graph(g) -#> IGRAPH d3bf652 D--- 4 8 -- Line graph +#> IGRAPH 824afed D--- 4 8 -- Line graph #> + attr: name (g/c) -#> + edges from d3bf652: +#> + edges from 824afed: #> [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 34a1545146..c5fcafd797 100644 --- a/reference/make_empty_graph.html +++ b/reference/make_empty_graph.html @@ -98,11 +98,11 @@