Creating a graphWe can print the graph to get a summary of its nodes and edges:
g
-## IGRAPH 5c84465 UN-- 10 2 --
+## IGRAPH abbe0d0 UN-- 10 2 --
## + attr: name (v/c)
-## + edges from 5c84465 (vertex names):
+## + edges from abbe0d0 (vertex names):
## [1] 1--2 1--5
This means: Undirected Named graph
with 10 vertices and 2 edges, with the
@@ -165,7 +165,7 @@
Creating a graph
summary(g)
-## IGRAPH 5c84465 UN-- 10 2 --
+## IGRAPH abbe0d0 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
@@ -246,9 +246,9 @@
Adding/deleting vertices and edges add_vertices(3) %>%
add_edges(edges = c(38, 39, 39, 40, 40, 38, 40, 37))
g
-## IGRAPH bc682d0 U--- 40 86 -- Zachary
+## IGRAPH 35e9b51 U--- 40 86 -- Zachary
## + attr: name (g/c)
-## + edges from bc682d0:
+## + edges from 35e9b51:
## [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
@@ -340,7 +340,7 @@ Constructing graphs
graph1 <- make_tree(127, 2, mode = "undirected")
summary(graph1)
-## IGRAPH 1a6f995 U--- 127 126 -- Tree
+## IGRAPH 240ae4d 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
@@ -357,7 +357,7 @@
Constructing graphs
graph1 <- sample_grg(100, 0.2)
summary(graph1)
-## IGRAPH 079e78d U--- 100 524 -- Geometric random graph
+## IGRAPH dc00647 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
@@ -412,7 +412,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 d9e7195 UN-- 7 9 --
+## IGRAPH c948d99 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
@@ -456,7 +456,7 @@
Setting and retrieving attributes
V(g)$name[1:3] <- c("Alejandra", "Bruno", "Carmina")
V(g)
-## + 7/7 vertices, named, from d9e7195:
+## + 7/7 vertices, named, from c948d99:
## [1] Alejandra Bruno Carmina Moshe Nang Samira Ibrahim
To delete attributes:
@@ -573,12 +573,12 @@ Selecting vertices
seq <- V(graph)[2, 3, 7]
seq
-## + 3/10 vertices, from 377ae09:
+## + 3/10 vertices, from cf29e7e:
## [1] 2 3 7
seq <- seq[1, 3] # filtering an existing vertex set
seq
-## + 2/10 vertices, from 377ae09:
+## + 2/10 vertices, from cf29e7e:
## [1] 2 7
Selecting a vertex that does not exist results in an error:
@@ -674,12 +674,12 @@ Selecting edges
-## + 4/9 edges from d9e7195 (vertex names):
+## + 4/9 edges from c948d99 (vertex names):
## [1] Alejandra--Carmina Carmina --Moshe Carmina --Nang Carmina --Samira
Of course it also works with vertex names:
-## + 4/9 edges from d9e7195 (vertex names):
+## + 4/9 edges from c948d99 (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
@@ -694,7 +694,7 @@
Selecting edges
-## + 3/9 edges from d9e7195 (vertex names):
+## + 3/9 edges from c948d99 (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
@@ -713,7 +713,7 @@
Selecting edges## [1] "Alejandra" "Carmina" "Samira"
-## + 5/9 edges from d9e7195 (vertex names):
+## + 5/9 edges from c948d99 (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 6edb5273f4..a2a98dff65 100644
--- a/articles/igraph_ES.html
+++ b/articles/igraph_ES.html
@@ -155,9 +155,9 @@ Crear un grafo
g
-## IGRAPH b91ccde UN-- 10 2 --
+## IGRAPH 8b28aea UN-- 10 2 --
## + attr: name (v/c)
-## + edges from b91ccde (vertex names):
+## + edges from 8b28aea (vertex names):
## [1] 1--2 1--5
Esto significa: grafo no dirigido (Undirected) con
10 vértices y 2 aristas, que se
@@ -169,7 +169,7 @@
Crear un grafo
summary(g)
-## IGRAPH b91ccde UN-- 10 2 --
+## IGRAPH 8b28aea 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
@@ -256,9 +256,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 6361873 U--- 40 86 -- Zachary
+## IGRAPH 76c25c4 U--- 40 86 -- Zachary
## + attr: name (g/c)
-## + edges from 6361873:
+## + edges from 76c25c4:
## [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
@@ -354,7 +354,7 @@ Construcción de grafos
graph1 <- make_tree(127, 2, mode = "undirected")
summary(g)
-## IGRAPH 352f0f7 U--- 5 3 -- Ring graph
+## IGRAPH ad7c1d1 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
@@ -371,7 +371,7 @@
Construcción de grafos
graph1 <- sample_grg(100, 0.2)
summary(graph1)
-## IGRAPH 9075e90 U--- 100 524 -- Geometric random graph
+## IGRAPH f59e493 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
@@ -429,7 +429,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 cd3f446 UN-- 7 9 --
+## IGRAPH 0accdcd 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
@@ -477,7 +477,7 @@
Establecer y recuperar atributos
V(g)$name[1:3] <- c("Alejandra", "Bruno", "Carmina")
V(g)
-## + 7/7 vertices, named, from cd3f446:
+## + 7/7 vertices, named, from 0accdcd:
## [1] Alejandra Bruno Carmina Moshe Nang Samira Ibrahim
Para eliminar atributos:
@@ -597,12 +597,12 @@ Selección de vértices
seq <- V(graph)[2, 3, 7]
seq
-## + 3/10 vertices, from b21840d:
+## + 3/10 vertices, from c42145e:
## [1] 2 3 7
seq <- seq[1, 3] # filtrar un conjunto de vértices existente
seq
-## + 2/10 vertices, from b21840d:
+## + 2/10 vertices, from c42145e:
## [1] 2 7
Al seleccionar un vértice que no existe se produce un error:
@@ -697,12 +697,12 @@ Selección de aristas
-## + 4/9 edges from cd3f446 (vertex names):
+## + 4/9 edges from 0accdcd (vertex names):
## [1] Alejandra--Carmina Carmina --Moshe Carmina --Nang Carmina --Samira
Por supuesto, también funciona con nombres de vértices:
-## + 4/9 edges from cd3f446 (vertex names):
+## + 4/9 edges from 0accdcd (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
@@ -719,7 +719,7 @@
Selección de aristas
-## + 3/9 edges from cd3f446 (vertex names):
+## + 3/9 edges from 0accdcd (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
@@ -739,7 +739,7 @@
Selección de aristas## [1] "Alejandra" "Carmina" "Samira"
-## + 5/9 edges from cd3f446 (vertex names):
+## + 5/9 edges from 0accdcd (vertex names):
## [1] Alejandra--Bruno Alejandra--Moshe Carmina --Moshe Carmina --Nang
## [5] Nang --Samira
diff --git a/pkgdown.yml b/pkgdown.yml
index a8630fbd5b..6ac023c849 100644
--- a/pkgdown.yml
+++ b/pkgdown.yml
@@ -7,7 +7,7 @@ articles:
igraph_ES: igraph_ES.html
igraph: igraph.html
articles/installation-troubleshooting: installation-troubleshooting.html
-last_built: 2025-03-06T09:53Z
+last_built: 2025-03-06T10:24Z
urls:
reference: https://r.igraph.org/reference
article: https://r.igraph.org/articles
diff --git a/reference/E.html b/reference/E.html
index acb46f56a0..e318296d5e 100644
--- a/reference/E.html
+++ b/reference/E.html
@@ -146,14 +146,14 @@ Examples# Edges of an unnamed graph
g <- make_ring(10)
E(g)
-#> + 10/10 edges from 2830ca5:
+#> + 10/10 edges from 62a792a:
#> [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 3450b70 (vertex names):
+#> + 10/10 edges from 6c2cebb (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 7411df5ad3..6a41187657 100644
--- a/reference/V.html
+++ b/reference/V.html
@@ -126,14 +126,14 @@ Examples# Vertex ids of an unnamed graph
g <- make_ring(10)
V(g)
-#> + 10/10 vertices, from 3bf7a48:
+#> + 10/10 vertices, from fe5735e:
#> [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 62743bb:
+#> + 10/10 vertices, named, from 3c22a41:
#> [1] a b c d e f g h i j
diff --git a/reference/add_edges.html b/reference/add_edges.html
index 0929df8c70..96a8ebc6d1 100644
--- a/reference/add_edges.html
+++ b/reference/add_edges.html
@@ -141,7 +141,7 @@ Examples set_edge_attr("color", value = "red") %>%
add_edges(c(5, 1), color = "green")
E(g)[[]]
-#> + 5/5 edges from e6487eb:
+#> + 5/5 edges from 4e53667:
#> 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 c5ae367cd3..6390dc17c3 100644
--- a/reference/add_vertices.html
+++ b/reference/add_vertices.html
@@ -132,12 +132,12 @@ Examples 4, 5
))
g
-#> IGRAPH 4ab497b D--- 5 4 --
+#> IGRAPH 83299ff D--- 5 4 --
#> + attr: color (v/c)
-#> + edges from 4ab497b:
+#> + edges from 83299ff:
#> [1] 1->2 2->3 3->4 4->5
V(g)[[]]
-#> + 5/5 vertices, from 4ab497b:
+#> + 5/5 vertices, from 83299ff:
#> color
#> 1 red
#> 2 red
diff --git a/reference/adjacent_vertices.html b/reference/adjacent_vertices.html
index 9396618f12..3ff6a0677c 100644
--- a/reference/adjacent_vertices.html
+++ b/reference/adjacent_vertices.html
@@ -106,11 +106,11 @@ Examplesg <- make_graph("Zachary")
adjacent_vertices(g, c(1, 34))
#> [[1]]
-#> + 16/34 vertices, from ce599f8:
+#> + 16/34 vertices, from 58c3647:
#> [1] 2 3 4 5 6 7 8 9 11 12 13 14 18 20 22 32
#>
#> [[2]]
-#> + 17/34 vertices, from ce599f8:
+#> + 17/34 vertices, from 58c3647:
#> [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 971dac6c14..a6e4b91b29 100644
--- a/reference/all_simple_paths.html
+++ b/reference/all_simple_paths.html
@@ -126,28 +126,28 @@ Examplesg <- make_ring(10)
all_simple_paths(g, 1, 5)
#> [[1]]
-#> + 5/10 vertices, from 81c1e5d:
+#> + 5/10 vertices, from 232f45d:
#> [1] 1 2 3 4 5
#>
#> [[2]]
-#> + 7/10 vertices, from 81c1e5d:
+#> + 7/10 vertices, from 232f45d:
#> [1] 1 10 9 8 7 6 5
#>
all_simple_paths(g, 1, c(3, 5))
#> [[1]]
-#> + 3/10 vertices, from 81c1e5d:
+#> + 3/10 vertices, from 232f45d:
#> [1] 1 2 3
#>
#> [[2]]
-#> + 5/10 vertices, from 81c1e5d:
+#> + 5/10 vertices, from 232f45d:
#> [1] 1 2 3 4 5
#>
#> [[3]]
-#> + 7/10 vertices, from 81c1e5d:
+#> + 7/10 vertices, from 232f45d:
#> [1] 1 10 9 8 7 6 5
#>
#> [[4]]
-#> + 9/10 vertices, from 81c1e5d:
+#> + 9/10 vertices, from 232f45d:
#> [1] 1 10 9 8 7 6 5 4 3
#>
diff --git a/reference/are_adjacent.html b/reference/are_adjacent.html
index 6770357dc2..5214daac37 100644
--- a/reference/are_adjacent.html
+++ b/reference/are_adjacent.html
@@ -107,9 +107,9 @@ Related documentation in the C l
Examples
ug <- make_ring(10)
ug
-#> IGRAPH 182ca81 U--- 10 10 -- Ring graph
+#> IGRAPH 65bd6bc U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 182ca81:
+#> + edges from 65bd6bc:
#> [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
@@ -118,9 +118,9 @@ Examples
dg <- make_ring(10, directed = TRUE)
dg
-#> IGRAPH 0aa1e7c D--- 10 10 -- Ring graph
+#> IGRAPH 52d20a5 D--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 0aa1e7c:
+#> + edges from 52d20a5:
#> [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 c06eceab0b..fbf9f68f37 100644
--- a/reference/articulation_points.html
+++ b/reference/articulation_points.html
@@ -112,12 +112,12 @@ Examplesclu <- components(g)$membership
g <- add_edges(g, c(match(1, clu), match(2, clu)))
articulation_points(g)
-#> + 2/10 vertices, from ff4845e:
+#> + 2/10 vertices, from 0c0cccc:
#> [1] 6 1
g <- make_graph("krackhardt_kite")
bridges(g)
-#> + 2/18 edges from 267b744:
+#> + 2/18 edges from 0aade1e:
#> [1] 9--10 8-- 9
diff --git a/reference/as.igraph.html b/reference/as.igraph.html
index 38a195b60d..648d9d9786 100644
--- a/reference/as.igraph.html
+++ b/reference/as.igraph.html
@@ -92,9 +92,9 @@ Examplesg <- make_full_graph(5) + make_full_graph(5)
hrg <- fit_hrg(g)
as.igraph(hrg)
-#> IGRAPH 6a214c5 DN-- 19 18 -- Fitted HRG
+#> IGRAPH 1833903 DN-- 19 18 -- Fitted HRG
#> + attr: name (g/c), name (v/c), prob (v/n)
-#> + edges from 6a214c5 (vertex names):
+#> + edges from 1833903 (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 760860af4a..c2fac2b460 100644
--- a/reference/as_adj_list.html
+++ b/reference/as_adj_list.html
@@ -142,84 +142,84 @@ Examplesg <- make_ring(10)
as_adj_list(g)
#> [[1]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 2 10
#>
#> [[2]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 1 3
#>
#> [[3]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 2 4
#>
#> [[4]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 3 5
#>
#> [[5]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 4 6
#>
#> [[6]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 5 7
#>
#> [[7]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 6 8
#>
#> [[8]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 7 9
#>
#> [[9]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 8 10
#>
#> [[10]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 1 9
#>
as_adj_edge_list(g)
#> [[1]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 1-- 2 1--10
#>
#> [[2]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 1--2 2--3
#>
#> [[3]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 2--3 3--4
#>
#> [[4]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 3--4 4--5
#>
#> [[5]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 4--5 5--6
#>
#> [[6]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 5--6 6--7
#>
#> [[7]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 6--7 7--8
#>
#> [[8]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 7--8 8--9
#>
#> [[9]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 8-- 9 9--10
#>
#> [[10]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 1--10 9--10
#>
diff --git a/reference/as_directed.html b/reference/as_directed.html
index d052324b66..e20e274ab3 100644
--- a/reference/as_directed.html
+++ b/reference/as_directed.html
@@ -169,16 +169,16 @@ Examples
g <- make_ring(10)
as_directed(g, "mutual")
-#> IGRAPH baa1c62 D--- 10 20 -- Ring graph
+#> IGRAPH f3c9363 D--- 10 20 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from baa1c62:
+#> + edges from f3c9363:
#> [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 1982ea2 U--- 10 10 -- Ring graph
+#> IGRAPH cd99cd7 U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 1982ea2:
+#> + edges from cd99cd7:
#> [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10
# Combining edge attributes
@@ -186,9 +186,9 @@ ExamplesE(g3)$weight <- seq_len(ecount(g3))
ug3 <- as_undirected(g3)
print(ug3, e = TRUE)
-#> IGRAPH 25ec558 U-W- 10 10 -- Ring graph
+#> IGRAPH ca4e315 U-W- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), weight (e/n)
-#> + edges from 25ec558:
+#> + edges from ca4e315:
#> [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)
@@ -208,9 +208,9 @@ Examples edge.attr.comb = list(weight = length)
)
print(ug4, e = TRUE)
-#> IGRAPH b8ff95e U-W- 10 7 --
+#> IGRAPH f514056 U-W- 10 7 --
#> + attr: weight (e/n)
-#> + edges from b8ff95e:
+#> + edges from f514056:
#> [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 dc777a947f..7bca3439cb 100644
--- a/reference/as_graphnel.html
+++ b/reference/as_graphnel.html
@@ -111,10 +111,10 @@ ExamplesGNEL <- as_graphnel(g)
g2 <- graph_from_graphnel(GNEL)
g2
-#> IGRAPH 4360918 UNW- 10 10 -- Ring graph
+#> IGRAPH 2257d3a UNW- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
#> | (e/n)
-#> + edges from 4360918 (vertex names):
+#> + edges from 2257d3a (vertex names):
#> [1] a--b a--j b--c c--d d--e e--f f--g g--h h--i i--j
## Directed
@@ -123,9 +123,9 @@ ExamplesGNEL2 <- as_graphnel(g3)
g4 <- graph_from_graphnel(GNEL2)
g4
-#> IGRAPH 8cb49f1 DNW- 10 9 -- In-star
+#> IGRAPH e4851cb DNW- 10 9 -- In-star
#> + attr: name (g/c), mode (g/c), center (g/n), name (v/c), weight (e/n)
-#> + edges from 8cb49f1 (vertex names):
+#> + edges from e4851cb (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 e0748d23be..fe3d056495 100644
--- a/reference/automorphism_group.html
+++ b/reference/automorphism_group.html
@@ -154,11 +154,11 @@ Examplesg <- make_ring(10)
automorphism_group(g)
#> [[1]]
-#> + 10/10 vertices, from e7ec182:
+#> + 10/10 vertices, from 7faf9a6:
#> [1] 1 10 9 8 7 6 5 4 3 2
#>
#> [[2]]
-#> + 10/10 vertices, from e7ec182:
+#> + 10/10 vertices, from 7faf9a6:
#> [1] 2 3 4 5 6 7 8 9 10 1
#>
diff --git a/reference/bfs.html b/reference/bfs.html
index 307fcee3a8..ac7444aee0 100644
--- a/reference/bfs.html
+++ b/reference/bfs.html
@@ -62,18 +62,20 @@ Usage
graph,
root,
mode = c("out", "in", "all", "total"),
+ ...,
unreachable = TRUE,
restricted = NULL,
order = TRUE,
rank = FALSE,
- father = FALSE,
+ parent = FALSE,
pred = FALSE,
succ = FALSE,
dist = FALSE,
callback = NULL,
extra = NULL,
rho = parent.frame(),
- neimode = deprecated()
+ neimode = deprecated(),
+ father = deprecated()
)
@@ -97,6 +99,10 @@ Arguments...
+These dots are for future extensions and must be empty.
unreachable
Logical scalar, whether the search should visit the
vertices that are unreachable from the given root vertex (or vertices). If
@@ -118,8 +124,8 @@
Argumentsfather
-Logical scalar, whether to return the father of the vertices.
parent
+Logical scalar, whether to return the parent of the vertices.
pred
@@ -154,6 +160,10 @@ Arguments![[Deprecated]](figures/lifecycle-deprecated.svg)
This argument is deprecated
from igraph 1.3.0; use mode instead.
father
+ Use parent instead.
Value
@@ -174,9 +184,12 @@ Value
rank
Numeric vector. The rank for each vertex, zero for unreachable vertices.
father
+parent
Numeric
-vector. The father of each vertex, i.e. the vertex it was discovered from.
father
+Like parent, kept for compatibility for now.
pred
Numeric vector. The previously visited vertex for each vertex,
@@ -193,7 +206,7 @@
Value
NaN.Note that order, rank, father, pred, succ
+
Note that order, rank, parent, pred, succ
and dist might be NULL if their corresponding argument is
FALSE, i.e. if their calculation is not requested.
@@ -258,7 +271,7 @@ Examples## Two rings
bfs(make_ring(10) %du% make_ring(10),
root = 1, "out",
- order = TRUE, rank = TRUE, father = TRUE, pred = TRUE,
+ order = TRUE, rank = TRUE, parent = TRUE, pred = TRUE,
succ = TRUE, dist = TRUE
)
#> $root
@@ -268,22 +281,22 @@ Examples#> [1] "out"
#>
#> $order
-#> + 20/20 vertices, from 07640b8:
+#> + 20/20 vertices, from dab61a9:
#> [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 07640b8:
+#> $parent
+#> + 20/20 vertices, from dab61a9:
#> [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 07640b8:
+#> + 20/20 vertices, from dab61a9:
#> [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 07640b8:
+#> + 20/20 vertices, from dab61a9:
#> [1] 2 10 9 8 7 NA 6 5 4 3 12 20 19 18 17 NA 16 15 14 13
#>
#> $dist
@@ -292,6 +305,10 @@ Examples#> $neimode
#> [1] "out"
#>
+#> $father
+#> + 20/20 vertices, from dab61a9:
+#> [1] NA 1 2 3 4 5 8 9 10 1 NA 11 12 13 14 15 18 19 20 11
+#>
## How to use a callback
f <- function(graph, data, extra) {
@@ -356,13 +373,13 @@ Examples#> [1] "out"
#>
#> $order
-#> + 20/20 vertices, from 1a5456f:
+#> + 20/20 vertices, from 1880db2:
#> [1] 1 2 10 3 9 4 8 5 7 6 11 12 20 13 19 14 18 15 17 16
#>
#> $rank
#> NULL
#>
-#> $father
+#> $parent
#> NULL
#>
#> $pred
diff --git a/reference/bipartite_projection.html b/reference/bipartite_projection.html
index 363340b1a9..33577d734e 100644
--- a/reference/bipartite_projection.html
+++ b/reference/bipartite_projection.html
@@ -173,15 +173,15 @@ Examplesg2$name <- "Event network"
proj2 <- bipartite_projection(g2)
print(proj2[[1]], g = TRUE, e = TRUE)
-#> IGRAPH 3f1c362 UNW- 5 6 -- Event network
+#> IGRAPH 568ebfc UNW- 5 6 -- Event network
#> + attr: name (g/c), name (v/c), weight (e/n)
-#> + edges from 3f1c362 (vertex names):
+#> + edges from 568ebfc (vertex names):
#> [1] Alice--Bob Alice--Cecil Alice--Dan Bob --Cecil Bob --Dan
#> [6] Cecil--Dan
print(proj2[[2]], g = TRUE, e = TRUE)
-#> IGRAPH 4c92a98 UNW- 3 2 -- Event network
+#> IGRAPH 901f089 UNW- 3 2 -- Event network
#> + attr: name (g/c), name (v/c), weight (e/n)
-#> + edges from 4c92a98 (vertex names):
+#> + edges from 901f089 (vertex names):
#> [1] Party --Skiing Skiing--Badminton
diff --git a/reference/c.igraph.es.html b/reference/c.igraph.es.html
index d0088ceb3a..48afef2a07 100644
--- a/reference/c.igraph.es.html
+++ b/reference/c.igraph.es.html
@@ -101,7 +101,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 eeb5940 (vertex names):
+#> + 6/10 edges from db63cb0 (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 11768ee469..632236c7fd 100644
--- a/reference/c.igraph.vs.html
+++ b/reference/c.igraph.vs.html
@@ -101,7 +101,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 596774c:
+#> + 6/10 vertices, named, from a2e197f:
#> [1] A A A B C D
diff --git a/reference/cliques.html b/reference/cliques.html
index 55df2ebf6d..bbb90d83b0 100644
--- a/reference/cliques.html
+++ b/reference/cliques.html
@@ -183,156 +183,156 @@ Examples#> [1] 6
cliques(g, min = 6)
#> [[1]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 6 7 20 76 87 94
#>
#> [[2]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 7 20 28 53 76 94
#>
#> [[3]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 24 50 57 87 93
#>
#> [[4]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 15 31 40 56 63
#>
#> [[5]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 31 40 56 63 97
#>
#> [[6]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 13 68 69 75 97
#>
#> [[7]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 13 56 68 75 97
#>
#> [[8]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 56 63 68 81 82 97
#>
#> [[9]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 15 28 31 66 85 93
#>
#> [[10]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 3 38 50 68 96 99
#>
#> [[11]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 28 72 79 94
#>
#> [[12]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 54 72 79 94
#>
#> [[13]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 63 79 94 97
#>
#> [[14]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 63 77 94 97
#>
#> [[15]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 13 14 33 79 97
#>
#> [[16]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 17 63 77 97
#>
#> [[17]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 14 18 60 63 97
#>
#> [[18]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 24 46 57 84 91
#>
#> [[19]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 24 46 47 57 91
#>
largest_cliques(g)
#> [[1]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 3 99 50 96 68 38
#>
#> [[2]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 28 72 79 94
#>
#> [[3]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 54 79 72 94
#>
#> [[4]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 97 17 63 77
#>
#> [[5]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 97 79 13 33
#>
#> [[6]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 97 79 63 94
#>
#> [[7]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 97 77 94 63
#>
#> [[8]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 6 7 94 87 20 76
#>
#> [[9]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 7 53 94 28 76 20
#>
#> [[10]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 97 13 68 75 56
#>
#> [[11]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 97 13 68 75 69
#>
#> [[12]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 97 63 14 60 18
#>
#> [[13]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 97 63 40 56 31
#>
#> [[14]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 15 63 56 40 31
#>
#> [[15]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 15 93 31 85 28 66
#>
#> [[16]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 93 50 87 57 24
#>
#> [[17]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 46 91 57 24 84
#>
#> [[18]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 46 91 57 24 47
#>
#> [[19]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 56 97 82 68 81 63
#>
@@ -340,567 +340,567 @@ Examplesg <- sample_gnp(100, 0.03)
max_cliques(g)
#> [[1]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 49
#>
#> [[2]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 64
#>
#> [[3]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 28
#>
#> [[4]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 27
#>
#> [[5]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 56
#>
#> [[6]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 35
#>
#> [[7]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 4
#>
#> [[8]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 89 80
#>
#> [[9]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 38 57
#>
#> [[10]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 70 1
#>
#> [[11]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 12 31
#>
#> [[12]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 93 22
#>
#> [[13]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 21 63
#>
#> [[14]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 73 50
#>
#> [[15]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 96 31
#>
#> [[16]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 25 23
#>
#> [[17]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 99 94
#>
#> [[18]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 32 75
#>
#> [[19]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 100 39
#>
#> [[20]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 44 16
#>
#> [[21]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 62 61
#>
#> [[22]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 36 2
#>
#> [[23]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 50 87
#>
#> [[24]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 51 3
#>
#> [[25]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 33 85
#>
#> [[26]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 33 65
#>
#> [[27]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 34 98
#>
#> [[28]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 34 58
#>
#> [[29]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 37 88
#>
#> [[30]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 37 85
#>
#> [[31]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 37 65
#>
#> [[32]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 39 72
#>
#> [[33]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 39 57
#>
#> [[34]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 39 46
#>
#> [[35]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 40 66
#>
#> [[36]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 40 61
#>
#> [[37]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 40 60
#>
#> [[38]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 40 31
#>
#> [[39]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 41 82
#>
#> [[40]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 41 18
#>
#> [[41]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 41 8
#>
#> [[42]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 42 79
#>
#> [[43]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 42 76
#>
#> [[44]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 43 97
#>
#> [[45]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 43 74
#>
#> [[46]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 43 58
#>
#> [[47]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 43 46
#>
#> [[48]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 45 30
#>
#> [[49]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 45 10
#>
#> [[50]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 47 19
#>
#> [[51]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 47 9
#>
#> [[52]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 47 6
#>
#> [[53]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 48 29
#>
#> [[54]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 48 5
#>
#> [[55]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 52 95
#>
#> [[56]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 52 6
#>
#> [[57]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 53 87
#>
#> [[58]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 53 9
#>
#> [[59]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 54 69
#>
#> [[60]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 54 24
#>
#> [[61]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 54 8
#>
#> [[62]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 55 78
#>
#> [[63]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 55 67
#>
#> [[64]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 55 26
#>
#> [[65]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 57 80
#>
#> [[66]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 57 69
#>
#> [[67]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 57 3
#>
#> [[68]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 58 90
#>
#> [[69]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 58 79
#>
#> [[70]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 58 59
#>
#> [[71]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 59 85
#>
#> [[72]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 60 86
#>
#> [[73]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 61 80
#>
#> [[74]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 61 75
#>
#> [[75]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 61 23
#>
#> [[76]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 63 78
#>
#> [[77]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 63 77
#>
#> [[78]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 63 19
#>
#> [[79]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 65 20
#>
#> [[80]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 65 16
#>
#> [[81]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 66 15
#>
#> [[82]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 66 13
#>
#> [[83]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 67 30
#>
#> [[84]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 67 16
#>
#> [[85]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 68 92
#>
#> [[86]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 68 85
#>
#> [[87]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 68 24
#>
#> [[88]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 68 2
#>
#> [[89]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 69 7
#>
#> [[90]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 71 87
#>
#> [[91]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 71 13
#>
#> [[92]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 71 11
#>
#> [[93]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 72 88
#>
#> [[94]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 72 78
#>
#> [[95]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 72 9
#>
#> [[96]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 74 84
#>
#> [[97]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 74 26
#>
#> [[98]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 75 90
#>
#> [[99]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 75 26
#>
#> [[100]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 76 87
#>
#> [[101]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 77 90
#>
#> [[102]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 77 87
#>
#> [[103]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 77 29
#>
#> [[104]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 77 9
#>
#> [[105]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 78 92
#>
#> [[106]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 78 13
#>
#> [[107]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 78 7
#>
#> [[108]]
-#> + 3/100 vertices, from f0b0845:
+#> + 3/100 vertices, from 14ae67c:
#> [1] 81 17 84
#>
#> [[109]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 81 5
#>
#> [[110]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 82 86
#>
#> [[111]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 82 19
#>
#> [[112]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 83 22
#>
#> [[113]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 83 13
#>
#> [[114]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 84 97
#>
#> [[115]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 84 24
#>
#> [[116]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 84 22
#>
#> [[117]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 84 14
#>
#> [[118]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 85 26
#>
#> [[119]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 86 92
#>
#> [[120]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 86 90
#>
#> [[121]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 87 15
#>
#> [[122]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 90 94
#>
#> [[123]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 90 22
#>
#> [[124]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 91 14
#>
#> [[125]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 91 13
#>
#> [[126]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 94 98
#>
#> [[127]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 94 17
#>
#> [[128]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 95 26
#>
#> [[129]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 97 23
#>
#> [[130]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 98 23
#>
#> [[131]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 98 5
#>
#> [[132]]
-#> + 3/100 vertices, from f0b0845:
+#> + 3/100 vertices, from 14ae67c:
#> [1] 2 13 26
#>
#> [[133]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 3 26
#>
#> [[134]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 6 26
#>
#> [[135]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 6 14
#>
#> [[136]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 10 31
#>
#> [[137]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 10 11
#>
#> [[138]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 15 30
#>
#> [[139]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 16 26
#>
#> [[140]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 18 20
#>
#> [[141]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 19 23
#>
diff --git a/reference/cohesive_blocks.html b/reference/cohesive_blocks.html
index 0d35e21ce5..39c1adbe5f 100644
--- a/reference/cohesive_blocks.html
+++ b/reference/cohesive_blocks.html
@@ -308,23 +308,23 @@ Examples#> '- B-5 c 3, n 4 ......o.oo o......... ...
blocks(mwBlocks)
#> [[1]]
-#> + 23/23 vertices, named, from d4c2b60:
+#> + 23/23 vertices, named, from a59fb86:
#> [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 d4c2b60:
+#> + 14/23 vertices, named, from a59fb86:
#> [1] 1 2 3 4 5 6 7 21 19 17 18 20 22 23
#>
#> [[3]]
-#> + 10/23 vertices, named, from d4c2b60:
+#> + 10/23 vertices, named, from a59fb86:
#> [1] 7 8 11 14 9 10 12 13 16 15
#>
#> [[4]]
-#> + 7/23 vertices, named, from d4c2b60:
+#> + 7/23 vertices, named, from a59fb86:
#> [1] 1 2 3 4 5 6 7
#>
#> [[5]]
-#> + 4/23 vertices, named, from d4c2b60:
+#> + 4/23 vertices, named, from a59fb86:
#> [1] 7 8 11 14
#>
cohesion(mwBlocks)
diff --git a/reference/complementer.html b/reference/complementer.html
index 91c91e7f40..f4fa880e4b 100644
--- a/reference/complementer.html
+++ b/reference/complementer.html
@@ -123,9 +123,9 @@ Examples## Complementer of a ring
g <- make_ring(10)
complementer(g)
-#> IGRAPH 3053d25 U--- 10 35 -- Ring graph
+#> IGRAPH b5d9eb7 U--- 10 35 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 3053d25:
+#> + edges from b5d9eb7:
#> [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
@@ -135,10 +135,10 @@ Examplesgc <- complementer(g)
gu <- union(g, gc)
gu
-#> IGRAPH 9659148 U--- 10 45 --
+#> IGRAPH 05ec897 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 9659148:
+#> + edges from 05ec897:
#> [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 4fafad42d6..0f529456cb 100644
--- a/reference/components.html
+++ b/reference/components.html
@@ -208,9 +208,9 @@ Examples#> [1] 17
#>
largest_component(g)
-#> IGRAPH 7c4b0fe U--- 8 7 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 4c8cd75 U--- 8 7 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from 7c4b0fe:
+#> + edges from 4c8cd75:
#> [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 28b74e984f..e6612777ce 100644
--- a/reference/compose.html
+++ b/reference/compose.html
@@ -152,7 +152,7 @@ Examplesg2 <- make_star(10, mode = "undirected")
gc <- compose(g1, g2)
print_all(gc)
-#> IGRAPH 50a2d31 U--- 10 36 --
+#> IGRAPH f9d8623 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:
@@ -167,7 +167,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 1fd310d U--- 10 24 --
+#> IGRAPH 724a49f 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 cfae4d5b52..a33e0dc6e2 100644
--- a/reference/contract.html
+++ b/reference/contract.html
@@ -141,10 +141,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 97d094e UNW- 5 10 -- Ring
+#> IGRAPH 0b4750e UNW- 5 10 -- Ring
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
#> | (e/n)
-#> + edges from 97d094e (vertex names):
+#> + edges from 0b4750e (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 5eadf74ab3..1c1ab8f501 100644
--- a/reference/delete_edges.html
+++ b/reference/delete_edges.html
@@ -110,25 +110,25 @@ Examplesg <- make_ring(10) %>%
delete_edges(seq(1, 9, by = 2))
g
-#> IGRAPH a8a8b60 U--- 10 5 -- Ring graph
+#> IGRAPH 8cbe011 U--- 10 5 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from a8a8b60:
+#> + edges from 8cbe011:
#> [1] 2-- 3 4-- 5 6-- 7 8-- 9 1--10
g <- make_ring(10) %>%
delete_edges("10|1")
g
-#> IGRAPH d2f9e24 U--- 10 9 -- Ring graph
+#> IGRAPH 2a3f0ba U--- 10 9 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from d2f9e24:
+#> + edges from 2a3f0ba:
#> [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 5d9f522 U--- 5 3 -- Ring graph
+#> IGRAPH 25d7d5c U--- 5 3 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 5d9f522:
+#> + edges from 25d7d5c:
#> [1] 1--2 2--3 3--4
diff --git a/reference/delete_vertices.html b/reference/delete_vertices.html
index 35c228d641..cde049790e 100644
--- a/reference/delete_vertices.html
+++ b/reference/delete_vertices.html
@@ -107,23 +107,23 @@ Examplesg <- make_ring(10) %>%
set_vertex_attr("name", value = LETTERS[1:10])
g
-#> IGRAPH 67c1b1d UN-- 10 10 -- Ring graph
+#> IGRAPH ba7e10f UN-- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 67c1b1d (vertex names):
+#> + edges from ba7e10f (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 67c1b1d:
+#> + 10/10 vertices, named, from ba7e10f:
#> [1] A B C D E F G H I J
g2 <- delete_vertices(g, c(1, 5)) %>%
delete_vertices("B")
g2
-#> IGRAPH e1b0871 UN-- 7 5 -- Ring graph
+#> IGRAPH 4c5648c UN-- 7 5 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from e1b0871 (vertex names):
+#> + edges from 4c5648c (vertex names):
#> [1] C--D F--G G--H H--I I--J
V(g2)
-#> + 7/7 vertices, named, from e1b0871:
+#> + 7/7 vertices, named, from 4c5648c:
#> [1] C D F G H I J
diff --git a/reference/dfs.html b/reference/dfs.html
index 23b8ee0cae..1e60dcb63c 100644
--- a/reference/dfs.html
+++ b/reference/dfs.html
@@ -62,16 +62,18 @@ Usage
graph,
root,
mode = c("out", "in", "all", "total"),
+ ...,
unreachable = TRUE,
order = TRUE,
order.out = FALSE,
- father = FALSE,
+ parent = FALSE,
dist = FALSE,
in.callback = NULL,
out.callback = NULL,
extra = NULL,
rho = parent.frame(),
- neimode = deprecated()
+ neimode = deprecated(),
+ father = deprecated()
)
@@ -94,6 +96,10 @@ Arguments...
+These dots are for future extensions and must be empty.
unreachable
Logical scalar, whether the search should visit the
vertices that are unreachable from the given root vertex (or vertices). If
@@ -111,8 +117,8 @@
Argumentsfather
-Logical scalar, whether to return the father of the vertices.
parent
+Logical scalar, whether to return the parent of the vertices.
dist
@@ -143,6 +149,10 @@ Arguments This argument is deprecated from igraph 1.3.0; use
mode instead.
father
+, use parent instead.
Value
@@ -162,15 +172,19 @@ Value
order.out
Numeric vector, the vertex ids, in the order of the
completion of their subtree.
father
-Numeric vector. The father of
+
parent
+Numeric vector. The parent of
each vertex, i.e. the vertex it was discovered from.
dist
+
+father
+Like parent, kept for compatibility for now.
dist
Numeric
vector, for each vertex its distance from the root of the search tree.
Note that order, order.out, father, and dist
+
Note that order, order.out, parent, and dist
might be NULL if their corresponding argument is FALSE, i.e.
if their calculation is not requested.
@@ -228,9 +242,13 @@ Author<
Examples
## A graph with two separate trees
-dfs(make_tree(10) %du% make_tree(10),
- root = 1, "out",
- TRUE, TRUE, TRUE, TRUE
+dfs(
+ graph = make_tree(10) %du% make_tree(10),
+ root = 1, mode = "out",
+ unreachable = TRUE,
+ order = TRUE,
+ order.out = TRUE,
+ parent = TRUE
)
#> $root
#> [1] 1
@@ -239,15 +257,15 @@ Examples#> [1] "out"
#>
#> $order
-#> + 20/20 vertices, from 30f8316:
+#> + 20/20 vertices, from 2e544cc:
#> [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 30f8316:
+#> + 20/20 vertices, from 2e544cc:
#> [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 30f8316:
+#> $parent
+#> + 20/20 vertices, from 2e544cc:
#> [1] NA 1 1 2 2 3 3 4 4 5 NA 11 11 12 12 13 13 14 14 15
#>
#> $dist
@@ -256,6 +274,10 @@ Examples#> $neimode
#> [1] "out"
#>
+#> $father
+#> + 20/20 vertices, from 2e544cc:
+#> [1] NA 1 1 2 2 3 3 4 4 5 NA 11 11 12 12 13 13 14 14 15
+#>
## How to use a callback
f.in <- function(graph, data, extra) {
@@ -266,8 +288,9 @@ Examples cat("out:", paste(collapse = ", ", data), "\n")
FALSE
}
-tmp <- dfs(make_tree(10),
- root = 1, "out",
+tmp <- dfs(
+ graph = make_tree(10),
+ root = 1, mode = "out",
in.callback = f.in, out.callback = f.out
)
#> in: 1, 0
@@ -295,7 +318,8 @@ Examplesf.out <- function(graph, data, extra) {
data["vid"] == 1
}
-tmp <- dfs(make_tree(10) %du% make_tree(10),
+tmp <- dfs(
+ graph = make_tree(10) %du% make_tree(10),
root = 1,
out.callback = f.out
)
diff --git a/reference/diameter.html b/reference/diameter.html
index d28cfefa24..e10c89b4b3 100644
--- a/reference/diameter.html
+++ b/reference/diameter.html
@@ -137,12 +137,12 @@ Examplesdiameter(g)
#> [1] 27
get_diameter(g)
-#> + 5/10 vertices, from 43c732d:
+#> + 5/10 vertices, from 78fda03:
#> [1] 1 10 9 8 7
diameter(g, weights = NA)
#> [1] 5
get_diameter(g, weights = NA)
-#> + 6/10 vertices, from 43c732d:
+#> + 6/10 vertices, from 78fda03:
#> [1] 1 2 3 4 5 6
diff --git a/reference/difference.igraph.es.html b/reference/difference.igraph.es.html
index 247562f943..797e20d079 100644
--- a/reference/difference.igraph.es.html
+++ b/reference/difference.igraph.es.html
@@ -110,7 +110,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 5c5dc4d:
+#> + 5/10 vertices, named, from 4e5f3f6:
#> [1] A B C D E
diff --git a/reference/difference.igraph.html b/reference/difference.igraph.html
index e9bd73b823..ff3fd8e6a0 100644
--- a/reference/difference.igraph.html
+++ b/reference/difference.igraph.html
@@ -149,7 +149,7 @@ ExamplesV(sstar)$name <- letters[c(1, 3, 5, 7, 9, 11)]
G <- wheel %m% sstar
print_all(G)
-#> IGRAPH 266d7e8 UN-- 11 15 --
+#> IGRAPH d4ea5fd 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 dcb438120e..7f7ff49bff 100644
--- a/reference/difference.igraph.vs.html
+++ b/reference/difference.igraph.vs.html
@@ -110,7 +110,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 a8805bb:
+#> + 5/10 vertices, named, from e2ceeba:
#> [1] A B C D E
diff --git a/reference/disjoint_union.html b/reference/disjoint_union.html
index 2984f7f956..23bea14c61 100644
--- a/reference/disjoint_union.html
+++ b/reference/disjoint_union.html
@@ -139,10 +139,10 @@ Examplesg2 <- make_ring(10)
V(g2)$name <- letters[11:20]
print_all(g1 %du% g2)
-#> IGRAPH 88efc8f UN-- 20 19 --
+#> IGRAPH f7a1e8c 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 88efc8f (vertex names):
+#> + edges from f7a1e8c (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 b40f0887a9..7e85c770f7 100644
--- a/reference/distances.html
+++ b/reference/distances.html
@@ -369,43 +369,43 @@ Examplesshortest_paths(g, 5)
#> $vpath
#> $vpath[[1]]
-#> + 5/10 vertices, from eaf8d30:
+#> + 5/10 vertices, from d463e36:
#> [1] 5 4 3 2 1
#>
#> $vpath[[2]]
-#> + 4/10 vertices, from eaf8d30:
+#> + 4/10 vertices, from d463e36:
#> [1] 5 4 3 2
#>
#> $vpath[[3]]
-#> + 3/10 vertices, from eaf8d30:
+#> + 3/10 vertices, from d463e36:
#> [1] 5 4 3
#>
#> $vpath[[4]]
-#> + 2/10 vertices, from eaf8d30:
+#> + 2/10 vertices, from d463e36:
#> [1] 5 4
#>
#> $vpath[[5]]
-#> + 1/10 vertex, from eaf8d30:
+#> + 1/10 vertex, from d463e36:
#> [1] 5
#>
#> $vpath[[6]]
-#> + 2/10 vertices, from eaf8d30:
+#> + 2/10 vertices, from d463e36:
#> [1] 5 6
#>
#> $vpath[[7]]
-#> + 3/10 vertices, from eaf8d30:
+#> + 3/10 vertices, from d463e36:
#> [1] 5 6 7
#>
#> $vpath[[8]]
-#> + 4/10 vertices, from eaf8d30:
+#> + 4/10 vertices, from d463e36:
#> [1] 5 6 7 8
#>
#> $vpath[[9]]
-#> + 5/10 vertices, from eaf8d30:
+#> + 5/10 vertices, from d463e36:
#> [1] 5 6 7 8 9
#>
#> $vpath[[10]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 5 4 3 2 1 10
#>
#>
@@ -421,19 +421,19 @@ Examplesall_shortest_paths(g, 1, 6:8)
#> $vpaths
#> $vpaths[[1]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 1 10 9 8 7 6
#>
#> $vpaths[[2]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 1 2 3 4 5 6
#>
#> $vpaths[[3]]
-#> + 5/10 vertices, from eaf8d30:
+#> + 5/10 vertices, from d463e36:
#> [1] 1 10 9 8 7
#>
#> $vpaths[[4]]
-#> + 4/10 vertices, from eaf8d30:
+#> + 4/10 vertices, from d463e36:
#> [1] 1 10 9 8
#>
#>
@@ -456,19 +456,19 @@ Examples#>
#> $res
#> $res[[1]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 1 10 9 8 7 6
#>
#> $res[[2]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 1 2 3 4 5 6
#>
#> $res[[3]]
-#> + 5/10 vertices, from eaf8d30:
+#> + 5/10 vertices, from d463e36:
#> [1] 1 10 9 8 7
#>
#> $res[[4]]
-#> + 4/10 vertices, from eaf8d30:
+#> + 4/10 vertices, from d463e36:
#> [1] 1 10 9 8
#>
#>
diff --git a/reference/edge.html b/reference/edge.html
index aaafabb4f8..87b006cd33 100644
--- a/reference/edge.html
+++ b/reference/edge.html
@@ -126,7 +126,7 @@ Examples edge("8|9")
E(g)[[]]
-#> + 11/11 edges from 9224e28:
+#> + 11/11 edges from 6a3d331:
#> 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 f80577cf10..722d16c468 100644
--- a/reference/edge_attr-set.html
+++ b/reference/edge_attr-set.html
@@ -117,10 +117,10 @@ Examples)
edge_attr(g, "label") <- E(g)$name
g
-#> IGRAPH a3a0796 U--- 10 10 -- Ring graph
+#> IGRAPH ea474dd 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 a3a0796:
+#> + edges from ea474dd:
#> [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 cbf69a97e3..920a01cb02 100644
--- a/reference/edge_attr.html
+++ b/reference/edge_attr.html
@@ -109,10 +109,10 @@ Examples set_edge_attr("weight", value = 1:10) %>%
set_edge_attr("color", value = "red")
g
-#> IGRAPH 8144b59 U-W- 10 10 -- Ring graph
+#> IGRAPH a708d21 U-W- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), weight (e/n), color
#> | (e/c)
-#> + edges from 8144b59:
+#> + edges from a708d21:
#> [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 514f036d9d..118387eb65 100644
--- a/reference/ego.html
+++ b/reference/ego.html
@@ -257,82 +257,82 @@ Examples
ego(g, order = 0, 1:3)
#> [[1]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 1
#>
#> [[2]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 2
#>
#> [[3]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 3
#>
ego(g, order = 1, 1:3)
#> [[1]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 1 2 10
#>
#> [[2]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 2 1 3
#>
#> [[3]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 3 2 4
#>
ego(g, order = 2, 1:3)
#> [[1]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 1 2 10 3 9
#>
#> [[2]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 2 1 3 10 4
#>
#> [[3]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 3 2 4 1 5
#>
# neighborhood() is an alias of ego()
neighborhood(g, order = 0, 1:3)
#> [[1]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 1
#>
#> [[2]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 2
#>
#> [[3]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 3
#>
neighborhood(g, order = 1, 1:3)
#> [[1]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 1 2 10
#>
#> [[2]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 2 1 3
#>
#> [[3]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 3 2 4
#>
neighborhood(g, order = 2, 1:3)
#> [[1]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 1 2 10 3 9
#>
#> [[2]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 2 1 3 10 4
#>
#> [[3]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 3 2 4 1 5
#>
@@ -340,41 +340,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 9ed7602 UN-- 5 4 -- Ring graph
+#> IGRAPH 7a5ae2a UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 9ed7602 (vertex names):
+#> + edges from 7a5ae2a (vertex names):
#> [1] a--b b--c a--j i--j
#>
#> [[2]]
-#> IGRAPH 196d641 UN-- 5 4 -- Ring graph
+#> IGRAPH 2561e22 UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 196d641 (vertex names):
+#> + edges from 2561e22 (vertex names):
#> [1] a--b b--c c--d a--j
#>
#> [[3]]
-#> IGRAPH 20b2c33 UN-- 5 4 -- Ring graph
+#> IGRAPH e0c52cd UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 20b2c33 (vertex names):
+#> + edges from e0c52cd (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 39d5e20 UN-- 5 4 -- Ring graph
+#> IGRAPH 6adf149 UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 39d5e20 (vertex names):
+#> + edges from 6adf149 (vertex names):
#> [1] a--b b--c a--j i--j
#>
#> [[2]]
-#> IGRAPH 1eb9833 UN-- 5 4 -- Ring graph
+#> IGRAPH 8bbcaeb UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 1eb9833 (vertex names):
+#> + edges from 8bbcaeb (vertex names):
#> [1] a--b b--c c--d a--j
#>
#> [[3]]
-#> IGRAPH 2a063b1 UN-- 5 4 -- Ring graph
+#> IGRAPH 3163e51 UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 2a063b1 (vertex names):
+#> + edges from 3163e51 (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 b621e185e7..232918c6fa 100644
--- a/reference/feedback_arc_set.html
+++ b/reference/feedback_arc_set.html
@@ -150,10 +150,10 @@ Examples
g <- sample_gnm(20, 40, directed = TRUE)
feedback_arc_set(g)
-#> + 6/40 edges from c60d2a2:
+#> + 6/40 edges from a333cb1:
#> [1] 6->15 6->19 9->15 11-> 3 16->10 17-> 5
feedback_arc_set(g, algo = "approx_eades")
-#> + 6/40 edges from c60d2a2:
+#> + 6/40 edges from a333cb1:
#> [1] 6->15 6->19 9->15 11-> 3 16->10 17-> 5
diff --git a/reference/feedback_vertex_set.html b/reference/feedback_vertex_set.html
index f6e791bc37..30f7882941 100644
--- a/reference/feedback_vertex_set.html
+++ b/reference/feedback_vertex_set.html
@@ -138,7 +138,7 @@ Examples
g <- make_lattice(c(3,3))
feedback_vertex_set(g)
-#> + 2/9 vertices, from 70de832:
+#> + 2/9 vertices, from 2c30b3d:
#> [1] 2 8
diff --git a/reference/get_edge_ids.html b/reference/get_edge_ids.html
index de1322feb1..7f421f061b 100644
--- a/reference/get_edge_ids.html
+++ b/reference/get_edge_ids.html
@@ -132,7 +132,7 @@ Examplesg <- make_ring(10)
ei <- get_edge_ids(g, c(1, 2, 4, 5))
E(g)[ei]
-#> + 2/10 edges from d40d2dc:
+#> + 2/10 edges from 370dd79:
#> [1] 1--2 4--5
## non-existant edge
@@ -146,7 +146,7 @@ Exampleseis
#> [1] 5 5
E(g)[eis]
-#> + 2/5 edges from 9d47704:
+#> + 2/5 edges from dad1b27:
#> [1] 1->2 1->2
diff --git a/reference/girth.html b/reference/girth.html
index 9097ef8d4c..24765c2ae5 100644
--- a/reference/girth.html
+++ b/reference/girth.html
@@ -147,7 +147,7 @@ Examples#> [1] Inf
#>
#> $circle
-#> + 0/1000 vertices, from ec39c01:
+#> + 0/1000 vertices, from 430ad4c:
#>
# The worst case running time is for a ring
@@ -157,7 +157,7 @@ Examples#> [1] 100
#>
#> $circle
-#> + 100/100 vertices, from 1c24d03:
+#> + 100/100 vertices, from f187a55:
#> [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
@@ -173,7 +173,7 @@ Examples#> [1] 12
#>
#> $circle
-#> + 12/1000 vertices, from 7749d56:
+#> + 12/1000 vertices, from 1bcdab2:
#> [1] 903 811 514 822 850 938 125 275 732 518 446 475
#>
diff --git a/reference/graph_.html b/reference/graph_.html
index f5cdc0bb52..741c1a03a4 100644
--- a/reference/graph_.html
+++ b/reference/graph_.html
@@ -78,12 +78,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 6a0d525 U--- 6 5 --
-#> + edges from 6a0d525:
+#> IGRAPH f173ab1 U--- 6 5 --
+#> + edges from f173ab1:
#> [1] 1--2 2--3 3--4 4--5 5--6
graph_(cbind(1:5, 2:6), from_edgelist(), directed = FALSE)
-#> IGRAPH 3eb47d0 U--- 6 5 --
-#> + edges from 3eb47d0:
+#> IGRAPH cf26952 U--- 6 5 --
+#> + edges from cf26952:
#> [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 07cc756077..d3bc6a4a0d 100644
--- a/reference/graph_attr-set.html
+++ b/reference/graph_attr-set.html
@@ -107,9 +107,9 @@ Examplesg <- make_graph(~ A - B:C:D)
graph_attr(g, "name") <- "4-star"
g
-#> IGRAPH 6a8269d UN-- 4 3 -- 4-star
+#> IGRAPH 2b7d7d1 UN-- 4 3 -- 4-star
#> + attr: name (g/c), name (v/c)
-#> + edges from 6a8269d (vertex names):
+#> + edges from 2b7d7d1 (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 ff7edbc3bc..9f7eef8efe 100644
--- a/reference/graph_center.html
+++ b/reference/graph_center.html
@@ -113,13 +113,13 @@ Related documentation in the C l
Examples
tree <- make_tree(100, 7)
graph_center(tree)
-#> + 2/100 vertices, from feb5edb:
+#> + 2/100 vertices, from a1fb484:
#> [1] 1 2
graph_center(tree, mode = "in")
-#> + 1/100 vertex, from feb5edb:
+#> + 1/100 vertex, from a1fb484:
#> [1] 1
graph_center(tree, mode = "out")
-#> + 85/100 vertices, from feb5edb:
+#> + 85/100 vertices, from a1fb484:
#> [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
@@ -129,12 +129,12 @@ Examples# Without and with weights
ring <- make_ring(10)
graph_center(ring)
-#> + 10/10 vertices, from d791e38:
+#> + 10/10 vertices, from db99cee:
#> [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 d791e38:
+#> + 1/10 vertex, from db99cee:
#> [1] 7
diff --git a/reference/graph_from_adjacency_matrix.html b/reference/graph_from_adjacency_matrix.html
index 115d0c24f2..df9e9c6dc9 100644
--- a/reference/graph_from_adjacency_matrix.html
+++ b/reference/graph_from_adjacency_matrix.html
@@ -315,7 +315,7 @@ Examples add.rownames = "code"
)
summary(g10)
-#> IGRAPH ea38b7d DNW- 10 56 --
+#> IGRAPH 027708a 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 e0ee1b4932..6563cef5e6 100644
--- a/reference/graph_from_atlas.html
+++ b/reference/graph_from_atlas.html
@@ -133,14 +133,14 @@ See alsoExamples
## Some randomly picked graphs from the atlas
graph_from_atlas(sample(0:1252, 1))
-#> IGRAPH 0b80be7 U--- 7 11 -- Graph from the Atlas #766
+#> IGRAPH ddadc60 U--- 7 11 -- Graph from the Atlas #766
#> + attr: name (g/c), n (g/n)
-#> + edges from 0b80be7:
+#> + edges from ddadc60:
#> [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 57ae136 U--- 7 12 -- Graph from the Atlas #893
+#> IGRAPH 5c2f196 U--- 7 12 -- Graph from the Atlas #893
#> + attr: name (g/c), n (g/n)
-#> + edges from 57ae136:
+#> + edges from 5c2f196:
#> [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 922e245518..0f2fa4c545 100644
--- a/reference/graph_from_biadjacency_matrix.html
+++ b/reference/graph_from_biadjacency_matrix.html
@@ -156,9 +156,9 @@ Examplescolnames(inc) <- letters[1:5]
rownames(inc) <- LETTERS[1:3]
graph_from_biadjacency_matrix(inc)
-#> IGRAPH 004256d UN-B 8 9 --
+#> IGRAPH c9e4979 UN-B 8 9 --
#> + attr: type (v/l), name (v/c)
-#> + edges from 004256d (vertex names):
+#> + edges from c9e4979 (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 f9b6420336..ce9ee59f16 100644
--- a/reference/graph_from_data_frame.html
+++ b/reference/graph_from_data_frame.html
@@ -200,10 +200,10 @@ Examples)
g <- graph_from_data_frame(relations, directed = TRUE, vertices = actors)
print(g, e = TRUE, v = TRUE)
-#> IGRAPH 07a1a9b DN-- 5 6 --
+#> IGRAPH d30ce83 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 07a1a9b (vertex names):
+#> + edges from d30ce83 (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 19e5839e40..33b0f78d1d 100644
--- a/reference/graph_from_edgelist.html
+++ b/reference/graph_from_edgelist.html
@@ -116,15 +116,15 @@ See alsoExamples
el <- matrix(c("foo", "bar", "bar", "foobar"), nc = 2, byrow = TRUE)
graph_from_edgelist(el)
-#> IGRAPH 95590ca DN-- 3 2 --
+#> IGRAPH 95b9b9c DN-- 3 2 --
#> + attr: name (v/c)
-#> + edges from 95590ca (vertex names):
+#> + edges from 95b9b9c (vertex names):
#> [1] foo->bar bar->foobar
# Create a ring by hand
graph_from_edgelist(cbind(1:10, c(2:10, 1)))
-#> IGRAPH 7d72f9d D--- 10 10 --
-#> + edges from 7d72f9d:
+#> IGRAPH ac9fe3b D--- 10 10 --
+#> + edges from ac9fe3b:
#> [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 220d99206e..6bd7368c43 100644
--- a/reference/graph_from_graphnel.html
+++ b/reference/graph_from_graphnel.html
@@ -139,10 +139,10 @@ ExamplesGNEL <- as_graphnel(g)
g2 <- graph_from_graphnel(GNEL)
g2
-#> IGRAPH 97d4d93 UNW- 10 10 -- Ring graph
+#> IGRAPH a04c3d2 UNW- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
#> | (e/n)
-#> + edges from 97d4d93 (vertex names):
+#> + edges from a04c3d2 (vertex names):
#> [1] a--b a--j b--c c--d d--e e--f f--g g--h h--i i--j
## Directed
@@ -151,9 +151,9 @@ ExamplesGNEL2 <- as_graphnel(g3)
g4 <- graph_from_graphnel(GNEL2)
g4
-#> IGRAPH ee95d7f DNW- 10 9 -- In-star
+#> IGRAPH 5d1e606 DNW- 10 9 -- In-star
#> + attr: name (g/c), mode (g/c), center (g/n), name (v/c), weight (e/n)
-#> + edges from ee95d7f (vertex names):
+#> + edges from 5d1e606 (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 ef3e027194..0a38a1c973 100644
--- a/reference/graph_from_literal.html
+++ b/reference/graph_from_literal.html
@@ -152,18 +152,18 @@ Examples Cecil - Gordon
)
g
-#> IGRAPH 507bc22 UN-- 6 6 --
+#> IGRAPH f1fd02f UN-- 6 6 --
#> + attr: name (v/c)
-#> + edges from 507bc22 (vertex names):
+#> + edges from f1fd02f (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 7268293 UN-- 6 7 --
+#> IGRAPH eed46ff UN-- 6 7 --
#> + attr: name (v/c)
-#> + edges from 7268293 (vertex names):
+#> + edges from eed46ff (vertex names):
#> [1] Alice --Bob Alice --Cecil Alice --Daniel Cecil --Eugene Cecil --Gordon
#> [6] Daniel--Eugene Daniel--Gordon
@@ -173,18 +173,18 @@ Examples Eugene --+ Gordon:Helen
)
g3
-#> IGRAPH ebb89a4 DN-- 7 6 --
+#> IGRAPH ee55d28 DN-- 7 6 --
#> + attr: name (v/c)
-#> + edges from ebb89a4 (vertex names):
+#> + edges from ee55d28 (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 1ed4d71 UN-- 6 2 --
+#> IGRAPH 1b53c58 UN-- 6 2 --
#> + attr: name (v/c)
-#> + edges from 1ed4d71 (vertex names):
+#> + edges from 1b53c58 (vertex names):
#> [1] Alice--Bob Bob --Daniel
V(g4)$name
#> [1] "Alice" "Bob" "Daniel" "Cecil" "Gordon" "Helen"
@@ -192,17 +192,17 @@ Examples# "Arrows" can be arbitrarily long
g5 <- graph_from_literal(Alice +---------+ Bob)
g5
-#> IGRAPH 4cbc4f9 DN-- 2 2 --
+#> IGRAPH 1b8bf62 DN-- 2 2 --
#> + attr: name (v/c)
-#> + edges from 4cbc4f9 (vertex names):
+#> + edges from 1b8bf62 (vertex names):
#> [1] Alice->Bob Bob ->Alice
# Special vertex names
g6 <- graph_from_literal("+" -- "-", "*" -- "/", "%%" -- "%/%")
g6
-#> IGRAPH 50f7b27 UN-- 6 3 --
+#> IGRAPH c0aef3c UN-- 6 3 --
#> + attr: name (v/c)
-#> + edges from 50f7b27 (vertex names):
+#> + edges from c0aef3c (vertex names):
#> [1] + --- * --/ %%--%/%
diff --git a/reference/graph_id.html b/reference/graph_id.html
index 8bccc23d63..c6f0b2ede3 100644
--- a/reference/graph_id.html
+++ b/reference/graph_id.html
@@ -89,15 +89,15 @@ Value
Examples
g <- make_ring(10)
graph_id(g)
-#> [1] "2b820c23-2572-4217-a876-c3009de7bffd"
+#> [1] "37bff9f5-39b6-4e9e-9a7a-7c329256ec17"
graph_id(V(g))
-#> [1] "2b820c23-2572-4217-a876-c3009de7bffd"
+#> [1] "37bff9f5-39b6-4e9e-9a7a-7c329256ec17"
graph_id(E(g))
-#> [1] "2b820c23-2572-4217-a876-c3009de7bffd"
+#> [1] "37bff9f5-39b6-4e9e-9a7a-7c329256ec17"
g2 <- g + 1
graph_id(g2)
-#> [1] "8fae7394-a945-483e-aa98-29ebaaab1e48"
+#> [1] "66d1c9de-d144-4b76-8aad-627660387eca"
diff --git a/reference/igraph-es-indexing.html b/reference/igraph-es-indexing.html
index 596be2459c..648c866376 100644
--- a/reference/igraph-es-indexing.html
+++ b/reference/igraph-es-indexing.html
@@ -203,13 +203,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 d3e7968:
+#> + 4/99 edges from 18d7929:
#> [1] 2->1 3->1 4->1 6->1
E(g)[1:5 %->% 1:6]
-#> + 4/99 edges from d3e7968:
+#> + 4/99 edges from 18d7929:
#> [1] 2->1 3->1 4->1 5->4
E(g)[1:3 %<-% 2:6]
-#> + 4/99 edges from d3e7968:
+#> + 4/99 edges from 18d7929:
#> [1] 2->1 3->1 4->1 6->1
# -----------------------------------------------------------------
@@ -217,7 +217,7 @@ Examplesg <- sample_pa(100, directed = FALSE)
d <- get_diameter(g)
E(g, path = d)
-#> + 11/99 edges from 1c2084d:
+#> + 11/99 edges from 3541e6c:
#> [1] 53--81 49--53 43--49 4--43 2-- 4 2-- 5 5-- 9 9--14 14--36 36--58
#> [11] 58--85
@@ -226,7 +226,7 @@ Examplesg <- sample_gnp(20, 3 / 20) %>%
set_edge_attr("weight", value = rnorm(gsize(.)))
E(g)[[weight < 0]]
-#> + 19/32 edges from 7c107f3:
+#> + 19/32 edges from 9f547fc:
#> tail head tid hid weight
#> 2 1 6 1 6 -1.0667237
#> 3 5 6 5 6 -2.7731724
@@ -253,7 +253,7 @@ ExamplesE(g)$x <- E(g)$weight
x <- 2
E(g)[.env$x]
-#> + 1/32 edge from 7c107f3:
+#> + 1/32 edge from 9f547fc:
#> [1] 1--6
diff --git a/reference/igraph-es-indexing2.html b/reference/igraph-es-indexing2.html
index e1b5988017..4cf4656b6c 100644
--- a/reference/igraph-es-indexing2.html
+++ b/reference/igraph-es-indexing2.html
@@ -126,10 +126,10 @@ Examples with_edge_(weight = 1:10, color = "green")
)
E(g)
-#> + 10/10 edges from 606b218 (vertex names):
+#> + 10/10 edges from 93fdca3 (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 606b218 (vertex names):
+#> + 10/10 edges from 93fdca3 (vertex names):
#> tail head tid hid weight color
#> 1 A B 1 2 1 green
#> 2 B C 2 3 2 green
@@ -142,7 +142,7 @@ Examples#> 9 I J 9 10 9 green
#> 10 A J 1 10 10 green
E(g)[[.inc("A")]]
-#> + 2/10 edges from 606b218 (vertex names):
+#> + 2/10 edges from 93fdca3 (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 159d814666..bd3a9078dc 100644
--- a/reference/igraph-vs-indexing.html
+++ b/reference/igraph-vs-indexing.html
@@ -222,26 +222,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 a6d8901:
+#> + 4/4 vertices, from 8a2f335:
#> [1] 1 2 3 4
V(g)[.nei(c(2, 4), "in")]
-#> + 3/4 vertices, from a6d8901:
+#> + 3/4 vertices, from 8a2f335:
#> [1] 1 2 4
V(g)[.nei(c(2, 4), "out")]
-#> + 3/4 vertices, from a6d8901:
+#> + 3/4 vertices, from 8a2f335:
#> [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 fe3b7cb:
+#> + 4/4 vertices, named, from 2fb567d:
#> [1] A B C D
V(g)[.nei(c("B", "D"), "in")]
-#> + 3/4 vertices, named, from fe3b7cb:
+#> + 3/4 vertices, named, from 2fb567d:
#> [1] A B D
V(g)[.nei(c("B", "D"), "out")]
-#> + 3/4 vertices, named, from fe3b7cb:
+#> + 3/4 vertices, named, from 2fb567d:
#> [1] B C D
# -----------------------------------------------------------------
@@ -249,7 +249,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 b601d34:
+#> + 2/4 vertices, named, from 8499aa0:
#> [1] A B
# Indexing with a variable whose name matches the name of an attribute
@@ -257,7 +257,7 @@ ExamplesV(g)$x <- 10:13
x <- 2
V(g)[.env$x]
-#> + 1/4 vertex, named, from b601d34:
+#> + 1/4 vertex, named, from 8499aa0:
#> [1] B
diff --git a/reference/igraph-vs-indexing2.html b/reference/igraph-vs-indexing2.html
index cbde5a247e..db2355a94b 100644
--- a/reference/igraph-vs-indexing2.html
+++ b/reference/igraph-vs-indexing2.html
@@ -124,10 +124,10 @@ Examples set_vertex_attr("color", value = "red") %>%
set_vertex_attr("name", value = LETTERS[1:10])
V(g)
-#> + 10/10 vertices, named, from a25447c:
+#> + 10/10 vertices, named, from 93700f9:
#> [1] A B C D E F G H I J
V(g)[[]]
-#> + 10/10 vertices, named, from a25447c:
+#> + 10/10 vertices, named, from 93700f9:
#> color name
#> 1 red A
#> 2 red B
@@ -140,10 +140,10 @@ Examples#> 9 red I
#> 10 red J
V(g)[1:5]
-#> + 5/10 vertices, named, from a25447c:
+#> + 5/10 vertices, named, from 93700f9:
#> [1] A B C D E
V(g)[[1:5]]
-#> + 5/10 vertices, named, from a25447c:
+#> + 5/10 vertices, named, from 93700f9:
#> color name
#> 1 red A
#> 2 red B
diff --git a/reference/incident.html b/reference/incident.html
index 62ac648636..ae98982840 100644
--- a/reference/incident.html
+++ b/reference/incident.html
@@ -103,11 +103,11 @@ See alsoExamples
g <- make_graph("Zachary")
incident(g, 1)
-#> + 16/78 edges from 0b27126:
+#> + 16/78 edges from afb424e:
#> [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 0b27126:
+#> + 17/78 edges from afb424e:
#> [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 06eae662e5..f66826c28e 100644
--- a/reference/incident_edges.html
+++ b/reference/incident_edges.html
@@ -106,12 +106,12 @@ Examplesg <- make_graph("Zachary")
incident_edges(g, c(1, 34))
#> [[1]]
-#> + 16/78 edges from 4018ba6:
+#> + 16/78 edges from 5d88b61:
#> [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 4018ba6:
+#> + 17/78 edges from 5d88b61:
#> [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 532bd44671..ad40f128d7 100644
--- a/reference/intersection.igraph.es.html
+++ b/reference/intersection.igraph.es.html
@@ -102,7 +102,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 fc164c8 (vertex names):
+#> + 2/10 edges from b5a86bf (vertex names):
#> [1] E--F F--G
diff --git a/reference/intersection.igraph.html b/reference/intersection.igraph.html
index a431a31c12..c94f83f4fd 100644
--- a/reference/intersection.igraph.html
+++ b/reference/intersection.igraph.html
@@ -147,7 +147,7 @@ Examples)
net2 <- graph_from_literal(D - A:F:Y, B - A - X - F - H - Z, F - Y)
print_all(net1 %s% net2)
-#> IGRAPH 1af1dc5 UN-- 13 4 --
+#> IGRAPH d2f2a72 UN-- 13 4 --
#> + attr: name (v/c)
#> + vertex attributes:
#> | name
@@ -164,7 +164,7 @@ Examples#> | [11] Y
#> | [12] X
#> | [13] Z
-#> + edges from 1af1dc5 (vertex names):
+#> + edges from d2f2a72 (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 e6ae28a165..409ad322ee 100644
--- a/reference/intersection.igraph.vs.html
+++ b/reference/intersection.igraph.vs.html
@@ -102,7 +102,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 4e5bad3 (vertex names):
+#> + 2/10 edges from 2fef653 (vertex names):
#> [1] E--F F--G
diff --git a/reference/is_chordal.html b/reference/is_chordal.html
index d6efa6d412..a203716f69 100644
--- a/reference/is_chordal.html
+++ b/reference/is_chordal.html
@@ -158,7 +158,7 @@ Examples#> [1] 9 4 6 8 3 5 7 2 1
#>
#> $alpham1
-#> + 9/9 vertices, named, from e92fb7b:
+#> + 9/9 vertices, named, from 120e084:
#> [1] G F D B E C H I A
#>
is_chordal(g1, fillin = TRUE)
@@ -182,7 +182,7 @@ Examples#> [1] 10 8 9 6 7 5 4 2 3 1
#>
#> $alpham1
-#> + 10/10 vertices, named, from 1882bfa:
+#> + 10/10 vertices, named, from f3e9782:
#> [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 fc4a3388a5..24b1c2e8c0 100644
--- a/reference/is_forest.html
+++ b/reference/is_forest.html
@@ -128,7 +128,7 @@ Examples#> [1] TRUE
#>
#> $roots
-#> + 2/8 vertices, from c6e71c9:
+#> + 2/8 vertices, from 0f899dd:
#> [1] 1 4
#>
diff --git a/reference/is_named.html b/reference/is_named.html
index 938dee118e..f0da5c87ea 100644
--- a/reference/is_named.html
+++ b/reference/is_named.html
@@ -101,7 +101,7 @@ Examplesis_named(g)
#> [1] TRUE
neighbors(g, "a")
-#> + 2/10 vertices, named, from 718bf0d:
+#> + 2/10 vertices, named, from 9fa5a1d:
#> [1] b j
diff --git a/reference/is_separator.html b/reference/is_separator.html
index a8bf4b5c9a..f4aa330809 100644
--- a/reference/is_separator.html
+++ b/reference/is_separator.html
@@ -114,11 +114,11 @@ Examplesring <- make_ring(4)
min_st_separators(ring)
#> [[1]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 2 4
#>
#> [[2]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 1 3
#>
is_separator(ring, 1)
diff --git a/reference/is_tree.html b/reference/is_tree.html
index d845481735..0da9a43745 100644
--- a/reference/is_tree.html
+++ b/reference/is_tree.html
@@ -129,7 +129,7 @@ Examples#> [1] TRUE
#>
#> $root
-#> + 1/7 vertex, from 4a32e84:
+#> + 1/7 vertex, from c7b73eb:
#> [1] 1
#>
diff --git a/reference/is_weighted.html b/reference/is_weighted.html
index 277b6e3aa5..d339513d50 100644
--- a/reference/is_weighted.html
+++ b/reference/is_weighted.html
@@ -97,7 +97,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 5/10 vertices, from 7d9455d:
+#> + 5/10 vertices, from 67d2c45:
#> [1] 8 9 10 1 2
#>
#>
@@ -114,7 +114,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 7/10 vertices, from 7d9455d:
+#> + 7/10 vertices, from 67d2c45:
#> [1] 8 7 6 5 4 3 2
#>
#>
diff --git a/reference/ivs.html b/reference/ivs.html
index 1f66aca972..9eeffe63eb 100644
--- a/reference/ivs.html
+++ b/reference/ivs.html
@@ -149,83 +149,83 @@ Examples#> [1] 4
ivs(g, min = ivs_size(g))
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
largest_ivs(g)
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
# Empty graph
induced_subgraph(g, largest_ivs(g)[[1]])
-#> IGRAPH b014c2f U--- 4 0 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 19967fb U--- 4 0 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from b014c2f:
+#> + edges from 19967fb:
length(max_ivs(g))
#> [1] 326
diff --git a/reference/keeping_degseq.html b/reference/keeping_degseq.html
index 08bbe5e9a2..4fdb88e033 100644
--- a/reference/keeping_degseq.html
+++ b/reference/keeping_degseq.html
@@ -104,7 +104,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 2496492 U--- 10 10 -- Ring graph
+#> IGRAPH 6cd3af8 U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
#> + graph attributes:
#> | + name:
@@ -113,7 +113,7 @@ Examples#> | [1] FALSE
#> | + circular:
#> | [1] TRUE
-#> + edges from 2496492:
+#> + edges from 6cd3af8:
#> [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 eaebeca7a3..760bbe3cfe 100644
--- a/reference/make_bipartite_graph.html
+++ b/reference/make_bipartite_graph.html
@@ -127,9 +127,9 @@ Examples
g <- make_bipartite_graph(rep(0:1, length.out = 10), c(1:10))
print(g, v = TRUE)
-#> IGRAPH 1dc5f2d U--B 10 5 --
+#> IGRAPH 8145264 U--B 10 5 --
#> + attr: type (v/l)
-#> + edges from 1dc5f2d:
+#> + edges from 8145264:
#> [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 f6f72e6161..22afda4c3c 100644
--- a/reference/make_de_bruijn_graph.html
+++ b/reference/make_de_bruijn_graph.html
@@ -109,14 +109,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 5526008 D--- 4 8 -- De-Bruijn graph 2-2
+#> IGRAPH 5464f62 D--- 4 8 -- De-Bruijn graph 2-2
#> + attr: name (g/c), m (g/n), n (g/n)
-#> + edges from 5526008:
+#> + edges from 5464f62:
#> [1] 1->1 1->2 2->3 2->4 3->1 3->2 4->3 4->4
make_line_graph(g)
-#> IGRAPH ed0c358 D--- 4 8 -- Line graph
+#> IGRAPH f070c0e D--- 4 8 -- Line graph
#> + attr: name (g/c)
-#> + edges from ed0c358:
+#> + edges from f070c0e:
#> [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 c5f49417b4..16e01c5d59 100644
--- a/reference/make_empty_graph.html
+++ b/reference/make_empty_graph.html
@@ -104,11 +104,11 @@ Related documentation in the C l
Examples
make_empty_graph(n = 10)
-#> IGRAPH 839c1eb D--- 10 0 --
-#> + edges from 839c1eb:
+#> IGRAPH 440ddf9 D--- 10 0 --
+#> + edges from 440ddf9:
make_empty_graph(n = 5, directed = FALSE)
-#> IGRAPH d7b2f94 U--- 5 0 --
-#> + edges from d7b2f94:
+#> IGRAPH 870a491 U--- 5 0 --
+#> + edges from 870a491:
g## IGRAPH 5c84465 UN-- 10 2 --
+## IGRAPH abbe0d0 UN-- 10 2 --
## + attr: name (v/c)
-## + edges from 5c84465 (vertex names):
+## + edges from abbe0d0 (vertex names):
## [1] 1--2 1--5
This means: Undirected Named graph
with 10 vertices and 2 edges, with the
@@ -165,7 +165,7 @@
Creating a graph
summary(g)
-## IGRAPH 5c84465 UN-- 10 2 --
+## IGRAPH abbe0d0 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
@@ -246,9 +246,9 @@
Adding/deleting vertices and edges add_vertices(3) %>%
add_edges(edges = c(38, 39, 39, 40, 40, 38, 40, 37))
g
-## IGRAPH bc682d0 U--- 40 86 -- Zachary
+## IGRAPH 35e9b51 U--- 40 86 -- Zachary
## + attr: name (g/c)
-## + edges from bc682d0:
+## + edges from 35e9b51:
## [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
@@ -340,7 +340,7 @@ Constructing graphs
graph1 <- make_tree(127, 2, mode = "undirected")
summary(graph1)
-## IGRAPH 1a6f995 U--- 127 126 -- Tree
+## IGRAPH 240ae4d 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
@@ -357,7 +357,7 @@
Constructing graphs
graph1 <- sample_grg(100, 0.2)
summary(graph1)
-## IGRAPH 079e78d U--- 100 524 -- Geometric random graph
+## IGRAPH dc00647 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
@@ -412,7 +412,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 d9e7195 UN-- 7 9 --
+## IGRAPH c948d99 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
@@ -456,7 +456,7 @@
Setting and retrieving attributes
V(g)$name[1:3] <- c("Alejandra", "Bruno", "Carmina")
V(g)
-## + 7/7 vertices, named, from d9e7195:
+## + 7/7 vertices, named, from c948d99:
## [1] Alejandra Bruno Carmina Moshe Nang Samira Ibrahim
To delete attributes:
@@ -573,12 +573,12 @@ Selecting vertices
seq <- V(graph)[2, 3, 7]
seq
-## + 3/10 vertices, from 377ae09:
+## + 3/10 vertices, from cf29e7e:
## [1] 2 3 7
seq <- seq[1, 3] # filtering an existing vertex set
seq
-## + 2/10 vertices, from 377ae09:
+## + 2/10 vertices, from cf29e7e:
## [1] 2 7
Selecting a vertex that does not exist results in an error:
@@ -674,12 +674,12 @@ Selecting edges
-## + 4/9 edges from d9e7195 (vertex names):
+## + 4/9 edges from c948d99 (vertex names):
## [1] Alejandra--Carmina Carmina --Moshe Carmina --Nang Carmina --Samira
Of course it also works with vertex names:
-## + 4/9 edges from d9e7195 (vertex names):
+## + 4/9 edges from c948d99 (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
@@ -694,7 +694,7 @@
Selecting edges
-## + 3/9 edges from d9e7195 (vertex names):
+## + 3/9 edges from c948d99 (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
@@ -713,7 +713,7 @@
Selecting edges## [1] "Alejandra" "Carmina" "Samira"
-## + 5/9 edges from d9e7195 (vertex names):
+## + 5/9 edges from c948d99 (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 6edb5273f4..a2a98dff65 100644
--- a/articles/igraph_ES.html
+++ b/articles/igraph_ES.html
@@ -155,9 +155,9 @@ Crear un grafo
g
-## IGRAPH b91ccde UN-- 10 2 --
+## IGRAPH 8b28aea UN-- 10 2 --
## + attr: name (v/c)
-## + edges from b91ccde (vertex names):
+## + edges from 8b28aea (vertex names):
## [1] 1--2 1--5
Esto significa: grafo no dirigido (Undirected) con
10 vértices y 2 aristas, que se
@@ -169,7 +169,7 @@
Crear un grafo
summary(g)
-## IGRAPH b91ccde UN-- 10 2 --
+## IGRAPH 8b28aea 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
@@ -256,9 +256,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 6361873 U--- 40 86 -- Zachary
+## IGRAPH 76c25c4 U--- 40 86 -- Zachary
## + attr: name (g/c)
-## + edges from 6361873:
+## + edges from 76c25c4:
## [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
@@ -354,7 +354,7 @@ Construcción de grafos
graph1 <- make_tree(127, 2, mode = "undirected")
summary(g)
-## IGRAPH 352f0f7 U--- 5 3 -- Ring graph
+## IGRAPH ad7c1d1 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
@@ -371,7 +371,7 @@
Construcción de grafos
graph1 <- sample_grg(100, 0.2)
summary(graph1)
-## IGRAPH 9075e90 U--- 100 524 -- Geometric random graph
+## IGRAPH f59e493 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
@@ -429,7 +429,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 cd3f446 UN-- 7 9 --
+## IGRAPH 0accdcd 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
@@ -477,7 +477,7 @@
Establecer y recuperar atributos
V(g)$name[1:3] <- c("Alejandra", "Bruno", "Carmina")
V(g)
-## + 7/7 vertices, named, from cd3f446:
+## + 7/7 vertices, named, from 0accdcd:
## [1] Alejandra Bruno Carmina Moshe Nang Samira Ibrahim
Para eliminar atributos:
@@ -597,12 +597,12 @@ Selección de vértices
seq <- V(graph)[2, 3, 7]
seq
-## + 3/10 vertices, from b21840d:
+## + 3/10 vertices, from c42145e:
## [1] 2 3 7
seq <- seq[1, 3] # filtrar un conjunto de vértices existente
seq
-## + 2/10 vertices, from b21840d:
+## + 2/10 vertices, from c42145e:
## [1] 2 7
Al seleccionar un vértice que no existe se produce un error:
@@ -697,12 +697,12 @@ Selección de aristas
-## + 4/9 edges from cd3f446 (vertex names):
+## + 4/9 edges from 0accdcd (vertex names):
## [1] Alejandra--Carmina Carmina --Moshe Carmina --Nang Carmina --Samira
Por supuesto, también funciona con nombres de vértices:
-## + 4/9 edges from cd3f446 (vertex names):
+## + 4/9 edges from 0accdcd (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
@@ -719,7 +719,7 @@
Selección de aristas
-## + 3/9 edges from cd3f446 (vertex names):
+## + 3/9 edges from 0accdcd (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
@@ -739,7 +739,7 @@
Selección de aristas## [1] "Alejandra" "Carmina" "Samira"
-## + 5/9 edges from cd3f446 (vertex names):
+## + 5/9 edges from 0accdcd (vertex names):
## [1] Alejandra--Bruno Alejandra--Moshe Carmina --Moshe Carmina --Nang
## [5] Nang --Samira
diff --git a/pkgdown.yml b/pkgdown.yml
index a8630fbd5b..6ac023c849 100644
--- a/pkgdown.yml
+++ b/pkgdown.yml
@@ -7,7 +7,7 @@ articles:
igraph_ES: igraph_ES.html
igraph: igraph.html
articles/installation-troubleshooting: installation-troubleshooting.html
-last_built: 2025-03-06T09:53Z
+last_built: 2025-03-06T10:24Z
urls:
reference: https://r.igraph.org/reference
article: https://r.igraph.org/articles
diff --git a/reference/E.html b/reference/E.html
index acb46f56a0..e318296d5e 100644
--- a/reference/E.html
+++ b/reference/E.html
@@ -146,14 +146,14 @@ Examples# Edges of an unnamed graph
g <- make_ring(10)
E(g)
-#> + 10/10 edges from 2830ca5:
+#> + 10/10 edges from 62a792a:
#> [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 3450b70 (vertex names):
+#> + 10/10 edges from 6c2cebb (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 7411df5ad3..6a41187657 100644
--- a/reference/V.html
+++ b/reference/V.html
@@ -126,14 +126,14 @@ Examples# Vertex ids of an unnamed graph
g <- make_ring(10)
V(g)
-#> + 10/10 vertices, from 3bf7a48:
+#> + 10/10 vertices, from fe5735e:
#> [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 62743bb:
+#> + 10/10 vertices, named, from 3c22a41:
#> [1] a b c d e f g h i j
diff --git a/reference/add_edges.html b/reference/add_edges.html
index 0929df8c70..96a8ebc6d1 100644
--- a/reference/add_edges.html
+++ b/reference/add_edges.html
@@ -141,7 +141,7 @@ Examples set_edge_attr("color", value = "red") %>%
add_edges(c(5, 1), color = "green")
E(g)[[]]
-#> + 5/5 edges from e6487eb:
+#> + 5/5 edges from 4e53667:
#> 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 c5ae367cd3..6390dc17c3 100644
--- a/reference/add_vertices.html
+++ b/reference/add_vertices.html
@@ -132,12 +132,12 @@ Examples 4, 5
))
g
-#> IGRAPH 4ab497b D--- 5 4 --
+#> IGRAPH 83299ff D--- 5 4 --
#> + attr: color (v/c)
-#> + edges from 4ab497b:
+#> + edges from 83299ff:
#> [1] 1->2 2->3 3->4 4->5
V(g)[[]]
-#> + 5/5 vertices, from 4ab497b:
+#> + 5/5 vertices, from 83299ff:
#> color
#> 1 red
#> 2 red
diff --git a/reference/adjacent_vertices.html b/reference/adjacent_vertices.html
index 9396618f12..3ff6a0677c 100644
--- a/reference/adjacent_vertices.html
+++ b/reference/adjacent_vertices.html
@@ -106,11 +106,11 @@ Examplesg <- make_graph("Zachary")
adjacent_vertices(g, c(1, 34))
#> [[1]]
-#> + 16/34 vertices, from ce599f8:
+#> + 16/34 vertices, from 58c3647:
#> [1] 2 3 4 5 6 7 8 9 11 12 13 14 18 20 22 32
#>
#> [[2]]
-#> + 17/34 vertices, from ce599f8:
+#> + 17/34 vertices, from 58c3647:
#> [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 971dac6c14..a6e4b91b29 100644
--- a/reference/all_simple_paths.html
+++ b/reference/all_simple_paths.html
@@ -126,28 +126,28 @@ Examplesg <- make_ring(10)
all_simple_paths(g, 1, 5)
#> [[1]]
-#> + 5/10 vertices, from 81c1e5d:
+#> + 5/10 vertices, from 232f45d:
#> [1] 1 2 3 4 5
#>
#> [[2]]
-#> + 7/10 vertices, from 81c1e5d:
+#> + 7/10 vertices, from 232f45d:
#> [1] 1 10 9 8 7 6 5
#>
all_simple_paths(g, 1, c(3, 5))
#> [[1]]
-#> + 3/10 vertices, from 81c1e5d:
+#> + 3/10 vertices, from 232f45d:
#> [1] 1 2 3
#>
#> [[2]]
-#> + 5/10 vertices, from 81c1e5d:
+#> + 5/10 vertices, from 232f45d:
#> [1] 1 2 3 4 5
#>
#> [[3]]
-#> + 7/10 vertices, from 81c1e5d:
+#> + 7/10 vertices, from 232f45d:
#> [1] 1 10 9 8 7 6 5
#>
#> [[4]]
-#> + 9/10 vertices, from 81c1e5d:
+#> + 9/10 vertices, from 232f45d:
#> [1] 1 10 9 8 7 6 5 4 3
#>
diff --git a/reference/are_adjacent.html b/reference/are_adjacent.html
index 6770357dc2..5214daac37 100644
--- a/reference/are_adjacent.html
+++ b/reference/are_adjacent.html
@@ -107,9 +107,9 @@ Related documentation in the C l
Examples
ug <- make_ring(10)
ug
-#> IGRAPH 182ca81 U--- 10 10 -- Ring graph
+#> IGRAPH 65bd6bc U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 182ca81:
+#> + edges from 65bd6bc:
#> [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
@@ -118,9 +118,9 @@ Examples
dg <- make_ring(10, directed = TRUE)
dg
-#> IGRAPH 0aa1e7c D--- 10 10 -- Ring graph
+#> IGRAPH 52d20a5 D--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 0aa1e7c:
+#> + edges from 52d20a5:
#> [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 c06eceab0b..fbf9f68f37 100644
--- a/reference/articulation_points.html
+++ b/reference/articulation_points.html
@@ -112,12 +112,12 @@ Examplesclu <- components(g)$membership
g <- add_edges(g, c(match(1, clu), match(2, clu)))
articulation_points(g)
-#> + 2/10 vertices, from ff4845e:
+#> + 2/10 vertices, from 0c0cccc:
#> [1] 6 1
g <- make_graph("krackhardt_kite")
bridges(g)
-#> + 2/18 edges from 267b744:
+#> + 2/18 edges from 0aade1e:
#> [1] 9--10 8-- 9
diff --git a/reference/as.igraph.html b/reference/as.igraph.html
index 38a195b60d..648d9d9786 100644
--- a/reference/as.igraph.html
+++ b/reference/as.igraph.html
@@ -92,9 +92,9 @@ Examplesg <- make_full_graph(5) + make_full_graph(5)
hrg <- fit_hrg(g)
as.igraph(hrg)
-#> IGRAPH 6a214c5 DN-- 19 18 -- Fitted HRG
+#> IGRAPH 1833903 DN-- 19 18 -- Fitted HRG
#> + attr: name (g/c), name (v/c), prob (v/n)
-#> + edges from 6a214c5 (vertex names):
+#> + edges from 1833903 (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 760860af4a..c2fac2b460 100644
--- a/reference/as_adj_list.html
+++ b/reference/as_adj_list.html
@@ -142,84 +142,84 @@ Examplesg <- make_ring(10)
as_adj_list(g)
#> [[1]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 2 10
#>
#> [[2]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 1 3
#>
#> [[3]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 2 4
#>
#> [[4]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 3 5
#>
#> [[5]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 4 6
#>
#> [[6]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 5 7
#>
#> [[7]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 6 8
#>
#> [[8]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 7 9
#>
#> [[9]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 8 10
#>
#> [[10]]
-#> + 2/10 vertices, from 1864c09:
+#> + 2/10 vertices, from 50f5310:
#> [1] 1 9
#>
as_adj_edge_list(g)
#> [[1]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 1-- 2 1--10
#>
#> [[2]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 1--2 2--3
#>
#> [[3]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 2--3 3--4
#>
#> [[4]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 3--4 4--5
#>
#> [[5]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 4--5 5--6
#>
#> [[6]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 5--6 6--7
#>
#> [[7]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 6--7 7--8
#>
#> [[8]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 7--8 8--9
#>
#> [[9]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 8-- 9 9--10
#>
#> [[10]]
-#> + 2/10 edges from 1864c09:
+#> + 2/10 edges from 50f5310:
#> [1] 1--10 9--10
#>
diff --git a/reference/as_directed.html b/reference/as_directed.html
index d052324b66..e20e274ab3 100644
--- a/reference/as_directed.html
+++ b/reference/as_directed.html
@@ -169,16 +169,16 @@ Examples
g <- make_ring(10)
as_directed(g, "mutual")
-#> IGRAPH baa1c62 D--- 10 20 -- Ring graph
+#> IGRAPH f3c9363 D--- 10 20 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from baa1c62:
+#> + edges from f3c9363:
#> [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 1982ea2 U--- 10 10 -- Ring graph
+#> IGRAPH cd99cd7 U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 1982ea2:
+#> + edges from cd99cd7:
#> [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10
# Combining edge attributes
@@ -186,9 +186,9 @@ ExamplesE(g3)$weight <- seq_len(ecount(g3))
ug3 <- as_undirected(g3)
print(ug3, e = TRUE)
-#> IGRAPH 25ec558 U-W- 10 10 -- Ring graph
+#> IGRAPH ca4e315 U-W- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), weight (e/n)
-#> + edges from 25ec558:
+#> + edges from ca4e315:
#> [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)
@@ -208,9 +208,9 @@ Examples edge.attr.comb = list(weight = length)
)
print(ug4, e = TRUE)
-#> IGRAPH b8ff95e U-W- 10 7 --
+#> IGRAPH f514056 U-W- 10 7 --
#> + attr: weight (e/n)
-#> + edges from b8ff95e:
+#> + edges from f514056:
#> [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 dc777a947f..7bca3439cb 100644
--- a/reference/as_graphnel.html
+++ b/reference/as_graphnel.html
@@ -111,10 +111,10 @@ ExamplesGNEL <- as_graphnel(g)
g2 <- graph_from_graphnel(GNEL)
g2
-#> IGRAPH 4360918 UNW- 10 10 -- Ring graph
+#> IGRAPH 2257d3a UNW- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
#> | (e/n)
-#> + edges from 4360918 (vertex names):
+#> + edges from 2257d3a (vertex names):
#> [1] a--b a--j b--c c--d d--e e--f f--g g--h h--i i--j
## Directed
@@ -123,9 +123,9 @@ ExamplesGNEL2 <- as_graphnel(g3)
g4 <- graph_from_graphnel(GNEL2)
g4
-#> IGRAPH 8cb49f1 DNW- 10 9 -- In-star
+#> IGRAPH e4851cb DNW- 10 9 -- In-star
#> + attr: name (g/c), mode (g/c), center (g/n), name (v/c), weight (e/n)
-#> + edges from 8cb49f1 (vertex names):
+#> + edges from e4851cb (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 e0748d23be..fe3d056495 100644
--- a/reference/automorphism_group.html
+++ b/reference/automorphism_group.html
@@ -154,11 +154,11 @@ Examplesg <- make_ring(10)
automorphism_group(g)
#> [[1]]
-#> + 10/10 vertices, from e7ec182:
+#> + 10/10 vertices, from 7faf9a6:
#> [1] 1 10 9 8 7 6 5 4 3 2
#>
#> [[2]]
-#> + 10/10 vertices, from e7ec182:
+#> + 10/10 vertices, from 7faf9a6:
#> [1] 2 3 4 5 6 7 8 9 10 1
#>
diff --git a/reference/bfs.html b/reference/bfs.html
index 307fcee3a8..ac7444aee0 100644
--- a/reference/bfs.html
+++ b/reference/bfs.html
@@ -62,18 +62,20 @@ Usage
graph,
root,
mode = c("out", "in", "all", "total"),
+ ...,
unreachable = TRUE,
restricted = NULL,
order = TRUE,
rank = FALSE,
- father = FALSE,
+ parent = FALSE,
pred = FALSE,
succ = FALSE,
dist = FALSE,
callback = NULL,
extra = NULL,
rho = parent.frame(),
- neimode = deprecated()
+ neimode = deprecated(),
+ father = deprecated()
)
@@ -97,6 +99,10 @@ Arguments...
+These dots are for future extensions and must be empty.
unreachable
Logical scalar, whether the search should visit the
vertices that are unreachable from the given root vertex (or vertices). If
@@ -118,8 +124,8 @@
Argumentsfather
-Logical scalar, whether to return the father of the vertices.
parent
+Logical scalar, whether to return the parent of the vertices.
pred
@@ -154,6 +160,10 @@ Arguments This argument is deprecated
from igraph 1.3.0; use mode instead.
father
+ Use parent instead.
Value
@@ -174,9 +184,12 @@ Value
rank
Numeric vector. The rank for each vertex, zero for unreachable vertices.
father
+parent
Numeric
-vector. The father of each vertex, i.e. the vertex it was discovered from.
father
+Like parent, kept for compatibility for now.
pred
Numeric vector. The previously visited vertex for each vertex,
@@ -193,7 +206,7 @@
Value
NaN.Note that order, rank, father, pred, succ
+
Note that order, rank, parent, pred, succ
and dist might be NULL if their corresponding argument is
FALSE, i.e. if their calculation is not requested.
@@ -258,7 +271,7 @@ Examples## Two rings
bfs(make_ring(10) %du% make_ring(10),
root = 1, "out",
- order = TRUE, rank = TRUE, father = TRUE, pred = TRUE,
+ order = TRUE, rank = TRUE, parent = TRUE, pred = TRUE,
succ = TRUE, dist = TRUE
)
#> $root
@@ -268,22 +281,22 @@ Examples#> [1] "out"
#>
#> $order
-#> + 20/20 vertices, from 07640b8:
+#> + 20/20 vertices, from dab61a9:
#> [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 07640b8:
+#> $parent
+#> + 20/20 vertices, from dab61a9:
#> [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 07640b8:
+#> + 20/20 vertices, from dab61a9:
#> [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 07640b8:
+#> + 20/20 vertices, from dab61a9:
#> [1] 2 10 9 8 7 NA 6 5 4 3 12 20 19 18 17 NA 16 15 14 13
#>
#> $dist
@@ -292,6 +305,10 @@ Examples#> $neimode
#> [1] "out"
#>
+#> $father
+#> + 20/20 vertices, from dab61a9:
+#> [1] NA 1 2 3 4 5 8 9 10 1 NA 11 12 13 14 15 18 19 20 11
+#>
## How to use a callback
f <- function(graph, data, extra) {
@@ -356,13 +373,13 @@ Examples#> [1] "out"
#>
#> $order
-#> + 20/20 vertices, from 1a5456f:
+#> + 20/20 vertices, from 1880db2:
#> [1] 1 2 10 3 9 4 8 5 7 6 11 12 20 13 19 14 18 15 17 16
#>
#> $rank
#> NULL
#>
-#> $father
+#> $parent
#> NULL
#>
#> $pred
diff --git a/reference/bipartite_projection.html b/reference/bipartite_projection.html
index 363340b1a9..33577d734e 100644
--- a/reference/bipartite_projection.html
+++ b/reference/bipartite_projection.html
@@ -173,15 +173,15 @@ Examplesg2$name <- "Event network"
proj2 <- bipartite_projection(g2)
print(proj2[[1]], g = TRUE, e = TRUE)
-#> IGRAPH 3f1c362 UNW- 5 6 -- Event network
+#> IGRAPH 568ebfc UNW- 5 6 -- Event network
#> + attr: name (g/c), name (v/c), weight (e/n)
-#> + edges from 3f1c362 (vertex names):
+#> + edges from 568ebfc (vertex names):
#> [1] Alice--Bob Alice--Cecil Alice--Dan Bob --Cecil Bob --Dan
#> [6] Cecil--Dan
print(proj2[[2]], g = TRUE, e = TRUE)
-#> IGRAPH 4c92a98 UNW- 3 2 -- Event network
+#> IGRAPH 901f089 UNW- 3 2 -- Event network
#> + attr: name (g/c), name (v/c), weight (e/n)
-#> + edges from 4c92a98 (vertex names):
+#> + edges from 901f089 (vertex names):
#> [1] Party --Skiing Skiing--Badminton
diff --git a/reference/c.igraph.es.html b/reference/c.igraph.es.html
index d0088ceb3a..48afef2a07 100644
--- a/reference/c.igraph.es.html
+++ b/reference/c.igraph.es.html
@@ -101,7 +101,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 eeb5940 (vertex names):
+#> + 6/10 edges from db63cb0 (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 11768ee469..632236c7fd 100644
--- a/reference/c.igraph.vs.html
+++ b/reference/c.igraph.vs.html
@@ -101,7 +101,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 596774c:
+#> + 6/10 vertices, named, from a2e197f:
#> [1] A A A B C D
diff --git a/reference/cliques.html b/reference/cliques.html
index 55df2ebf6d..bbb90d83b0 100644
--- a/reference/cliques.html
+++ b/reference/cliques.html
@@ -183,156 +183,156 @@ Examples#> [1] 6
cliques(g, min = 6)
#> [[1]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 6 7 20 76 87 94
#>
#> [[2]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 7 20 28 53 76 94
#>
#> [[3]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 24 50 57 87 93
#>
#> [[4]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 15 31 40 56 63
#>
#> [[5]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 31 40 56 63 97
#>
#> [[6]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 13 68 69 75 97
#>
#> [[7]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 13 56 68 75 97
#>
#> [[8]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 56 63 68 81 82 97
#>
#> [[9]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 15 28 31 66 85 93
#>
#> [[10]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 3 38 50 68 96 99
#>
#> [[11]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 28 72 79 94
#>
#> [[12]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 54 72 79 94
#>
#> [[13]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 63 79 94 97
#>
#> [[14]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 63 77 94 97
#>
#> [[15]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 13 14 33 79 97
#>
#> [[16]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 17 63 77 97
#>
#> [[17]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 14 18 60 63 97
#>
#> [[18]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 24 46 57 84 91
#>
#> [[19]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 24 46 47 57 91
#>
largest_cliques(g)
#> [[1]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 3 99 50 96 68 38
#>
#> [[2]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 28 72 79 94
#>
#> [[3]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 54 79 72 94
#>
#> [[4]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 97 17 63 77
#>
#> [[5]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 97 79 13 33
#>
#> [[6]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 97 79 63 94
#>
#> [[7]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 5 14 97 77 94 63
#>
#> [[8]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 6 7 94 87 20 76
#>
#> [[9]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 7 53 94 28 76 20
#>
#> [[10]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 97 13 68 75 56
#>
#> [[11]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 97 13 68 75 69
#>
#> [[12]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 97 63 14 60 18
#>
#> [[13]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 97 63 40 56 31
#>
#> [[14]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 8 15 63 56 40 31
#>
#> [[15]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 15 93 31 85 28 66
#>
#> [[16]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 93 50 87 57 24
#>
#> [[17]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 46 91 57 24 84
#>
#> [[18]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 17 46 91 57 24 47
#>
#> [[19]]
-#> + 6/100 vertices, from cbba3e6:
+#> + 6/100 vertices, from e3b7466:
#> [1] 56 97 82 68 81 63
#>
@@ -340,567 +340,567 @@ Examplesg <- sample_gnp(100, 0.03)
max_cliques(g)
#> [[1]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 49
#>
#> [[2]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 64
#>
#> [[3]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 28
#>
#> [[4]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 27
#>
#> [[5]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 56
#>
#> [[6]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 35
#>
#> [[7]]
-#> + 1/100 vertex, from f0b0845:
+#> + 1/100 vertex, from 14ae67c:
#> [1] 4
#>
#> [[8]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 89 80
#>
#> [[9]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 38 57
#>
#> [[10]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 70 1
#>
#> [[11]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 12 31
#>
#> [[12]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 93 22
#>
#> [[13]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 21 63
#>
#> [[14]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 73 50
#>
#> [[15]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 96 31
#>
#> [[16]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 25 23
#>
#> [[17]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 99 94
#>
#> [[18]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 32 75
#>
#> [[19]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 100 39
#>
#> [[20]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 44 16
#>
#> [[21]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 62 61
#>
#> [[22]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 36 2
#>
#> [[23]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 50 87
#>
#> [[24]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 51 3
#>
#> [[25]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 33 85
#>
#> [[26]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 33 65
#>
#> [[27]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 34 98
#>
#> [[28]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 34 58
#>
#> [[29]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 37 88
#>
#> [[30]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 37 85
#>
#> [[31]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 37 65
#>
#> [[32]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 39 72
#>
#> [[33]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 39 57
#>
#> [[34]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 39 46
#>
#> [[35]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 40 66
#>
#> [[36]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 40 61
#>
#> [[37]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 40 60
#>
#> [[38]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 40 31
#>
#> [[39]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 41 82
#>
#> [[40]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 41 18
#>
#> [[41]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 41 8
#>
#> [[42]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 42 79
#>
#> [[43]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 42 76
#>
#> [[44]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 43 97
#>
#> [[45]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 43 74
#>
#> [[46]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 43 58
#>
#> [[47]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 43 46
#>
#> [[48]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 45 30
#>
#> [[49]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 45 10
#>
#> [[50]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 47 19
#>
#> [[51]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 47 9
#>
#> [[52]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 47 6
#>
#> [[53]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 48 29
#>
#> [[54]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 48 5
#>
#> [[55]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 52 95
#>
#> [[56]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 52 6
#>
#> [[57]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 53 87
#>
#> [[58]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 53 9
#>
#> [[59]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 54 69
#>
#> [[60]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 54 24
#>
#> [[61]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 54 8
#>
#> [[62]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 55 78
#>
#> [[63]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 55 67
#>
#> [[64]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 55 26
#>
#> [[65]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 57 80
#>
#> [[66]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 57 69
#>
#> [[67]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 57 3
#>
#> [[68]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 58 90
#>
#> [[69]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 58 79
#>
#> [[70]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 58 59
#>
#> [[71]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 59 85
#>
#> [[72]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 60 86
#>
#> [[73]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 61 80
#>
#> [[74]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 61 75
#>
#> [[75]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 61 23
#>
#> [[76]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 63 78
#>
#> [[77]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 63 77
#>
#> [[78]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 63 19
#>
#> [[79]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 65 20
#>
#> [[80]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 65 16
#>
#> [[81]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 66 15
#>
#> [[82]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 66 13
#>
#> [[83]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 67 30
#>
#> [[84]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 67 16
#>
#> [[85]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 68 92
#>
#> [[86]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 68 85
#>
#> [[87]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 68 24
#>
#> [[88]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 68 2
#>
#> [[89]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 69 7
#>
#> [[90]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 71 87
#>
#> [[91]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 71 13
#>
#> [[92]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 71 11
#>
#> [[93]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 72 88
#>
#> [[94]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 72 78
#>
#> [[95]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 72 9
#>
#> [[96]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 74 84
#>
#> [[97]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 74 26
#>
#> [[98]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 75 90
#>
#> [[99]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 75 26
#>
#> [[100]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 76 87
#>
#> [[101]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 77 90
#>
#> [[102]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 77 87
#>
#> [[103]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 77 29
#>
#> [[104]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 77 9
#>
#> [[105]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 78 92
#>
#> [[106]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 78 13
#>
#> [[107]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 78 7
#>
#> [[108]]
-#> + 3/100 vertices, from f0b0845:
+#> + 3/100 vertices, from 14ae67c:
#> [1] 81 17 84
#>
#> [[109]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 81 5
#>
#> [[110]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 82 86
#>
#> [[111]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 82 19
#>
#> [[112]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 83 22
#>
#> [[113]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 83 13
#>
#> [[114]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 84 97
#>
#> [[115]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 84 24
#>
#> [[116]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 84 22
#>
#> [[117]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 84 14
#>
#> [[118]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 85 26
#>
#> [[119]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 86 92
#>
#> [[120]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 86 90
#>
#> [[121]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 87 15
#>
#> [[122]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 90 94
#>
#> [[123]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 90 22
#>
#> [[124]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 91 14
#>
#> [[125]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 91 13
#>
#> [[126]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 94 98
#>
#> [[127]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 94 17
#>
#> [[128]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 95 26
#>
#> [[129]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 97 23
#>
#> [[130]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 98 23
#>
#> [[131]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 98 5
#>
#> [[132]]
-#> + 3/100 vertices, from f0b0845:
+#> + 3/100 vertices, from 14ae67c:
#> [1] 2 13 26
#>
#> [[133]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 3 26
#>
#> [[134]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 6 26
#>
#> [[135]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 6 14
#>
#> [[136]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 10 31
#>
#> [[137]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 10 11
#>
#> [[138]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 15 30
#>
#> [[139]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 16 26
#>
#> [[140]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 18 20
#>
#> [[141]]
-#> + 2/100 vertices, from f0b0845:
+#> + 2/100 vertices, from 14ae67c:
#> [1] 19 23
#>
diff --git a/reference/cohesive_blocks.html b/reference/cohesive_blocks.html
index 0d35e21ce5..39c1adbe5f 100644
--- a/reference/cohesive_blocks.html
+++ b/reference/cohesive_blocks.html
@@ -308,23 +308,23 @@ Examples#> '- B-5 c 3, n 4 ......o.oo o......... ...
blocks(mwBlocks)
#> [[1]]
-#> + 23/23 vertices, named, from d4c2b60:
+#> + 23/23 vertices, named, from a59fb86:
#> [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 d4c2b60:
+#> + 14/23 vertices, named, from a59fb86:
#> [1] 1 2 3 4 5 6 7 21 19 17 18 20 22 23
#>
#> [[3]]
-#> + 10/23 vertices, named, from d4c2b60:
+#> + 10/23 vertices, named, from a59fb86:
#> [1] 7 8 11 14 9 10 12 13 16 15
#>
#> [[4]]
-#> + 7/23 vertices, named, from d4c2b60:
+#> + 7/23 vertices, named, from a59fb86:
#> [1] 1 2 3 4 5 6 7
#>
#> [[5]]
-#> + 4/23 vertices, named, from d4c2b60:
+#> + 4/23 vertices, named, from a59fb86:
#> [1] 7 8 11 14
#>
cohesion(mwBlocks)
diff --git a/reference/complementer.html b/reference/complementer.html
index 91c91e7f40..f4fa880e4b 100644
--- a/reference/complementer.html
+++ b/reference/complementer.html
@@ -123,9 +123,9 @@ Examples## Complementer of a ring
g <- make_ring(10)
complementer(g)
-#> IGRAPH 3053d25 U--- 10 35 -- Ring graph
+#> IGRAPH b5d9eb7 U--- 10 35 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 3053d25:
+#> + edges from b5d9eb7:
#> [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
@@ -135,10 +135,10 @@ Examplesgc <- complementer(g)
gu <- union(g, gc)
gu
-#> IGRAPH 9659148 U--- 10 45 --
+#> IGRAPH 05ec897 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 9659148:
+#> + edges from 05ec897:
#> [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 4fafad42d6..0f529456cb 100644
--- a/reference/components.html
+++ b/reference/components.html
@@ -208,9 +208,9 @@ Examples#> [1] 17
#>
largest_component(g)
-#> IGRAPH 7c4b0fe U--- 8 7 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 4c8cd75 U--- 8 7 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from 7c4b0fe:
+#> + edges from 4c8cd75:
#> [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 28b74e984f..e6612777ce 100644
--- a/reference/compose.html
+++ b/reference/compose.html
@@ -152,7 +152,7 @@ Examplesg2 <- make_star(10, mode = "undirected")
gc <- compose(g1, g2)
print_all(gc)
-#> IGRAPH 50a2d31 U--- 10 36 --
+#> IGRAPH f9d8623 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:
@@ -167,7 +167,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 1fd310d U--- 10 24 --
+#> IGRAPH 724a49f 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 cfae4d5b52..a33e0dc6e2 100644
--- a/reference/contract.html
+++ b/reference/contract.html
@@ -141,10 +141,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 97d094e UNW- 5 10 -- Ring
+#> IGRAPH 0b4750e UNW- 5 10 -- Ring
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
#> | (e/n)
-#> + edges from 97d094e (vertex names):
+#> + edges from 0b4750e (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 5eadf74ab3..1c1ab8f501 100644
--- a/reference/delete_edges.html
+++ b/reference/delete_edges.html
@@ -110,25 +110,25 @@ Examplesg <- make_ring(10) %>%
delete_edges(seq(1, 9, by = 2))
g
-#> IGRAPH a8a8b60 U--- 10 5 -- Ring graph
+#> IGRAPH 8cbe011 U--- 10 5 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from a8a8b60:
+#> + edges from 8cbe011:
#> [1] 2-- 3 4-- 5 6-- 7 8-- 9 1--10
g <- make_ring(10) %>%
delete_edges("10|1")
g
-#> IGRAPH d2f9e24 U--- 10 9 -- Ring graph
+#> IGRAPH 2a3f0ba U--- 10 9 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from d2f9e24:
+#> + edges from 2a3f0ba:
#> [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 5d9f522 U--- 5 3 -- Ring graph
+#> IGRAPH 25d7d5c U--- 5 3 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
-#> + edges from 5d9f522:
+#> + edges from 25d7d5c:
#> [1] 1--2 2--3 3--4
diff --git a/reference/delete_vertices.html b/reference/delete_vertices.html
index 35c228d641..cde049790e 100644
--- a/reference/delete_vertices.html
+++ b/reference/delete_vertices.html
@@ -107,23 +107,23 @@ Examplesg <- make_ring(10) %>%
set_vertex_attr("name", value = LETTERS[1:10])
g
-#> IGRAPH 67c1b1d UN-- 10 10 -- Ring graph
+#> IGRAPH ba7e10f UN-- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 67c1b1d (vertex names):
+#> + edges from ba7e10f (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 67c1b1d:
+#> + 10/10 vertices, named, from ba7e10f:
#> [1] A B C D E F G H I J
g2 <- delete_vertices(g, c(1, 5)) %>%
delete_vertices("B")
g2
-#> IGRAPH e1b0871 UN-- 7 5 -- Ring graph
+#> IGRAPH 4c5648c UN-- 7 5 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from e1b0871 (vertex names):
+#> + edges from 4c5648c (vertex names):
#> [1] C--D F--G G--H H--I I--J
V(g2)
-#> + 7/7 vertices, named, from e1b0871:
+#> + 7/7 vertices, named, from 4c5648c:
#> [1] C D F G H I J
diff --git a/reference/dfs.html b/reference/dfs.html
index 23b8ee0cae..1e60dcb63c 100644
--- a/reference/dfs.html
+++ b/reference/dfs.html
@@ -62,16 +62,18 @@ Usage
graph,
root,
mode = c("out", "in", "all", "total"),
+ ...,
unreachable = TRUE,
order = TRUE,
order.out = FALSE,
- father = FALSE,
+ parent = FALSE,
dist = FALSE,
in.callback = NULL,
out.callback = NULL,
extra = NULL,
rho = parent.frame(),
- neimode = deprecated()
+ neimode = deprecated(),
+ father = deprecated()
)
@@ -94,6 +96,10 @@ Arguments...
+These dots are for future extensions and must be empty.
unreachable
Logical scalar, whether the search should visit the
vertices that are unreachable from the given root vertex (or vertices). If
@@ -111,8 +117,8 @@
Argumentsfather
-Logical scalar, whether to return the father of the vertices.
parent
+Logical scalar, whether to return the parent of the vertices.
dist
@@ -143,6 +149,10 @@ Arguments This argument is deprecated from igraph 1.3.0; use
mode instead.
father
+, use parent instead.
Value
@@ -162,15 +172,19 @@ Value
order.out
Numeric vector, the vertex ids, in the order of the
completion of their subtree.
father
-Numeric vector. The father of
+
parent
+Numeric vector. The parent of
each vertex, i.e. the vertex it was discovered from.
dist
+
+father
+Like parent, kept for compatibility for now.
dist
Numeric
vector, for each vertex its distance from the root of the search tree.
Note that order, order.out, father, and dist
+
Note that order, order.out, parent, and dist
might be NULL if their corresponding argument is FALSE, i.e.
if their calculation is not requested.
@@ -228,9 +242,13 @@ Author<
Examples
## A graph with two separate trees
-dfs(make_tree(10) %du% make_tree(10),
- root = 1, "out",
- TRUE, TRUE, TRUE, TRUE
+dfs(
+ graph = make_tree(10) %du% make_tree(10),
+ root = 1, mode = "out",
+ unreachable = TRUE,
+ order = TRUE,
+ order.out = TRUE,
+ parent = TRUE
)
#> $root
#> [1] 1
@@ -239,15 +257,15 @@ Examples#> [1] "out"
#>
#> $order
-#> + 20/20 vertices, from 30f8316:
+#> + 20/20 vertices, from 2e544cc:
#> [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 30f8316:
+#> + 20/20 vertices, from 2e544cc:
#> [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 30f8316:
+#> $parent
+#> + 20/20 vertices, from 2e544cc:
#> [1] NA 1 1 2 2 3 3 4 4 5 NA 11 11 12 12 13 13 14 14 15
#>
#> $dist
@@ -256,6 +274,10 @@ Examples#> $neimode
#> [1] "out"
#>
+#> $father
+#> + 20/20 vertices, from 2e544cc:
+#> [1] NA 1 1 2 2 3 3 4 4 5 NA 11 11 12 12 13 13 14 14 15
+#>
## How to use a callback
f.in <- function(graph, data, extra) {
@@ -266,8 +288,9 @@ Examples cat("out:", paste(collapse = ", ", data), "\n")
FALSE
}
-tmp <- dfs(make_tree(10),
- root = 1, "out",
+tmp <- dfs(
+ graph = make_tree(10),
+ root = 1, mode = "out",
in.callback = f.in, out.callback = f.out
)
#> in: 1, 0
@@ -295,7 +318,8 @@ Examplesf.out <- function(graph, data, extra) {
data["vid"] == 1
}
-tmp <- dfs(make_tree(10) %du% make_tree(10),
+tmp <- dfs(
+ graph = make_tree(10) %du% make_tree(10),
root = 1,
out.callback = f.out
)
diff --git a/reference/diameter.html b/reference/diameter.html
index d28cfefa24..e10c89b4b3 100644
--- a/reference/diameter.html
+++ b/reference/diameter.html
@@ -137,12 +137,12 @@ Examplesdiameter(g)
#> [1] 27
get_diameter(g)
-#> + 5/10 vertices, from 43c732d:
+#> + 5/10 vertices, from 78fda03:
#> [1] 1 10 9 8 7
diameter(g, weights = NA)
#> [1] 5
get_diameter(g, weights = NA)
-#> + 6/10 vertices, from 43c732d:
+#> + 6/10 vertices, from 78fda03:
#> [1] 1 2 3 4 5 6
diff --git a/reference/difference.igraph.es.html b/reference/difference.igraph.es.html
index 247562f943..797e20d079 100644
--- a/reference/difference.igraph.es.html
+++ b/reference/difference.igraph.es.html
@@ -110,7 +110,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 5c5dc4d:
+#> + 5/10 vertices, named, from 4e5f3f6:
#> [1] A B C D E
diff --git a/reference/difference.igraph.html b/reference/difference.igraph.html
index e9bd73b823..ff3fd8e6a0 100644
--- a/reference/difference.igraph.html
+++ b/reference/difference.igraph.html
@@ -149,7 +149,7 @@ ExamplesV(sstar)$name <- letters[c(1, 3, 5, 7, 9, 11)]
G <- wheel %m% sstar
print_all(G)
-#> IGRAPH 266d7e8 UN-- 11 15 --
+#> IGRAPH d4ea5fd 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 dcb438120e..7f7ff49bff 100644
--- a/reference/difference.igraph.vs.html
+++ b/reference/difference.igraph.vs.html
@@ -110,7 +110,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 a8805bb:
+#> + 5/10 vertices, named, from e2ceeba:
#> [1] A B C D E
diff --git a/reference/disjoint_union.html b/reference/disjoint_union.html
index 2984f7f956..23bea14c61 100644
--- a/reference/disjoint_union.html
+++ b/reference/disjoint_union.html
@@ -139,10 +139,10 @@ Examplesg2 <- make_ring(10)
V(g2)$name <- letters[11:20]
print_all(g1 %du% g2)
-#> IGRAPH 88efc8f UN-- 20 19 --
+#> IGRAPH f7a1e8c 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 88efc8f (vertex names):
+#> + edges from f7a1e8c (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 b40f0887a9..7e85c770f7 100644
--- a/reference/distances.html
+++ b/reference/distances.html
@@ -369,43 +369,43 @@ Examplesshortest_paths(g, 5)
#> $vpath
#> $vpath[[1]]
-#> + 5/10 vertices, from eaf8d30:
+#> + 5/10 vertices, from d463e36:
#> [1] 5 4 3 2 1
#>
#> $vpath[[2]]
-#> + 4/10 vertices, from eaf8d30:
+#> + 4/10 vertices, from d463e36:
#> [1] 5 4 3 2
#>
#> $vpath[[3]]
-#> + 3/10 vertices, from eaf8d30:
+#> + 3/10 vertices, from d463e36:
#> [1] 5 4 3
#>
#> $vpath[[4]]
-#> + 2/10 vertices, from eaf8d30:
+#> + 2/10 vertices, from d463e36:
#> [1] 5 4
#>
#> $vpath[[5]]
-#> + 1/10 vertex, from eaf8d30:
+#> + 1/10 vertex, from d463e36:
#> [1] 5
#>
#> $vpath[[6]]
-#> + 2/10 vertices, from eaf8d30:
+#> + 2/10 vertices, from d463e36:
#> [1] 5 6
#>
#> $vpath[[7]]
-#> + 3/10 vertices, from eaf8d30:
+#> + 3/10 vertices, from d463e36:
#> [1] 5 6 7
#>
#> $vpath[[8]]
-#> + 4/10 vertices, from eaf8d30:
+#> + 4/10 vertices, from d463e36:
#> [1] 5 6 7 8
#>
#> $vpath[[9]]
-#> + 5/10 vertices, from eaf8d30:
+#> + 5/10 vertices, from d463e36:
#> [1] 5 6 7 8 9
#>
#> $vpath[[10]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 5 4 3 2 1 10
#>
#>
@@ -421,19 +421,19 @@ Examplesall_shortest_paths(g, 1, 6:8)
#> $vpaths
#> $vpaths[[1]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 1 10 9 8 7 6
#>
#> $vpaths[[2]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 1 2 3 4 5 6
#>
#> $vpaths[[3]]
-#> + 5/10 vertices, from eaf8d30:
+#> + 5/10 vertices, from d463e36:
#> [1] 1 10 9 8 7
#>
#> $vpaths[[4]]
-#> + 4/10 vertices, from eaf8d30:
+#> + 4/10 vertices, from d463e36:
#> [1] 1 10 9 8
#>
#>
@@ -456,19 +456,19 @@ Examples#>
#> $res
#> $res[[1]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 1 10 9 8 7 6
#>
#> $res[[2]]
-#> + 6/10 vertices, from eaf8d30:
+#> + 6/10 vertices, from d463e36:
#> [1] 1 2 3 4 5 6
#>
#> $res[[3]]
-#> + 5/10 vertices, from eaf8d30:
+#> + 5/10 vertices, from d463e36:
#> [1] 1 10 9 8 7
#>
#> $res[[4]]
-#> + 4/10 vertices, from eaf8d30:
+#> + 4/10 vertices, from d463e36:
#> [1] 1 10 9 8
#>
#>
diff --git a/reference/edge.html b/reference/edge.html
index aaafabb4f8..87b006cd33 100644
--- a/reference/edge.html
+++ b/reference/edge.html
@@ -126,7 +126,7 @@ Examples edge("8|9")
E(g)[[]]
-#> + 11/11 edges from 9224e28:
+#> + 11/11 edges from 6a3d331:
#> 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 f80577cf10..722d16c468 100644
--- a/reference/edge_attr-set.html
+++ b/reference/edge_attr-set.html
@@ -117,10 +117,10 @@ Examples)
edge_attr(g, "label") <- E(g)$name
g
-#> IGRAPH a3a0796 U--- 10 10 -- Ring graph
+#> IGRAPH ea474dd 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 a3a0796:
+#> + edges from ea474dd:
#> [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 cbf69a97e3..920a01cb02 100644
--- a/reference/edge_attr.html
+++ b/reference/edge_attr.html
@@ -109,10 +109,10 @@ Examples set_edge_attr("weight", value = 1:10) %>%
set_edge_attr("color", value = "red")
g
-#> IGRAPH 8144b59 U-W- 10 10 -- Ring graph
+#> IGRAPH a708d21 U-W- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), weight (e/n), color
#> | (e/c)
-#> + edges from 8144b59:
+#> + edges from a708d21:
#> [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 514f036d9d..118387eb65 100644
--- a/reference/ego.html
+++ b/reference/ego.html
@@ -257,82 +257,82 @@ Examples
ego(g, order = 0, 1:3)
#> [[1]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 1
#>
#> [[2]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 2
#>
#> [[3]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 3
#>
ego(g, order = 1, 1:3)
#> [[1]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 1 2 10
#>
#> [[2]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 2 1 3
#>
#> [[3]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 3 2 4
#>
ego(g, order = 2, 1:3)
#> [[1]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 1 2 10 3 9
#>
#> [[2]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 2 1 3 10 4
#>
#> [[3]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 3 2 4 1 5
#>
# neighborhood() is an alias of ego()
neighborhood(g, order = 0, 1:3)
#> [[1]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 1
#>
#> [[2]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 2
#>
#> [[3]]
-#> + 1/10 vertex, from bdafc7f:
+#> + 1/10 vertex, from 8f74e7f:
#> [1] 3
#>
neighborhood(g, order = 1, 1:3)
#> [[1]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 1 2 10
#>
#> [[2]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 2 1 3
#>
#> [[3]]
-#> + 3/10 vertices, from bdafc7f:
+#> + 3/10 vertices, from 8f74e7f:
#> [1] 3 2 4
#>
neighborhood(g, order = 2, 1:3)
#> [[1]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 1 2 10 3 9
#>
#> [[2]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 2 1 3 10 4
#>
#> [[3]]
-#> + 5/10 vertices, from bdafc7f:
+#> + 5/10 vertices, from 8f74e7f:
#> [1] 3 2 4 1 5
#>
@@ -340,41 +340,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 9ed7602 UN-- 5 4 -- Ring graph
+#> IGRAPH 7a5ae2a UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 9ed7602 (vertex names):
+#> + edges from 7a5ae2a (vertex names):
#> [1] a--b b--c a--j i--j
#>
#> [[2]]
-#> IGRAPH 196d641 UN-- 5 4 -- Ring graph
+#> IGRAPH 2561e22 UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 196d641 (vertex names):
+#> + edges from 2561e22 (vertex names):
#> [1] a--b b--c c--d a--j
#>
#> [[3]]
-#> IGRAPH 20b2c33 UN-- 5 4 -- Ring graph
+#> IGRAPH e0c52cd UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 20b2c33 (vertex names):
+#> + edges from e0c52cd (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 39d5e20 UN-- 5 4 -- Ring graph
+#> IGRAPH 6adf149 UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 39d5e20 (vertex names):
+#> + edges from 6adf149 (vertex names):
#> [1] a--b b--c a--j i--j
#>
#> [[2]]
-#> IGRAPH 1eb9833 UN-- 5 4 -- Ring graph
+#> IGRAPH 8bbcaeb UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 1eb9833 (vertex names):
+#> + edges from 8bbcaeb (vertex names):
#> [1] a--b b--c c--d a--j
#>
#> [[3]]
-#> IGRAPH 2a063b1 UN-- 5 4 -- Ring graph
+#> IGRAPH 3163e51 UN-- 5 4 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c)
-#> + edges from 2a063b1 (vertex names):
+#> + edges from 3163e51 (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 b621e185e7..232918c6fa 100644
--- a/reference/feedback_arc_set.html
+++ b/reference/feedback_arc_set.html
@@ -150,10 +150,10 @@ Examples
g <- sample_gnm(20, 40, directed = TRUE)
feedback_arc_set(g)
-#> + 6/40 edges from c60d2a2:
+#> + 6/40 edges from a333cb1:
#> [1] 6->15 6->19 9->15 11-> 3 16->10 17-> 5
feedback_arc_set(g, algo = "approx_eades")
-#> + 6/40 edges from c60d2a2:
+#> + 6/40 edges from a333cb1:
#> [1] 6->15 6->19 9->15 11-> 3 16->10 17-> 5
diff --git a/reference/feedback_vertex_set.html b/reference/feedback_vertex_set.html
index f6e791bc37..30f7882941 100644
--- a/reference/feedback_vertex_set.html
+++ b/reference/feedback_vertex_set.html
@@ -138,7 +138,7 @@ Examples
g <- make_lattice(c(3,3))
feedback_vertex_set(g)
-#> + 2/9 vertices, from 70de832:
+#> + 2/9 vertices, from 2c30b3d:
#> [1] 2 8
diff --git a/reference/get_edge_ids.html b/reference/get_edge_ids.html
index de1322feb1..7f421f061b 100644
--- a/reference/get_edge_ids.html
+++ b/reference/get_edge_ids.html
@@ -132,7 +132,7 @@ Examplesg <- make_ring(10)
ei <- get_edge_ids(g, c(1, 2, 4, 5))
E(g)[ei]
-#> + 2/10 edges from d40d2dc:
+#> + 2/10 edges from 370dd79:
#> [1] 1--2 4--5
## non-existant edge
@@ -146,7 +146,7 @@ Exampleseis
#> [1] 5 5
E(g)[eis]
-#> + 2/5 edges from 9d47704:
+#> + 2/5 edges from dad1b27:
#> [1] 1->2 1->2
diff --git a/reference/girth.html b/reference/girth.html
index 9097ef8d4c..24765c2ae5 100644
--- a/reference/girth.html
+++ b/reference/girth.html
@@ -147,7 +147,7 @@ Examples#> [1] Inf
#>
#> $circle
-#> + 0/1000 vertices, from ec39c01:
+#> + 0/1000 vertices, from 430ad4c:
#>
# The worst case running time is for a ring
@@ -157,7 +157,7 @@ Examples#> [1] 100
#>
#> $circle
-#> + 100/100 vertices, from 1c24d03:
+#> + 100/100 vertices, from f187a55:
#> [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
@@ -173,7 +173,7 @@ Examples#> [1] 12
#>
#> $circle
-#> + 12/1000 vertices, from 7749d56:
+#> + 12/1000 vertices, from 1bcdab2:
#> [1] 903 811 514 822 850 938 125 275 732 518 446 475
#>
diff --git a/reference/graph_.html b/reference/graph_.html
index f5cdc0bb52..741c1a03a4 100644
--- a/reference/graph_.html
+++ b/reference/graph_.html
@@ -78,12 +78,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 6a0d525 U--- 6 5 --
-#> + edges from 6a0d525:
+#> IGRAPH f173ab1 U--- 6 5 --
+#> + edges from f173ab1:
#> [1] 1--2 2--3 3--4 4--5 5--6
graph_(cbind(1:5, 2:6), from_edgelist(), directed = FALSE)
-#> IGRAPH 3eb47d0 U--- 6 5 --
-#> + edges from 3eb47d0:
+#> IGRAPH cf26952 U--- 6 5 --
+#> + edges from cf26952:
#> [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 07cc756077..d3bc6a4a0d 100644
--- a/reference/graph_attr-set.html
+++ b/reference/graph_attr-set.html
@@ -107,9 +107,9 @@ Examplesg <- make_graph(~ A - B:C:D)
graph_attr(g, "name") <- "4-star"
g
-#> IGRAPH 6a8269d UN-- 4 3 -- 4-star
+#> IGRAPH 2b7d7d1 UN-- 4 3 -- 4-star
#> + attr: name (g/c), name (v/c)
-#> + edges from 6a8269d (vertex names):
+#> + edges from 2b7d7d1 (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 ff7edbc3bc..9f7eef8efe 100644
--- a/reference/graph_center.html
+++ b/reference/graph_center.html
@@ -113,13 +113,13 @@ Related documentation in the C l
Examples
tree <- make_tree(100, 7)
graph_center(tree)
-#> + 2/100 vertices, from feb5edb:
+#> + 2/100 vertices, from a1fb484:
#> [1] 1 2
graph_center(tree, mode = "in")
-#> + 1/100 vertex, from feb5edb:
+#> + 1/100 vertex, from a1fb484:
#> [1] 1
graph_center(tree, mode = "out")
-#> + 85/100 vertices, from feb5edb:
+#> + 85/100 vertices, from a1fb484:
#> [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
@@ -129,12 +129,12 @@ Examples# Without and with weights
ring <- make_ring(10)
graph_center(ring)
-#> + 10/10 vertices, from d791e38:
+#> + 10/10 vertices, from db99cee:
#> [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 d791e38:
+#> + 1/10 vertex, from db99cee:
#> [1] 7
diff --git a/reference/graph_from_adjacency_matrix.html b/reference/graph_from_adjacency_matrix.html
index 115d0c24f2..df9e9c6dc9 100644
--- a/reference/graph_from_adjacency_matrix.html
+++ b/reference/graph_from_adjacency_matrix.html
@@ -315,7 +315,7 @@ Examples add.rownames = "code"
)
summary(g10)
-#> IGRAPH ea38b7d DNW- 10 56 --
+#> IGRAPH 027708a 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 e0ee1b4932..6563cef5e6 100644
--- a/reference/graph_from_atlas.html
+++ b/reference/graph_from_atlas.html
@@ -133,14 +133,14 @@ See alsoExamples
## Some randomly picked graphs from the atlas
graph_from_atlas(sample(0:1252, 1))
-#> IGRAPH 0b80be7 U--- 7 11 -- Graph from the Atlas #766
+#> IGRAPH ddadc60 U--- 7 11 -- Graph from the Atlas #766
#> + attr: name (g/c), n (g/n)
-#> + edges from 0b80be7:
+#> + edges from ddadc60:
#> [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 57ae136 U--- 7 12 -- Graph from the Atlas #893
+#> IGRAPH 5c2f196 U--- 7 12 -- Graph from the Atlas #893
#> + attr: name (g/c), n (g/n)
-#> + edges from 57ae136:
+#> + edges from 5c2f196:
#> [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 922e245518..0f2fa4c545 100644
--- a/reference/graph_from_biadjacency_matrix.html
+++ b/reference/graph_from_biadjacency_matrix.html
@@ -156,9 +156,9 @@ Examplescolnames(inc) <- letters[1:5]
rownames(inc) <- LETTERS[1:3]
graph_from_biadjacency_matrix(inc)
-#> IGRAPH 004256d UN-B 8 9 --
+#> IGRAPH c9e4979 UN-B 8 9 --
#> + attr: type (v/l), name (v/c)
-#> + edges from 004256d (vertex names):
+#> + edges from c9e4979 (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 f9b6420336..ce9ee59f16 100644
--- a/reference/graph_from_data_frame.html
+++ b/reference/graph_from_data_frame.html
@@ -200,10 +200,10 @@ Examples)
g <- graph_from_data_frame(relations, directed = TRUE, vertices = actors)
print(g, e = TRUE, v = TRUE)
-#> IGRAPH 07a1a9b DN-- 5 6 --
+#> IGRAPH d30ce83 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 07a1a9b (vertex names):
+#> + edges from d30ce83 (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 19e5839e40..33b0f78d1d 100644
--- a/reference/graph_from_edgelist.html
+++ b/reference/graph_from_edgelist.html
@@ -116,15 +116,15 @@ See alsoExamples
el <- matrix(c("foo", "bar", "bar", "foobar"), nc = 2, byrow = TRUE)
graph_from_edgelist(el)
-#> IGRAPH 95590ca DN-- 3 2 --
+#> IGRAPH 95b9b9c DN-- 3 2 --
#> + attr: name (v/c)
-#> + edges from 95590ca (vertex names):
+#> + edges from 95b9b9c (vertex names):
#> [1] foo->bar bar->foobar
# Create a ring by hand
graph_from_edgelist(cbind(1:10, c(2:10, 1)))
-#> IGRAPH 7d72f9d D--- 10 10 --
-#> + edges from 7d72f9d:
+#> IGRAPH ac9fe3b D--- 10 10 --
+#> + edges from ac9fe3b:
#> [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 220d99206e..6bd7368c43 100644
--- a/reference/graph_from_graphnel.html
+++ b/reference/graph_from_graphnel.html
@@ -139,10 +139,10 @@ ExamplesGNEL <- as_graphnel(g)
g2 <- graph_from_graphnel(GNEL)
g2
-#> IGRAPH 97d4d93 UNW- 10 10 -- Ring graph
+#> IGRAPH a04c3d2 UNW- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l), name (v/c), weight
#> | (e/n)
-#> + edges from 97d4d93 (vertex names):
+#> + edges from a04c3d2 (vertex names):
#> [1] a--b a--j b--c c--d d--e e--f f--g g--h h--i i--j
## Directed
@@ -151,9 +151,9 @@ ExamplesGNEL2 <- as_graphnel(g3)
g4 <- graph_from_graphnel(GNEL2)
g4
-#> IGRAPH ee95d7f DNW- 10 9 -- In-star
+#> IGRAPH 5d1e606 DNW- 10 9 -- In-star
#> + attr: name (g/c), mode (g/c), center (g/n), name (v/c), weight (e/n)
-#> + edges from ee95d7f (vertex names):
+#> + edges from 5d1e606 (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 ef3e027194..0a38a1c973 100644
--- a/reference/graph_from_literal.html
+++ b/reference/graph_from_literal.html
@@ -152,18 +152,18 @@ Examples Cecil - Gordon
)
g
-#> IGRAPH 507bc22 UN-- 6 6 --
+#> IGRAPH f1fd02f UN-- 6 6 --
#> + attr: name (v/c)
-#> + edges from 507bc22 (vertex names):
+#> + edges from f1fd02f (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 7268293 UN-- 6 7 --
+#> IGRAPH eed46ff UN-- 6 7 --
#> + attr: name (v/c)
-#> + edges from 7268293 (vertex names):
+#> + edges from eed46ff (vertex names):
#> [1] Alice --Bob Alice --Cecil Alice --Daniel Cecil --Eugene Cecil --Gordon
#> [6] Daniel--Eugene Daniel--Gordon
@@ -173,18 +173,18 @@ Examples Eugene --+ Gordon:Helen
)
g3
-#> IGRAPH ebb89a4 DN-- 7 6 --
+#> IGRAPH ee55d28 DN-- 7 6 --
#> + attr: name (v/c)
-#> + edges from ebb89a4 (vertex names):
+#> + edges from ee55d28 (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 1ed4d71 UN-- 6 2 --
+#> IGRAPH 1b53c58 UN-- 6 2 --
#> + attr: name (v/c)
-#> + edges from 1ed4d71 (vertex names):
+#> + edges from 1b53c58 (vertex names):
#> [1] Alice--Bob Bob --Daniel
V(g4)$name
#> [1] "Alice" "Bob" "Daniel" "Cecil" "Gordon" "Helen"
@@ -192,17 +192,17 @@ Examples# "Arrows" can be arbitrarily long
g5 <- graph_from_literal(Alice +---------+ Bob)
g5
-#> IGRAPH 4cbc4f9 DN-- 2 2 --
+#> IGRAPH 1b8bf62 DN-- 2 2 --
#> + attr: name (v/c)
-#> + edges from 4cbc4f9 (vertex names):
+#> + edges from 1b8bf62 (vertex names):
#> [1] Alice->Bob Bob ->Alice
# Special vertex names
g6 <- graph_from_literal("+" -- "-", "*" -- "/", "%%" -- "%/%")
g6
-#> IGRAPH 50f7b27 UN-- 6 3 --
+#> IGRAPH c0aef3c UN-- 6 3 --
#> + attr: name (v/c)
-#> + edges from 50f7b27 (vertex names):
+#> + edges from c0aef3c (vertex names):
#> [1] + --- * --/ %%--%/%
diff --git a/reference/graph_id.html b/reference/graph_id.html
index 8bccc23d63..c6f0b2ede3 100644
--- a/reference/graph_id.html
+++ b/reference/graph_id.html
@@ -89,15 +89,15 @@ Value
Examples
g <- make_ring(10)
graph_id(g)
-#> [1] "2b820c23-2572-4217-a876-c3009de7bffd"
+#> [1] "37bff9f5-39b6-4e9e-9a7a-7c329256ec17"
graph_id(V(g))
-#> [1] "2b820c23-2572-4217-a876-c3009de7bffd"
+#> [1] "37bff9f5-39b6-4e9e-9a7a-7c329256ec17"
graph_id(E(g))
-#> [1] "2b820c23-2572-4217-a876-c3009de7bffd"
+#> [1] "37bff9f5-39b6-4e9e-9a7a-7c329256ec17"
g2 <- g + 1
graph_id(g2)
-#> [1] "8fae7394-a945-483e-aa98-29ebaaab1e48"
+#> [1] "66d1c9de-d144-4b76-8aad-627660387eca"
diff --git a/reference/igraph-es-indexing.html b/reference/igraph-es-indexing.html
index 596be2459c..648c866376 100644
--- a/reference/igraph-es-indexing.html
+++ b/reference/igraph-es-indexing.html
@@ -203,13 +203,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 d3e7968:
+#> + 4/99 edges from 18d7929:
#> [1] 2->1 3->1 4->1 6->1
E(g)[1:5 %->% 1:6]
-#> + 4/99 edges from d3e7968:
+#> + 4/99 edges from 18d7929:
#> [1] 2->1 3->1 4->1 5->4
E(g)[1:3 %<-% 2:6]
-#> + 4/99 edges from d3e7968:
+#> + 4/99 edges from 18d7929:
#> [1] 2->1 3->1 4->1 6->1
# -----------------------------------------------------------------
@@ -217,7 +217,7 @@ Examplesg <- sample_pa(100, directed = FALSE)
d <- get_diameter(g)
E(g, path = d)
-#> + 11/99 edges from 1c2084d:
+#> + 11/99 edges from 3541e6c:
#> [1] 53--81 49--53 43--49 4--43 2-- 4 2-- 5 5-- 9 9--14 14--36 36--58
#> [11] 58--85
@@ -226,7 +226,7 @@ Examplesg <- sample_gnp(20, 3 / 20) %>%
set_edge_attr("weight", value = rnorm(gsize(.)))
E(g)[[weight < 0]]
-#> + 19/32 edges from 7c107f3:
+#> + 19/32 edges from 9f547fc:
#> tail head tid hid weight
#> 2 1 6 1 6 -1.0667237
#> 3 5 6 5 6 -2.7731724
@@ -253,7 +253,7 @@ ExamplesE(g)$x <- E(g)$weight
x <- 2
E(g)[.env$x]
-#> + 1/32 edge from 7c107f3:
+#> + 1/32 edge from 9f547fc:
#> [1] 1--6
diff --git a/reference/igraph-es-indexing2.html b/reference/igraph-es-indexing2.html
index e1b5988017..4cf4656b6c 100644
--- a/reference/igraph-es-indexing2.html
+++ b/reference/igraph-es-indexing2.html
@@ -126,10 +126,10 @@ Examples with_edge_(weight = 1:10, color = "green")
)
E(g)
-#> + 10/10 edges from 606b218 (vertex names):
+#> + 10/10 edges from 93fdca3 (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 606b218 (vertex names):
+#> + 10/10 edges from 93fdca3 (vertex names):
#> tail head tid hid weight color
#> 1 A B 1 2 1 green
#> 2 B C 2 3 2 green
@@ -142,7 +142,7 @@ Examples#> 9 I J 9 10 9 green
#> 10 A J 1 10 10 green
E(g)[[.inc("A")]]
-#> + 2/10 edges from 606b218 (vertex names):
+#> + 2/10 edges from 93fdca3 (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 159d814666..bd3a9078dc 100644
--- a/reference/igraph-vs-indexing.html
+++ b/reference/igraph-vs-indexing.html
@@ -222,26 +222,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 a6d8901:
+#> + 4/4 vertices, from 8a2f335:
#> [1] 1 2 3 4
V(g)[.nei(c(2, 4), "in")]
-#> + 3/4 vertices, from a6d8901:
+#> + 3/4 vertices, from 8a2f335:
#> [1] 1 2 4
V(g)[.nei(c(2, 4), "out")]
-#> + 3/4 vertices, from a6d8901:
+#> + 3/4 vertices, from 8a2f335:
#> [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 fe3b7cb:
+#> + 4/4 vertices, named, from 2fb567d:
#> [1] A B C D
V(g)[.nei(c("B", "D"), "in")]
-#> + 3/4 vertices, named, from fe3b7cb:
+#> + 3/4 vertices, named, from 2fb567d:
#> [1] A B D
V(g)[.nei(c("B", "D"), "out")]
-#> + 3/4 vertices, named, from fe3b7cb:
+#> + 3/4 vertices, named, from 2fb567d:
#> [1] B C D
# -----------------------------------------------------------------
@@ -249,7 +249,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 b601d34:
+#> + 2/4 vertices, named, from 8499aa0:
#> [1] A B
# Indexing with a variable whose name matches the name of an attribute
@@ -257,7 +257,7 @@ ExamplesV(g)$x <- 10:13
x <- 2
V(g)[.env$x]
-#> + 1/4 vertex, named, from b601d34:
+#> + 1/4 vertex, named, from 8499aa0:
#> [1] B
Examples#> 9 red I
#> 10 red J
V(g)[1:5]
-#> + 5/10 vertices, named, from a25447c:
+#> + 5/10 vertices, named, from 93700f9:
#> [1] A B C D E
V(g)[[1:5]]
-#> + 5/10 vertices, named, from a25447c:
+#> + 5/10 vertices, named, from 93700f9:
#> color name
#> 1 red A
#> 2 red B
diff --git a/reference/incident.html b/reference/incident.html
index 62ac648636..ae98982840 100644
--- a/reference/incident.html
+++ b/reference/incident.html
@@ -103,11 +103,11 @@ See alsoExamples
g <- make_graph("Zachary")
incident(g, 1)
-#> + 16/78 edges from 0b27126:
+#> + 16/78 edges from afb424e:
#> [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 0b27126:
+#> + 17/78 edges from afb424e:
#> [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 06eae662e5..f66826c28e 100644
--- a/reference/incident_edges.html
+++ b/reference/incident_edges.html
@@ -106,12 +106,12 @@ Examplesg <- make_graph("Zachary")
incident_edges(g, c(1, 34))
#> [[1]]
-#> + 16/78 edges from 4018ba6:
+#> + 16/78 edges from 5d88b61:
#> [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 4018ba6:
+#> + 17/78 edges from 5d88b61:
#> [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 532bd44671..ad40f128d7 100644
--- a/reference/intersection.igraph.es.html
+++ b/reference/intersection.igraph.es.html
@@ -102,7 +102,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 fc164c8 (vertex names):
+#> + 2/10 edges from b5a86bf (vertex names):
#> [1] E--F F--G
diff --git a/reference/intersection.igraph.html b/reference/intersection.igraph.html
index a431a31c12..c94f83f4fd 100644
--- a/reference/intersection.igraph.html
+++ b/reference/intersection.igraph.html
@@ -147,7 +147,7 @@ Examples)
net2 <- graph_from_literal(D - A:F:Y, B - A - X - F - H - Z, F - Y)
print_all(net1 %s% net2)
-#> IGRAPH 1af1dc5 UN-- 13 4 --
+#> IGRAPH d2f2a72 UN-- 13 4 --
#> + attr: name (v/c)
#> + vertex attributes:
#> | name
@@ -164,7 +164,7 @@ Examples#> | [11] Y
#> | [12] X
#> | [13] Z
-#> + edges from 1af1dc5 (vertex names):
+#> + edges from d2f2a72 (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 e6ae28a165..409ad322ee 100644
--- a/reference/intersection.igraph.vs.html
+++ b/reference/intersection.igraph.vs.html
@@ -102,7 +102,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 4e5bad3 (vertex names):
+#> + 2/10 edges from 2fef653 (vertex names):
#> [1] E--F F--G
diff --git a/reference/is_chordal.html b/reference/is_chordal.html
index d6efa6d412..a203716f69 100644
--- a/reference/is_chordal.html
+++ b/reference/is_chordal.html
@@ -158,7 +158,7 @@ Examples#> [1] 9 4 6 8 3 5 7 2 1
#>
#> $alpham1
-#> + 9/9 vertices, named, from e92fb7b:
+#> + 9/9 vertices, named, from 120e084:
#> [1] G F D B E C H I A
#>
is_chordal(g1, fillin = TRUE)
@@ -182,7 +182,7 @@ Examples#> [1] 10 8 9 6 7 5 4 2 3 1
#>
#> $alpham1
-#> + 10/10 vertices, named, from 1882bfa:
+#> + 10/10 vertices, named, from f3e9782:
#> [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 fc4a3388a5..24b1c2e8c0 100644
--- a/reference/is_forest.html
+++ b/reference/is_forest.html
@@ -128,7 +128,7 @@ Examples#> [1] TRUE
#>
#> $roots
-#> + 2/8 vertices, from c6e71c9:
+#> + 2/8 vertices, from 0f899dd:
#> [1] 1 4
#>
diff --git a/reference/is_named.html b/reference/is_named.html
index 938dee118e..f0da5c87ea 100644
--- a/reference/is_named.html
+++ b/reference/is_named.html
@@ -101,7 +101,7 @@ Examplesis_named(g)
#> [1] TRUE
neighbors(g, "a")
-#> + 2/10 vertices, named, from 718bf0d:
+#> + 2/10 vertices, named, from 9fa5a1d:
#> [1] b j
diff --git a/reference/is_separator.html b/reference/is_separator.html
index a8bf4b5c9a..f4aa330809 100644
--- a/reference/is_separator.html
+++ b/reference/is_separator.html
@@ -114,11 +114,11 @@ Examplesring <- make_ring(4)
min_st_separators(ring)
#> [[1]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 2 4
#>
#> [[2]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 1 3
#>
is_separator(ring, 1)
diff --git a/reference/is_tree.html b/reference/is_tree.html
index d845481735..0da9a43745 100644
--- a/reference/is_tree.html
+++ b/reference/is_tree.html
@@ -129,7 +129,7 @@ Examples#> [1] TRUE
#>
#> $root
-#> + 1/7 vertex, from 4a32e84:
+#> + 1/7 vertex, from c7b73eb:
#> [1] 1
#>
diff --git a/reference/is_weighted.html b/reference/is_weighted.html
index 277b6e3aa5..d339513d50 100644
--- a/reference/is_weighted.html
+++ b/reference/is_weighted.html
@@ -97,7 +97,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 5/10 vertices, from 7d9455d:
+#> + 5/10 vertices, from 67d2c45:
#> [1] 8 9 10 1 2
#>
#>
@@ -114,7 +114,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 7/10 vertices, from 7d9455d:
+#> + 7/10 vertices, from 67d2c45:
#> [1] 8 7 6 5 4 3 2
#>
#>
diff --git a/reference/ivs.html b/reference/ivs.html
index 1f66aca972..9eeffe63eb 100644
--- a/reference/ivs.html
+++ b/reference/ivs.html
@@ -149,83 +149,83 @@ Examples#> [1] 4
ivs(g, min = ivs_size(g))
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
largest_ivs(g)
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
# Empty graph
induced_subgraph(g, largest_ivs(g)[[1]])
-#> IGRAPH b014c2f U--- 4 0 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 19967fb U--- 4 0 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from b014c2f:
+#> + edges from 19967fb:
length(max_ivs(g))
#> [1] 326
diff --git a/reference/keeping_degseq.html b/reference/keeping_degseq.html
index 08bbe5e9a2..4fdb88e033 100644
--- a/reference/keeping_degseq.html
+++ b/reference/keeping_degseq.html
@@ -104,7 +104,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 2496492 U--- 10 10 -- Ring graph
+#> IGRAPH 6cd3af8 U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
#> + graph attributes:
#> | + name:
@@ -113,7 +113,7 @@ Examples#> | [1] FALSE
#> | + circular:
#> | [1] TRUE
-#> + edges from 2496492:
+#> + edges from 6cd3af8:
#> [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 eaebeca7a3..760bbe3cfe 100644
--- a/reference/make_bipartite_graph.html
+++ b/reference/make_bipartite_graph.html
@@ -127,9 +127,9 @@ Examples
g <- make_bipartite_graph(rep(0:1, length.out = 10), c(1:10))
print(g, v = TRUE)
-#> IGRAPH 1dc5f2d U--B 10 5 --
+#> IGRAPH 8145264 U--B 10 5 --
#> + attr: type (v/l)
-#> + edges from 1dc5f2d:
+#> + edges from 8145264:
#> [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 f6f72e6161..22afda4c3c 100644
--- a/reference/make_de_bruijn_graph.html
+++ b/reference/make_de_bruijn_graph.html
@@ -109,14 +109,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 5526008 D--- 4 8 -- De-Bruijn graph 2-2
+#> IGRAPH 5464f62 D--- 4 8 -- De-Bruijn graph 2-2
#> + attr: name (g/c), m (g/n), n (g/n)
-#> + edges from 5526008:
+#> + edges from 5464f62:
#> [1] 1->1 1->2 2->3 2->4 3->1 3->2 4->3 4->4
make_line_graph(g)
-#> IGRAPH ed0c358 D--- 4 8 -- Line graph
+#> IGRAPH f070c0e D--- 4 8 -- Line graph
#> + attr: name (g/c)
-#> + edges from ed0c358:
+#> + edges from f070c0e:
#> [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 c5f49417b4..16e01c5d59 100644
--- a/reference/make_empty_graph.html
+++ b/reference/make_empty_graph.html
@@ -104,11 +104,11 @@ Related documentation in the C l
Examples
make_empty_graph(n = 10)
-#> IGRAPH 839c1eb D--- 10 0 --
-#> + edges from 839c1eb:
+#> IGRAPH 440ddf9 D--- 10 0 --
+#> + edges from 440ddf9:
make_empty_graph(n = 5, directed = FALSE)
-#> IGRAPH d7b2f94 U--- 5 0 --
-#> + edges from d7b2f94:
+#> IGRAPH 870a491 U--- 5 0 --
+#> + edges from 870a491:
g <- make_graph("Zachary")
incident(g, 1)
-#> + 16/78 edges from 0b27126:
+#> + 16/78 edges from afb424e:
#> [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 0b27126:
+#> + 17/78 edges from afb424e:
#> [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
g <- make_graph("Zachary")
incident_edges(g, c(1, 34))
#> [[1]]
-#> + 16/78 edges from 4018ba6:
+#> + 16/78 edges from 5d88b61:
#> [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 4018ba6:
+#> + 17/78 edges from 5d88b61:
#> [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 532bd44671..ad40f128d7 100644
--- a/reference/intersection.igraph.es.html
+++ b/reference/intersection.igraph.es.html
@@ -102,7 +102,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 fc164c8 (vertex names):
+#> + 2/10 edges from b5a86bf (vertex names):
#> [1] E--F F--G
diff --git a/reference/intersection.igraph.html b/reference/intersection.igraph.html
index a431a31c12..c94f83f4fd 100644
--- a/reference/intersection.igraph.html
+++ b/reference/intersection.igraph.html
@@ -147,7 +147,7 @@ Examples)
net2 <- graph_from_literal(D - A:F:Y, B - A - X - F - H - Z, F - Y)
print_all(net1 %s% net2)
-#> IGRAPH 1af1dc5 UN-- 13 4 --
+#> IGRAPH d2f2a72 UN-- 13 4 --
#> + attr: name (v/c)
#> + vertex attributes:
#> | name
@@ -164,7 +164,7 @@ Examples#> | [11] Y
#> | [12] X
#> | [13] Z
-#> + edges from 1af1dc5 (vertex names):
+#> + edges from d2f2a72 (vertex names):
#> [1] F--H A--B D--F D--A
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 4e5bad3 (vertex names):
+#> + 2/10 edges from 2fef653 (vertex names):
#> [1] E--F F--G
Examples#> [1] 9 4 6 8 3 5 7 2 1
#>
#> $alpham1
-#> + 9/9 vertices, named, from e92fb7b:
+#> + 9/9 vertices, named, from 120e084:
#> [1] G F D B E C H I A
#>
is_chordal(g1, fillin = TRUE)
@@ -182,7 +182,7 @@ Examples#> [1] 10 8 9 6 7 5 4 2 3 1
#>
#> $alpham1
-#> + 10/10 vertices, named, from 1882bfa:
+#> + 10/10 vertices, named, from f3e9782:
#> [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 fc4a3388a5..24b1c2e8c0 100644
--- a/reference/is_forest.html
+++ b/reference/is_forest.html
@@ -128,7 +128,7 @@ Examples#> [1] TRUE
#>
#> $roots
-#> + 2/8 vertices, from c6e71c9:
+#> + 2/8 vertices, from 0f899dd:
#> [1] 1 4
#>
diff --git a/reference/is_named.html b/reference/is_named.html
index 938dee118e..f0da5c87ea 100644
--- a/reference/is_named.html
+++ b/reference/is_named.html
@@ -101,7 +101,7 @@ Examplesis_named(g)
#> [1] TRUE
neighbors(g, "a")
-#> + 2/10 vertices, named, from 718bf0d:
+#> + 2/10 vertices, named, from 9fa5a1d:
#> [1] b j
diff --git a/reference/is_separator.html b/reference/is_separator.html
index a8bf4b5c9a..f4aa330809 100644
--- a/reference/is_separator.html
+++ b/reference/is_separator.html
@@ -114,11 +114,11 @@ Examplesring <- make_ring(4)
min_st_separators(ring)
#> [[1]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 2 4
#>
#> [[2]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 1 3
#>
is_separator(ring, 1)
diff --git a/reference/is_tree.html b/reference/is_tree.html
index d845481735..0da9a43745 100644
--- a/reference/is_tree.html
+++ b/reference/is_tree.html
@@ -129,7 +129,7 @@ Examples#> [1] TRUE
#>
#> $root
-#> + 1/7 vertex, from 4a32e84:
+#> + 1/7 vertex, from c7b73eb:
#> [1] 1
#>
diff --git a/reference/is_weighted.html b/reference/is_weighted.html
index 277b6e3aa5..d339513d50 100644
--- a/reference/is_weighted.html
+++ b/reference/is_weighted.html
@@ -97,7 +97,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 5/10 vertices, from 7d9455d:
+#> + 5/10 vertices, from 67d2c45:
#> [1] 8 9 10 1 2
#>
#>
@@ -114,7 +114,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 7/10 vertices, from 7d9455d:
+#> + 7/10 vertices, from 67d2c45:
#> [1] 8 7 6 5 4 3 2
#>
#>
diff --git a/reference/ivs.html b/reference/ivs.html
index 1f66aca972..9eeffe63eb 100644
--- a/reference/ivs.html
+++ b/reference/ivs.html
@@ -149,83 +149,83 @@ Examples#> [1] 4
ivs(g, min = ivs_size(g))
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
largest_ivs(g)
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
# Empty graph
induced_subgraph(g, largest_ivs(g)[[1]])
-#> IGRAPH b014c2f U--- 4 0 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 19967fb U--- 4 0 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from b014c2f:
+#> + edges from 19967fb:
length(max_ivs(g))
#> [1] 326
diff --git a/reference/keeping_degseq.html b/reference/keeping_degseq.html
index 08bbe5e9a2..4fdb88e033 100644
--- a/reference/keeping_degseq.html
+++ b/reference/keeping_degseq.html
@@ -104,7 +104,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 2496492 U--- 10 10 -- Ring graph
+#> IGRAPH 6cd3af8 U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
#> + graph attributes:
#> | + name:
@@ -113,7 +113,7 @@ Examples#> | [1] FALSE
#> | + circular:
#> | [1] TRUE
-#> + edges from 2496492:
+#> + edges from 6cd3af8:
#> [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 eaebeca7a3..760bbe3cfe 100644
--- a/reference/make_bipartite_graph.html
+++ b/reference/make_bipartite_graph.html
@@ -127,9 +127,9 @@ Examples
g <- make_bipartite_graph(rep(0:1, length.out = 10), c(1:10))
print(g, v = TRUE)
-#> IGRAPH 1dc5f2d U--B 10 5 --
+#> IGRAPH 8145264 U--B 10 5 --
#> + attr: type (v/l)
-#> + edges from 1dc5f2d:
+#> + edges from 8145264:
#> [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 f6f72e6161..22afda4c3c 100644
--- a/reference/make_de_bruijn_graph.html
+++ b/reference/make_de_bruijn_graph.html
@@ -109,14 +109,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 5526008 D--- 4 8 -- De-Bruijn graph 2-2
+#> IGRAPH 5464f62 D--- 4 8 -- De-Bruijn graph 2-2
#> + attr: name (g/c), m (g/n), n (g/n)
-#> + edges from 5526008:
+#> + edges from 5464f62:
#> [1] 1->1 1->2 2->3 2->4 3->1 3->2 4->3 4->4
make_line_graph(g)
-#> IGRAPH ed0c358 D--- 4 8 -- Line graph
+#> IGRAPH f070c0e D--- 4 8 -- Line graph
#> + attr: name (g/c)
-#> + edges from ed0c358:
+#> + edges from f070c0e:
#> [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 c5f49417b4..16e01c5d59 100644
--- a/reference/make_empty_graph.html
+++ b/reference/make_empty_graph.html
@@ -104,11 +104,11 @@ Related documentation in the C l
Examples
make_empty_graph(n = 10)
-#> IGRAPH 839c1eb D--- 10 0 --
-#> + edges from 839c1eb:
+#> IGRAPH 440ddf9 D--- 10 0 --
+#> + edges from 440ddf9:
make_empty_graph(n = 5, directed = FALSE)
-#> IGRAPH d7b2f94 U--- 5 0 --
-#> + edges from d7b2f94:
+#> IGRAPH 870a491 U--- 5 0 --
+#> + edges from 870a491:
Examples#> [1] TRUE
#>
#> $roots
-#> + 2/8 vertices, from c6e71c9:
+#> + 2/8 vertices, from 0f899dd:
#> [1] 1 4
#>
diff --git a/reference/is_named.html b/reference/is_named.html
index 938dee118e..f0da5c87ea 100644
--- a/reference/is_named.html
+++ b/reference/is_named.html
@@ -101,7 +101,7 @@ Examplesis_named(g)
#> [1] TRUE
neighbors(g, "a")
-#> + 2/10 vertices, named, from 718bf0d:
+#> + 2/10 vertices, named, from 9fa5a1d:
#> [1] b j
diff --git a/reference/is_separator.html b/reference/is_separator.html
index a8bf4b5c9a..f4aa330809 100644
--- a/reference/is_separator.html
+++ b/reference/is_separator.html
@@ -114,11 +114,11 @@ Examplesring <- make_ring(4)
min_st_separators(ring)
#> [[1]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 2 4
#>
#> [[2]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 1 3
#>
is_separator(ring, 1)
diff --git a/reference/is_tree.html b/reference/is_tree.html
index d845481735..0da9a43745 100644
--- a/reference/is_tree.html
+++ b/reference/is_tree.html
@@ -129,7 +129,7 @@ Examples#> [1] TRUE
#>
#> $root
-#> + 1/7 vertex, from 4a32e84:
+#> + 1/7 vertex, from c7b73eb:
#> [1] 1
#>
diff --git a/reference/is_weighted.html b/reference/is_weighted.html
index 277b6e3aa5..d339513d50 100644
--- a/reference/is_weighted.html
+++ b/reference/is_weighted.html
@@ -97,7 +97,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 5/10 vertices, from 7d9455d:
+#> + 5/10 vertices, from 67d2c45:
#> [1] 8 9 10 1 2
#>
#>
@@ -114,7 +114,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 7/10 vertices, from 7d9455d:
+#> + 7/10 vertices, from 67d2c45:
#> [1] 8 7 6 5 4 3 2
#>
#>
diff --git a/reference/ivs.html b/reference/ivs.html
index 1f66aca972..9eeffe63eb 100644
--- a/reference/ivs.html
+++ b/reference/ivs.html
@@ -149,83 +149,83 @@ Examples#> [1] 4
ivs(g, min = ivs_size(g))
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
largest_ivs(g)
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
# Empty graph
induced_subgraph(g, largest_ivs(g)[[1]])
-#> IGRAPH b014c2f U--- 4 0 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 19967fb U--- 4 0 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from b014c2f:
+#> + edges from 19967fb:
length(max_ivs(g))
#> [1] 326
diff --git a/reference/keeping_degseq.html b/reference/keeping_degseq.html
index 08bbe5e9a2..4fdb88e033 100644
--- a/reference/keeping_degseq.html
+++ b/reference/keeping_degseq.html
@@ -104,7 +104,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 2496492 U--- 10 10 -- Ring graph
+#> IGRAPH 6cd3af8 U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
#> + graph attributes:
#> | + name:
@@ -113,7 +113,7 @@ Examples#> | [1] FALSE
#> | + circular:
#> | [1] TRUE
-#> + edges from 2496492:
+#> + edges from 6cd3af8:
#> [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 eaebeca7a3..760bbe3cfe 100644
--- a/reference/make_bipartite_graph.html
+++ b/reference/make_bipartite_graph.html
@@ -127,9 +127,9 @@ Examples
g <- make_bipartite_graph(rep(0:1, length.out = 10), c(1:10))
print(g, v = TRUE)
-#> IGRAPH 1dc5f2d U--B 10 5 --
+#> IGRAPH 8145264 U--B 10 5 --
#> + attr: type (v/l)
-#> + edges from 1dc5f2d:
+#> + edges from 8145264:
#> [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 f6f72e6161..22afda4c3c 100644
--- a/reference/make_de_bruijn_graph.html
+++ b/reference/make_de_bruijn_graph.html
@@ -109,14 +109,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 5526008 D--- 4 8 -- De-Bruijn graph 2-2
+#> IGRAPH 5464f62 D--- 4 8 -- De-Bruijn graph 2-2
#> + attr: name (g/c), m (g/n), n (g/n)
-#> + edges from 5526008:
+#> + edges from 5464f62:
#> [1] 1->1 1->2 2->3 2->4 3->1 3->2 4->3 4->4
make_line_graph(g)
-#> IGRAPH ed0c358 D--- 4 8 -- Line graph
+#> IGRAPH f070c0e D--- 4 8 -- Line graph
#> + attr: name (g/c)
-#> + edges from ed0c358:
+#> + edges from f070c0e:
#> [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 c5f49417b4..16e01c5d59 100644
--- a/reference/make_empty_graph.html
+++ b/reference/make_empty_graph.html
@@ -104,11 +104,11 @@ Related documentation in the C l
Examples
make_empty_graph(n = 10)
-#> IGRAPH 839c1eb D--- 10 0 --
-#> + edges from 839c1eb:
+#> IGRAPH 440ddf9 D--- 10 0 --
+#> + edges from 440ddf9:
make_empty_graph(n = 5, directed = FALSE)
-#> IGRAPH d7b2f94 U--- 5 0 --
-#> + edges from d7b2f94:
+#> IGRAPH 870a491 U--- 5 0 --
+#> + edges from 870a491:
Examplesring <- make_ring(4)
min_st_separators(ring)
#> [[1]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 2 4
#>
#> [[2]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 1 3
#>
is_separator(ring, 1)
diff --git a/reference/is_tree.html b/reference/is_tree.html
index d845481735..0da9a43745 100644
--- a/reference/is_tree.html
+++ b/reference/is_tree.html
@@ -129,7 +129,7 @@ Examples#> [1] TRUE
#>
#> $root
-#> + 1/7 vertex, from 4a32e84:
+#> + 1/7 vertex, from c7b73eb:
#> [1] 1
#>
diff --git a/reference/is_weighted.html b/reference/is_weighted.html
index 277b6e3aa5..d339513d50 100644
--- a/reference/is_weighted.html
+++ b/reference/is_weighted.html
@@ -97,7 +97,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 5/10 vertices, from 7d9455d:
+#> + 5/10 vertices, from 67d2c45:
#> [1] 8 9 10 1 2
#>
#>
@@ -114,7 +114,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 7/10 vertices, from 7d9455d:
+#> + 7/10 vertices, from 67d2c45:
#> [1] 8 7 6 5 4 3 2
#>
#>
diff --git a/reference/ivs.html b/reference/ivs.html
index 1f66aca972..9eeffe63eb 100644
--- a/reference/ivs.html
+++ b/reference/ivs.html
@@ -149,83 +149,83 @@ Examples#> [1] 4
ivs(g, min = ivs_size(g))
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
largest_ivs(g)
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
# Empty graph
induced_subgraph(g, largest_ivs(g)[[1]])
-#> IGRAPH b014c2f U--- 4 0 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 19967fb U--- 4 0 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from b014c2f:
+#> + edges from 19967fb:
length(max_ivs(g))
#> [1] 326
diff --git a/reference/keeping_degseq.html b/reference/keeping_degseq.html
index 08bbe5e9a2..4fdb88e033 100644
--- a/reference/keeping_degseq.html
+++ b/reference/keeping_degseq.html
@@ -104,7 +104,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 2496492 U--- 10 10 -- Ring graph
+#> IGRAPH 6cd3af8 U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
#> + graph attributes:
#> | + name:
@@ -113,7 +113,7 @@ Examples#> | [1] FALSE
#> | + circular:
#> | [1] TRUE
-#> + edges from 2496492:
+#> + edges from 6cd3af8:
#> [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 eaebeca7a3..760bbe3cfe 100644
--- a/reference/make_bipartite_graph.html
+++ b/reference/make_bipartite_graph.html
@@ -127,9 +127,9 @@ Examples
g <- make_bipartite_graph(rep(0:1, length.out = 10), c(1:10))
print(g, v = TRUE)
-#> IGRAPH 1dc5f2d U--B 10 5 --
+#> IGRAPH 8145264 U--B 10 5 --
#> + attr: type (v/l)
-#> + edges from 1dc5f2d:
+#> + edges from 8145264:
#> [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 f6f72e6161..22afda4c3c 100644
--- a/reference/make_de_bruijn_graph.html
+++ b/reference/make_de_bruijn_graph.html
@@ -109,14 +109,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 5526008 D--- 4 8 -- De-Bruijn graph 2-2
+#> IGRAPH 5464f62 D--- 4 8 -- De-Bruijn graph 2-2
#> + attr: name (g/c), m (g/n), n (g/n)
-#> + edges from 5526008:
+#> + edges from 5464f62:
#> [1] 1->1 1->2 2->3 2->4 3->1 3->2 4->3 4->4
make_line_graph(g)
-#> IGRAPH ed0c358 D--- 4 8 -- Line graph
+#> IGRAPH f070c0e D--- 4 8 -- Line graph
#> + attr: name (g/c)
-#> + edges from ed0c358:
+#> + edges from f070c0e:
#> [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 c5f49417b4..16e01c5d59 100644
--- a/reference/make_empty_graph.html
+++ b/reference/make_empty_graph.html
@@ -104,11 +104,11 @@ Related documentation in the C l
Examples
make_empty_graph(n = 10)
-#> IGRAPH 839c1eb D--- 10 0 --
-#> + edges from 839c1eb:
+#> IGRAPH 440ddf9 D--- 10 0 --
+#> + edges from 440ddf9:
make_empty_graph(n = 5, directed = FALSE)
-#> IGRAPH d7b2f94 U--- 5 0 --
-#> + edges from d7b2f94:
+#> IGRAPH 870a491 U--- 5 0 --
+#> + edges from 870a491:
ring <- make_ring(4)
min_st_separators(ring)
#> [[1]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 2 4
#>
#> [[2]]
-#> + 2/4 vertices, from ea298d1:
+#> + 2/4 vertices, from 698794a:
#> [1] 1 3
#>
is_separator(ring, 1)
diff --git a/reference/is_tree.html b/reference/is_tree.html
index d845481735..0da9a43745 100644
--- a/reference/is_tree.html
+++ b/reference/is_tree.html
@@ -129,7 +129,7 @@ Examples#> [1] TRUE
#>
#> $root
-#> + 1/7 vertex, from 4a32e84:
+#> + 1/7 vertex, from c7b73eb:
#> [1] 1
#>
diff --git a/reference/is_weighted.html b/reference/is_weighted.html
index 277b6e3aa5..d339513d50 100644
--- a/reference/is_weighted.html
+++ b/reference/is_weighted.html
@@ -97,7 +97,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 5/10 vertices, from 7d9455d:
+#> + 5/10 vertices, from 67d2c45:
#> [1] 8 9 10 1 2
#>
#>
@@ -114,7 +114,7 @@ Examplesshortest_paths(g, 8, 2)
#> $vpath
#> $vpath[[1]]
-#> + 7/10 vertices, from 7d9455d:
+#> + 7/10 vertices, from 67d2c45:
#> [1] 8 7 6 5 4 3 2
#>
#>
diff --git a/reference/ivs.html b/reference/ivs.html
index 1f66aca972..9eeffe63eb 100644
--- a/reference/ivs.html
+++ b/reference/ivs.html
@@ -149,83 +149,83 @@ Examples#> [1] 4
ivs(g, min = ivs_size(g))
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
largest_ivs(g)
#> [[1]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 21 32 45 61
#>
#> [[2]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 37 55 56
#>
#> [[3]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 55 56 69
#>
#> [[4]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 7 56 69 74
#>
#> [[5]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 80
#>
#> [[6]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 8 15 73 84
#>
#> [[7]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 22 55 56 64
#>
#> [[8]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 23 69 75 90
#>
#> [[9]]
-#> + 4/100 vertices, from 23a4542:
+#> + 4/100 vertices, from fcb4684:
#> [1] 13 16 37 40
#>
# Empty graph
induced_subgraph(g, largest_ivs(g)[[1]])
-#> IGRAPH b014c2f U--- 4 0 -- Erdos-Renyi (gnp) graph
+#> IGRAPH 19967fb U--- 4 0 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n)
-#> + edges from b014c2f:
+#> + edges from 19967fb:
length(max_ivs(g))
#> [1] 326
diff --git a/reference/keeping_degseq.html b/reference/keeping_degseq.html
index 08bbe5e9a2..4fdb88e033 100644
--- a/reference/keeping_degseq.html
+++ b/reference/keeping_degseq.html
@@ -104,7 +104,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 2496492 U--- 10 10 -- Ring graph
+#> IGRAPH 6cd3af8 U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
#> + graph attributes:
#> | + name:
@@ -113,7 +113,7 @@ Examples#> | [1] FALSE
#> | + circular:
#> | [1] TRUE
-#> + edges from 2496492:
+#> + edges from 6cd3af8:
#> [1] 2-- 8 3-- 7 6-- 9 4-- 5 5--10 1-- 7 6--10 2-- 3 4-- 9 1-- 8
g <- make_bipartite_graph(rep(0:1, length.out = 10), c(1:10))
print(g, v = TRUE)
-#> IGRAPH 1dc5f2d U--B 10 5 --
+#> IGRAPH 8145264 U--B 10 5 --
#> + attr: type (v/l)
-#> + edges from 1dc5f2d:
+#> + edges from 8145264:
#> [1] 1-- 2 3-- 4 5-- 6 7-- 8 9--10
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 5526008 D--- 4 8 -- De-Bruijn graph 2-2
+#> IGRAPH 5464f62 D--- 4 8 -- De-Bruijn graph 2-2
#> + attr: name (g/c), m (g/n), n (g/n)
-#> + edges from 5526008:
+#> + edges from 5464f62:
#> [1] 1->1 1->2 2->3 2->4 3->1 3->2 4->3 4->4
make_line_graph(g)
-#> IGRAPH ed0c358 D--- 4 8 -- Line graph
+#> IGRAPH f070c0e D--- 4 8 -- Line graph
#> + attr: name (g/c)
-#> + edges from ed0c358:
+#> + edges from f070c0e:
#> [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 c5f49417b4..16e01c5d59 100644
--- a/reference/make_empty_graph.html
+++ b/reference/make_empty_graph.html
@@ -104,11 +104,11 @@ Related documentation in the C l
Examples
make_empty_graph(n = 10)
-#> IGRAPH 839c1eb D--- 10 0 --
-#> + edges from 839c1eb:
+#> IGRAPH 440ddf9 D--- 10 0 --
+#> + edges from 440ddf9:
make_empty_graph(n = 5, directed = FALSE)
-#> IGRAPH d7b2f94 U--- 5 0 --
-#> + edges from d7b2f94:
+#> IGRAPH 870a491 U--- 5 0 --
+#> + edges from 870a491:
Examples
make_empty_graph(n = 10)
-#> IGRAPH 839c1eb D--- 10 0 --
-#> + edges from 839c1eb:
+#> IGRAPH 440ddf9 D--- 10 0 --
+#> + edges from 440ddf9:
make_empty_graph(n = 5, directed = FALSE)
-#> IGRAPH d7b2f94 U--- 5 0 --
-#> + edges from d7b2f94:
+#> IGRAPH 870a491 U--- 5 0 --
+#> + edges from 870a491: