From 840f07be3492bf9b499108c59af898a112a5b20b Mon Sep 17 00:00:00 2001 From: Tamas Nepusz Date: Mon, 8 Jul 2024 11:33:43 +0200 Subject: [PATCH] chore: regenerated docs --- docs/c/html/develop/igraph-Basic.html | 2 +- docs/c/html/develop/igraph-Community.html | 194 +- .../html/develop/igraph-Data-structures.html | 787 ++++--- docs/c/html/develop/igraph-Foreign.html | 67 +- docs/c/html/develop/igraph-Generators.html | 29 +- docs/c/html/develop/igraph-Isomorphism.html | 159 -- docs/c/html/develop/igraph-Motifs.html | 4 +- docs/c/html/develop/igraph-Operators.html | 36 +- docs/c/html/develop/igraph-Structural.html | 870 ++----- docs/c/html/develop/igraph-Tutorial.html | 4 +- docs/c/html/develop/igraph-Visitors.html | 125 - docs/c/html/develop/index.html | 4 +- docs/c/html/develop/ix01.html | 2060 ++++++++-------- docs/c/html/master/igraph-Basic.html | 2 +- docs/c/html/master/igraph-Community.html | 210 +- .../c/html/master/igraph-Data-structures.html | 337 ++- docs/c/html/master/igraph-Foreign.html | 2 +- docs/c/html/master/igraph-Generators.html | 2 +- docs/c/html/master/igraph-Motifs.html | 4 +- docs/c/html/master/igraph-Operators.html | 2 +- docs/c/html/master/igraph-Structural.html | 101 +- docs/c/html/master/igraph-Tutorial.html | 4 +- docs/c/html/master/index.html | 4 +- docs/c/html/master/ix01.html | 2076 ++++++++--------- docs/sitemap.xml | 48 +- 25 files changed, 3137 insertions(+), 3996 deletions(-) diff --git a/docs/c/html/develop/igraph-Basic.html b/docs/c/html/develop/igraph-Basic.html index 5191f23c7..00ce0a83d 100644 --- a/docs/c/html/develop/igraph-Basic.html +++ b/docs/c/html/develop/igraph-Basic.html @@ -350,7 +350,7 @@

igraph Reference Manual

in the above description should be distinguished from the mathematical definition of the empty or null graph. Strictly speaking, the empty or null graph in graph theory is the graph with no vertices and no edges. However -by "empty graph" as used in igraph we mean a graph having zero or more +by "empty graph" as used in igraph we mean a graph having zero or more vertices, but no edges.

Arguments:  diff --git a/docs/c/html/develop/igraph-Community.html b/docs/c/html/develop/igraph-Community.html index a662d7986..d98a1b068 100644 --- a/docs/c/html/develop/igraph-Community.html +++ b/docs/c/html/develop/igraph-Community.html @@ -161,6 +161,23 @@

igraph Reference Manual

9. The InfoMAP algorithm
10. Voronoi communities
+

+Community detection is concerned with clustering the vertices of networks +into tightly connected subgraphs called "communities". The following +references provide a good introduction to the topic of community detection: +

+

+S. Fortunato: +"Community Detection in Graphs". +Physics Reports 486, no. 3–5 (2010): 75–174. +https://doi.org/16/j.physrep.2009.11.002. +

+

+S. Fortunato and D. Hric: +"Community Detection in Networks: A User Guide". +Physics Reports 659 (2016): 1–44. +https://doi.org/10.1016/j.physrep.2016.09.002. +

1. Common functions related to community structure

@@ -176,7 +193,7 @@

igraph Reference Manual

1.1. igraph_modularity — Calculates the modularity of a graph with respect to some clusters or vertex types.

-

+

 igraph_error_t igraph_modularity(const igraph_t *graph,
@@ -358,7 +375,7 @@ 
igraph Reference Manual

 

 

 1.2. igraph_modularity_matrix —  Calculates the modularity matrix.

-

+

 

 
 igraph_error_t igraph_modularity_matrix(const igraph_t *graph,
@@ -474,7 +491,7 @@ 
igraph Reference Manual

 

 

 1.3. igraph_community_optimal_modularity —  Calculate the community structure with the highest modularity value.

-

+

 

 
 igraph_error_t igraph_community_optimal_modularity(const igraph_t *graph,
@@ -588,7 +605,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.1.  File examples/simple/igraph_community_optimal_modularity.c

+
Example 24.1.  File examples/simple/igraph_community_optimal_modularity.c

 

 
#include <igraph.h>
 
@@ -689,7 +706,7 @@ 
igraph Reference Manual

 

 

 1.4. igraph_community_to_membership —  Creates a membership vector from a community structure dendrogram.

-

+

 

 
 igraph_error_t igraph_community_to_membership(const igraph_matrix_int_t *merges,
@@ -804,7 +821,7 @@ 
igraph Reference Manual

 

 

 1.5. igraph_reindex_membership —  Makes the IDs in a membership vector contiguous.

-

+

 

 
 igraph_error_t igraph_reindex_membership(igraph_vector_int_t *membership,
@@ -869,7 +886,7 @@ 
igraph Reference Manual

 

 

 1.6. igraph_compare_communities —  Compares community structures using various metrics.

-

+

 

 
 igraph_error_t igraph_compare_communities(const igraph_vector_int_t *comm1,
@@ -898,7 +915,7 @@ 
igraph Reference Manual

 
 

 

-H(C) = - \sum_i p_i log p_i
+H(C) = - sum_i p_i log p_i
 
 

 

@@ -908,7 +925,7 @@ 
igraph Reference Manual

 
 

 

-H(C_1, C_2) = - \sum_ii p_ij log p_ij
+H(C_1, C_2) = - sum_ii p_ij log p_ij
 
 

 

@@ -1085,7 +1102,7 @@ 
igraph Reference Manual

 

 

 1.7. igraph_split_join_distance —  Calculates the split-join distance of two community structures.

-

+

 

 
 igraph_error_t igraph_split_join_distance(const igraph_vector_int_t *comm1,
@@ -1221,7 +1238,7 @@ 
igraph Reference Manual

 

 

 2.1. igraph_community_spinglass —  Community detection based on statistical mechanics.

-

+

 

 
 igraph_error_t igraph_community_spinglass(const igraph_t *graph,
@@ -1288,9 +1305,8 @@ 
igraph Reference Manual

 

   Pointer to a real number, if not NULL then the
     modularity score of the solution will be stored here. This is the
-    gereralized modularity that simplifies to the one defined in
-    M. E. J. Newman and M. Girvan, Phys. Rev. E 69, 026113 (2004),
-    if the gamma parameter is one.
+    gereralized modularity, taking into account the resolution parameter
+    gamma. See igraph_modularity() for details.
 

 
 
@@ -1425,7 +1441,7 @@ 
igraph Reference Manual

 
 

 

-  igraph_community_spinglass_single() for calculating the community
+  igraph_community_spinglass_single() for calculating the community
 of a single vertex.
   

 
@@ -1440,7 +1456,7 @@ 
igraph Reference Manual

 

 

 2.2. igraph_community_spinglass_single —  Community of a single node based on statistical mechanics.

-

+

 

 
 igraph_error_t igraph_community_spinglass_single(const igraph_t *graph,
@@ -1628,13 +1644,14 @@ 
igraph Reference Manual

 published in MEJ Newman: Finding community structure using the
 eigenvectors of matrices, Phys Rev E 74:036104 (2006).

 

-The heart of the method is the definition of the modularity matrix,
-B, which is B=A-P, A being the adjacency matrix of the (undirected)
-network, and P contains the probability that certain edges are
-present according to the “configuration model” In
-other words, a Pij element of P is the probability that there is an
-edge between vertices i and j in a random network in which the
-degrees of all vertices are the same as in the input graph.

+The heart of the method is the definition of the modularity matrix
+B = A - P, A being the adjacency matrix of the (undirected)
+network, and P contains the probability that certain edges are
+present according to the “configuration model”. In
+other words, a P_ij element of P is the probability that there is an
+edge between vertices i and j in a random network in which the
+degrees of all vertices are the same as in the input graph. See
+igraph_modularity_matrix() for more details.

 

 The leading eigenvector method works by calculating the eigenvector
 of the modularity matrix for the largest positive eigenvalue and
@@ -1656,7 +1673,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.2.  File examples/simple/igraph_community_leading_eigenvector.c

+
Example 24.2.  File examples/simple/igraph_community_leading_eigenvector.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -1741,7 +1758,7 @@ 
igraph Reference Manual

 

 

 3.1. igraph_community_leading_eigenvector —  Leading eigenvector community finding (proper version).

-

+

 

 
 igraph_error_t igraph_community_leading_eigenvector(
@@ -1806,11 +1823,11 @@ 
igraph Reference Manual

    community detection functions in igraph, the integers in this matrix
    represent community indices, not vertex indices. If at the end of
    the algorithm (after steps steps was done) there are “p”
-   communities, then these are numbered from zero to “p-1”.
+   communities, then these are numbered from zero to p-1.
    The first line of the matrix contains the first “merge”
    (which is in reality the last split) of two communities into
-   community “p”, the merge in the second line forms
-   community “p+1”, etc. The matrix should be
+   community p, the merge in the second line forms
+   community p+1, etc. The matrix should be
    initialized before calling and will be resized as needed.
    This argument is ignored if it is NULL.
 

@@ -2004,7 +2021,7 @@ 
igraph Reference Manual

 

 

 3.2. igraph_community_leading_eigenvector_callback_t — Callback for the leading eigenvector community finding method.

-
+
 typedef igraph_error_t igraph_community_leading_eigenvector_callback_t(
     const igraph_vector_int_t *membership,
     igraph_integer_t comm,
@@ -2102,7 +2119,7 @@ 
igraph Reference Manual

 

 

 3.3. igraph_le_community_to_membership —  Vertex membership from the leading eigenvector community structure.

-

+

 

 
 igraph_error_t igraph_le_community_to_membership(const igraph_matrix_int_t *merges,
@@ -2190,7 +2207,7 @@ 
igraph Reference Manual

 

 

 4.1. igraph_community_walktrap —  Community finding using a random walk based similarity measure.

-

+

 

 
 igraph_error_t igraph_community_walktrap(const igraph_t *graph,
@@ -2267,8 +2284,9 @@ 
igraph Reference Manual

     cluster is created from two other clusters and its id will be
     one larger than the largest cluster id so far. This means that
     before the first merge we have n clusters (the number of
-    vertices in the graph) numbered from zero to n-1. The first
-    merge creates cluster n, the second cluster n+1, etc.
+    vertices in the graph) numbered from zero to n - 1.
+    The first merge creates cluster n, the second cluster
+    n + 1, etc.
 

 
 
@@ -2328,7 +2346,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.3.  File examples/simple/walktrap.c

+
Example 24.3.  File examples/simple/walktrap.c

 

 
#include <igraph.h>
 
@@ -2386,7 +2404,7 @@ 
igraph Reference Manual

 

 

 5.1. igraph_community_edge_betweenness —  Community finding based on edge betweenness.

-

+

 

 
 igraph_error_t igraph_community_edge_betweenness(const igraph_t *graph,
@@ -2600,7 +2618,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.4.  File examples/simple/igraph_community_edge_betweenness.c

+
Example 24.4.  File examples/simple/igraph_community_edge_betweenness.c

 

 
#include <igraph.h>
 
@@ -2655,7 +2673,7 @@ 
igraph Reference Manual

 

 

 5.2. igraph_community_eb_get_merges —  Calculating the merges, i.e. the dendrogram for an edge betweenness community structure.

-

+

 

 
 igraph_error_t igraph_community_eb_get_merges(const igraph_t *graph,
@@ -2735,7 +2753,7 @@ 
igraph Reference Manual

    the number of vertices in the graph. So if the first line
    contains a and b that means that components a and b
    are merged into component n, the second line creates
-   component n+1, etc. The matrix will be resized as needed.
+   component n + 1, etc. The matrix will be resized as needed.
 

 
 
@@ -2809,13 +2827,13 @@ 
igraph Reference Manual

 6. Community structure based on the optimization of modularity

 

 
6.1. igraph_community_fastgreedy —  Finding community structure by greedy optimization of modularity.

-
6.2. igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity.

+
6.2. igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity (Louvain).

 
6.3. igraph_community_leiden —  Finding community structure using the Leiden algorithm.

 

 

 

 6.1. igraph_community_fastgreedy —  Finding community structure by greedy optimization of modularity.

-

+

 

 
 igraph_error_t igraph_community_fastgreedy(const igraph_t *graph,
@@ -2942,7 +2960,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.5.  File examples/simple/igraph_community_fastgreedy.c

+
Example 24.5.  File examples/simple/igraph_community_fastgreedy.c

 

 
#include <igraph.h>
 
@@ -2977,8 +2995,8 @@ 
igraph Reference Manual

 

 

 

-6.2. igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity.

-

+6.2. igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity (Louvain).

+

 

 
 igraph_error_t igraph_community_multilevel(const igraph_t *graph,
@@ -2995,14 +3013,8 @@ 
igraph Reference Manual

 
 
 
-This function implements the multi-level modularity optimization
-algorithm for finding community structure, see
-Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008). Fast
-unfolding of communities in large networks. Journal of Statistical Mechanics:
-Theory and Experiment, 10008(10), 6.
-https://doi.org/10.1088/1742-5468/2008/10/P10008 for the details (preprint:
-http://arxiv.org/abs/0803.0476). The algorithm is sometimes known as the
-"Louvain" algorithm.
+This function implements a multi-level modularity optimization algorithm
+for finding community structure, sometimes known as the Louvain algorithm.
 
 

 

@@ -3017,17 +3029,28 @@ 
igraph Reference Manual

 
 

 

-The resolution parameter gamma allows finding communities at different
+The resolution parameter γ allows finding communities at different
 resolutions. Higher values of the resolution parameter typically result in
 more, smaller communities. Lower values typically result in fewer, larger
 communities. The original definition of modularity is retrieved when setting
-gamma=1. Note that the returned modularity value is calculated using
+γ=1. Note that the returned modularity value is calculated using
 the indicated resolution parameter. See igraph_modularity() for more details.
 
 

 

 The original version of this function was contributed by Tom Gregorovic.
 
+

+

+Reference:
+
+

+

+Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E.:
+Fast unfolding of communities in large networks.
+Journal of Statistical Mechanics: Theory and Experiment, 10008(10), 6 (2008).
+https://doi.org/10.1088/1742-5468/2008/10/P10008
+
 

 
Arguments: 
 

@@ -3107,7 +3130,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.6.  File examples/simple/igraph_community_multilevel.c

+
Example 24.6.  File examples/simple/igraph_community_multilevel.c

 

 
#include <igraph.h>
 
@@ -3162,11 +3185,11 @@ 
igraph Reference Manual

                  10, 11, 10, 12, 10, 13, 10, 14,
                  11, 13,
                  -1);
-    igraph_community_multilevel(&g, 0, 1, &membership, &memberships, &modularity);
+    igraph_community_multilevel(&g, 0, 1, &membership, &memberships, &modularity);
     show_results(&g, &membership, &memberships, &modularity, stdout);
 
     /* Higher resolution */
-    igraph_community_multilevel(&g, 0, 1.5, &membership, &memberships, &modularity);
+    igraph_community_multilevel(&g, 0, 1.5, &membership, &memberships, &modularity);
     show_results(&g, &membership, &memberships, &modularity, stdout);
 
     igraph_destroy(&g);
@@ -3186,7 +3209,7 @@ 
igraph Reference Manual

         igraph_vector_int_push_back(&edges, (i * 5 + 6) % 150);
     }
     igraph_create(&g, &edges, 150, 0);
-    igraph_community_multilevel(&g, 0, 1, &membership, &memberships, &modularity);
+    igraph_community_multilevel(&g, 0, 1, &membership, &memberships, &modularity);
     show_results(&g, &membership, &memberships, &modularity, stdout);
     igraph_destroy(&g);
 
@@ -3209,7 +3232,7 @@ 
igraph Reference Manual

 

 

 6.3. igraph_community_leiden —  Finding community structure using the Leiden algorithm.

-

+

 

 
 igraph_error_t igraph_community_leiden(const igraph_t *graph,
@@ -3226,16 +3249,14 @@ 
igraph Reference Manual

 
 
 This function implements the Leiden algorithm for finding community
-structure, see Traag, V. A., Waltman, L., & van Eck, N. J. (2019). From
-Louvain to Leiden: guaranteeing well-connected communities. Scientific
-reports, 9(1), 5233. http://dx.doi.org/10.1038/s41598-019-41695-z
+structure.
 
 

 

 It is similar to the multilevel algorithm, often called the Louvain
 algorithm, but it is faster and yields higher quality solutions. It can
 optimize both modularity and the Constant Potts Model, which does not suffer
-from the resolution-limit (see preprint http://arxiv.org/abs/1104.3083).
+from the resolution-limit (see Tragg, Van Dooren & Nesterov).
 
 

 

@@ -3270,18 +3291,37 @@ 
igraph Reference Manual

 
 

 

-1 / 2m sum_ij (A_ij - gamma n_i n_j)d(s_i, s_j)
+1 / 2m sum_ij (A_ij - γ n_i n_j) δ(s_i, s_j)
+
+

+

+where m is the total edge weight, A_ij is the weight of edge
+(i, j), γ is the so-called resolution parameter, n_i
+is the node weight of node i, s_i is the cluster of node
+i and δ(x, y) = 1 if and only if x = y and 0
+otherwise. By setting n_i = k_i, the degree of node i, and
+dividing γ by 2m, we effectively obtain an expression for
+modularity. Hence, the standard modularity will be optimized when you supply
+the degrees as node_weights and by supplying as a resolution parameter
+1/(2m), with m the number of edges.
 
 

 

-where m is the total edge weight, A_ij is the weight of edge (i, j), gamma is
-the so-called resolution parameter, n_i is the node weight of node i, s_i is
-the cluster of node i and d(x, y) = 1 if and only if x = y and 0 otherwise.
-By setting n_i = k_i, the degree of node i, and dividing gamma by 2m, you
-effectively obtain an expression for modularity. Hence, the standard
-modularity will be optimized when you supply the degrees as node_weights
-and by supplying as a resolution parameter 1.0/(2*m), with m the number of
-edges.
+References:
+
+

+

+V. A. Traag, L. Waltman, N. J. van Eck:
+From Louvain to Leiden: guaranteeing well-connected communities.
+Scientific Reports, 9(1), 5233 (2019).
+http://dx.doi.org/10.1038/s41598-019-41695-z
+
+

+

+V. A. Traag, P. Van Dooren, and Y. Nesterov:
+Narrow scope for resolution-limit-free community detection.
+Phys. Rev. E 84, 016114 (2011).
+https://doi.org/10.1103/PhysRevE.84.016114
 
 

 
Arguments: 
@@ -3392,7 +3432,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.7.  File examples/simple/igraph_community_leiden.c

+
Example 24.7.  File examples/simple/igraph_community_leiden.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -3465,7 +3505,7 @@ 
igraph Reference Manual

 

 

 7.1. igraph_community_fluid_communities —  Community detection based on fluids interacting on the graph.

-

+

 

 
 igraph_error_t igraph_community_fluid_communities(const igraph_t *graph,
@@ -3562,7 +3602,7 @@ 
igraph Reference Manual

 

 

 8.1. igraph_community_label_propagation —  Community detection based on label propagation.

-

+

 

 
 igraph_error_t igraph_community_label_propagation(const igraph_t *graph,
@@ -3768,7 +3808,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.8.  File examples/simple/igraph_community_label_propagation.c

+
Example 24.8.  File examples/simple/igraph_community_label_propagation.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -3825,7 +3865,7 @@ 
igraph Reference Manual

 

 

 9.1. igraph_community_infomap —  Find community structure that minimizes the expected description length of a random walker trajectory.

-

+

 

 
 igraph_error_t igraph_community_infomap(const igraph_t * graph,
@@ -3979,7 +4019,7 @@ 
igraph Reference Manual

 

 

 10.1. igraph_community_voronoi —  Finds communities using Voronoi partitioning.

-

+

 

 
 igraph_error_t igraph_community_voronoi(
diff --git a/docs/c/html/develop/igraph-Data-structures.html b/docs/c/html/develop/igraph-Data-structures.html
index b3c13df3c..c51d1e0ea 100644
--- a/docs/c/html/develop/igraph-Data-structures.html
+++ b/docs/c/html/develop/igraph-Data-structures.html
@@ -178,8 +178,9 @@ 
igraph Reference Manual

 

   Vector is currently defined for igraph_real_t,
   igraph_integer_t (int), char (char),
-  igraph_bool_t (bool) and igraph_complex_t
-  (complex). The default is igraph_real_t.
+  igraph_bool_t (bool), igraph_complex_t
+  (complex) and  and void * (ptr). The default is
+  igraph_real_t.
 

 
matrix

 

@@ -198,8 +199,8 @@ 
igraph Reference Manual

 
stack

 

   Stack is currently defined for igraph_real_t,
-  igraph_integer_t (int), char (char),
-  igraph_bool_t (bool) and void* (ptr).
+  igraph_integer_t (int), char (char) and
+  igraph_bool_t (bool).
   The default is igraph_real_t.
 

 
double-ended queue

@@ -384,7 +385,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_init(igraph_vector_t* v, igraph_integer_t size);
+igraph_error_t igraph_vector_init(igraph_vector_t *v, igraph_integer_t size);
 

 

 

@@ -599,7 +600,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_init_range(igraph_vector_t *v, igraph_real_t from, igraph_real_t to);
+igraph_error_t igraph_vector_init_range(igraph_vector_t *v, igraph_real_t start, igraph_real_t end);
 

 

 

@@ -671,7 +672,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_destroy(igraph_vector_t* v);
+void igraph_vector_destroy(igraph_vector_t *v);
 

 

 

@@ -723,7 +724,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_null(igraph_vector_t* v);
+void igraph_vector_null(igraph_vector_t *v);
 

 

 

@@ -767,7 +768,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_fill(igraph_vector_t* v, igraph_real_t e);
+void igraph_vector_fill(igraph_vector_t *v, igraph_real_t e);
 

 

 

@@ -812,7 +813,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_range(igraph_vector_t *v, igraph_real_t from, igraph_real_t to);
+igraph_error_t igraph_vector_range(igraph_vector_t *v, igraph_real_t start, igraph_real_t end);
 

 

 

@@ -916,7 +917,7 @@ 
igraph Reference Manual

 to access the first element of the vector, you can also use this in
 assignments, like:
 

-
 VECTOR(v)[10]=5; 

+
 VECTOR(v)[10] = 5; 

 

 
 Note that there are no range checks right now.
@@ -948,7 +949,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t igraph_vector_get(const igraph_vector_t* v, igraph_integer_t pos);
+igraph_real_t igraph_vector_get(const igraph_vector_t *v, igraph_integer_t pos);
 

 

 

@@ -1026,7 +1027,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t* igraph_vector_get_ptr(const igraph_vector_t* v, igraph_integer_t pos);
+igraph_real_t* igraph_vector_get_ptr(const igraph_vector_t *v, igraph_integer_t pos);
 

 

 

@@ -1104,7 +1105,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_set(igraph_vector_t* v, igraph_integer_t pos, igraph_real_t value);
+void igraph_vector_set(igraph_vector_t *v, igraph_integer_t pos, igraph_real_t value);
 

 

 

@@ -1423,7 +1424,7 @@ 
igraph Reference Manual

 

 
 igraph_error_t igraph_vector_append(igraph_vector_t *to,
-                                    const igraph_vector_t *from);
+                                               const igraph_vector_t *from);
 

 

 

@@ -1789,10 +1790,10 @@ 
igraph Reference Manual

 
     igraph_vector_shuffle(&v);
     /* must have same length */
-    if (igraph_vector_size(&v) != n) {
+    if (igraph_vector_size(&v) != n) {
         return 3;
     }
-    if (igraph_vector_size(&u) != igraph_vector_size(&v)) {
+    if (igraph_vector_size(&u) != igraph_vector_size(&v)) {
         return 4;
     }
     /* must have same elements */
@@ -1826,7 +1827,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_permute(igraph_vector_t* v, const igraph_vector_int_t* index);
+igraph_error_t igraph_vector_permute(igraph_vector_t *v, const igraph_vector_int_t *index);
 

 

 

@@ -2356,7 +2357,7 @@ 
igraph Reference Manual

 

 
 igraph_bool_t igraph_vector_all_e(const igraph_vector_t *lhs,
-        const igraph_vector_t *rhs);
+                                  const igraph_vector_t *rhs);
 

 

 

@@ -2488,7 +2489,7 @@ 
igraph Reference Manual

 

 
 igraph_bool_t igraph_vector_all_l(const igraph_vector_t *lhs,
-        const igraph_vector_t *rhs);
+                                  const igraph_vector_t *rhs);
 

 

 

@@ -2551,7 +2552,7 @@ 
igraph Reference Manual

 

 
 igraph_bool_t igraph_vector_all_g(const igraph_vector_t *lhs,
-        const igraph_vector_t *rhs);
+                                  const igraph_vector_t *rhs);
 

 

 

@@ -2613,9 +2614,8 @@ 
igraph Reference Manual

 

 

 
-igraph_bool_t
-igraph_vector_all_le(const igraph_vector_t *lhs,
-                                const igraph_vector_t *rhs);
+igraph_bool_t igraph_vector_all_le(const igraph_vector_t *lhs,
+                                   const igraph_vector_t *rhs);
 

 

 

@@ -2676,9 +2676,8 @@ 
igraph Reference Manual

 

 

 
-igraph_bool_t
-igraph_vector_all_ge(const igraph_vector_t *lhs,
-                                const igraph_vector_t *rhs);
+igraph_bool_t igraph_vector_all_ge(const igraph_vector_t *lhs,
+                                   const igraph_vector_t *rhs);
 

 

 

@@ -2971,7 +2970,7 @@ 
igraph Reference Manual

 
 

 

-This function is typically used together with igraph_vector_ptr_sort().
+This function is typically used together with igraph_vector_ptr_sort().
 
 

 
Arguments: 
@@ -3198,7 +3197,7 @@ 
igraph Reference Manual

 
 

 

-This function is typically used together with igraph_vector_ptr_sort().
+This function is typically used together with igraph_vector_ptr_sort().
 
 

 
Arguments: 
@@ -3281,7 +3280,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t igraph_vector_min(const igraph_vector_t* v);
+igraph_real_t igraph_vector_min(const igraph_vector_t *v);
 

 

 

@@ -3334,7 +3333,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t igraph_vector_max(const igraph_vector_t* v);
+igraph_real_t igraph_vector_max(const igraph_vector_t *v);
 

 

 

@@ -3442,7 +3441,7 @@ 
igraph Reference Manual

 

 

 
-igraph_integer_t igraph_vector_which_max(const igraph_vector_t* v);
+igraph_integer_t igraph_vector_which_max(const igraph_vector_t *v);
 

 

 

@@ -3499,7 +3498,7 @@ 
igraph Reference Manual

 

 
 void igraph_vector_minmax(const igraph_vector_t *v,
-                                    igraph_real_t *min, igraph_real_t *max);
+                          igraph_real_t *min, igraph_real_t *max);
 

 

 

@@ -3611,7 +3610,7 @@ 
igraph Reference Manual

 2.11. Vector properties

 

 
2.11.1. igraph_vector_empty —  Decides whether the size of the vector is zero.

-
2.11.2. igraph_vector_size —  Returns the size (=length) of the vector.

+
2.11.2. igraph_vector_size —  The size of the vector.

 
2.11.3. igraph_vector_capacity —  Returns the allocated capacity of the vector.

 
2.11.4. igraph_vector_sum —  Calculates the sum of the elements in the vector.

 
2.11.5. igraph_vector_prod —  Calculates the product of the elements in the vector.

@@ -3627,7 +3626,7 @@ 
igraph Reference Manual

 

 

 
-igraph_bool_t igraph_vector_empty(const igraph_vector_t* v);
+igraph_bool_t igraph_vector_empty(const igraph_vector_t *v);
 

 

 

@@ -3674,11 +3673,11 @@ 
igraph Reference Manual

 

 

 

-2.11.2. igraph_vector_size —  Returns the size (=length) of the vector.

+2.11.2. igraph_vector_size —  The size of the vector.

 

 

 
-igraph_integer_t igraph_vector_size(const igraph_vector_t* v);
+igraph_integer_t igraph_vector_size(const igraph_vector_t *v);
 

 

 

@@ -3687,6 +3686,8 @@ 
igraph Reference Manual

 
 
 
+Returns the number of elements stored in the vector.
+
 

 
Arguments: 
 

@@ -3729,7 +3730,7 @@ 
igraph Reference Manual

 

 

 
-igraph_integer_t igraph_vector_capacity(const igraph_vector_t*v);
+igraph_integer_t igraph_vector_capacity(const igraph_vector_t *v);
 

 

 

@@ -3739,7 +3740,7 @@ 
igraph Reference Manual

 
 
 Note that this might be different from the size of the vector (as
-queried by igraph_vector_size()), and specifies how many elements
+queried by igraph_vector_size()), and specifies how many elements
 the vector can hold, without reallocation.
 
 

@@ -3785,7 +3786,7 @@ 
igraph Reference Manual

 
 

 

-  igraph_vector_size().
+  igraph_vector_size().
   

 
 

@@ -3810,9 +3811,8 @@ 
igraph Reference Manual

 
 
 
-

-

-For the empty vector 0.0 is returned.
+For the empty vector 0 is returned.
+
 

 
Arguments: 
 

@@ -4652,7 +4652,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_reserve(igraph_vector_t* v, igraph_integer_t capacity);
+igraph_error_t igraph_vector_reserve(igraph_vector_t *v, igraph_integer_t capacity);
 

 

 

@@ -4819,7 +4819,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_resize_min(igraph_vector_t*v);
+void igraph_vector_resize_min(igraph_vector_t *v);
 

 

 

@@ -4829,7 +4829,7 @@ 
igraph Reference Manual

 
 
 This function attempts to deallocate the unused reserved storage
-of a vector. If it succeeds, igraph_vector_size() and
+of a vector. If it succeeds, igraph_vector_size() and
 igraph_vector_capacity() will be the same. The data in the
 vector is always preserved, even if deallocation is not successful.
 
@@ -4876,7 +4876,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_push_back(igraph_vector_t* v, igraph_real_t e);
+igraph_error_t igraph_vector_push_back(igraph_vector_t *v, igraph_real_t e);
 

 

 

@@ -4885,10 +4885,9 @@ 
igraph Reference Manual

 
 
 
-

-

 This function resizes the vector to be one element longer and
 sets the very last element in the vector to e.
+
 

 
Arguments: 
 

@@ -4949,7 +4948,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t igraph_vector_pop_back(igraph_vector_t* v);
+igraph_real_t igraph_vector_pop_back(igraph_vector_t *v);
 

 

 

@@ -6067,19 +6066,22 @@ 
Warning

 
2.17.4. igraph_vector_ptr_free_all —  Frees all the elements of a pointer vector.

 
2.17.5. igraph_vector_ptr_destroy_all —  Frees all the elements and destroys the pointer vector.

 
2.17.6. igraph_vector_ptr_size —  Gives the number of elements in the pointer vector.

-
2.17.7. igraph_vector_ptr_clear —  Removes all elements from a pointer vector.

-
2.17.8. igraph_vector_ptr_push_back —  Appends an element to the back of a pointer vector.

-
2.17.9. igraph_vector_ptr_pop_back —  Removes and returns the last element of a pointer vector.

-
2.17.10. igraph_vector_ptr_insert —  Inserts a single element into a pointer vector.

-
2.17.11. igraph_vector_ptr_get —  Access an element of a pointer vector.

-
2.17.12. igraph_vector_ptr_set —  Assign to an element of a pointer vector.

-
2.17.13. igraph_vector_ptr_resize —  Resizes a pointer vector.

-
2.17.14. igraph_vector_ptr_sort —  Sorts the pointer vector based on an external comparison function.

-
2.17.15. igraph_vector_ptr_sort_ind —  Returns a permutation of indices that sorts a vector of pointers.

-
2.17.16. igraph_vector_ptr_permute —  Permutes the elements of a pointer vector in place according to an index vector.

-
2.17.17. igraph_vector_ptr_get_item_destructor —  Gets the current item destructor for this pointer vector.

-
2.17.18. igraph_vector_ptr_set_item_destructor —  Sets the item destructor for this pointer vector.

-
2.17.19. IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR —  Sets the item destructor for this pointer vector (macro version).

+
2.17.7. igraph_vector_ptr_capacity —  Returns the allocated capacity of the pointer vector.

+
2.17.8. igraph_vector_ptr_clear —  Removes all elements from a pointer vector.

+
2.17.9. igraph_vector_ptr_reserve —  Reserves memory for a pointer vector for later use.

+
2.17.10. igraph_vector_ptr_resize —  Resizes a pointer vector.

+
2.17.11. igraph_vector_ptr_resize_min —  Deallocate the unused memory of a pointer vector.

+
2.17.12. igraph_vector_ptr_push_back —  Appends an element to the back of a pointer vector.

+
2.17.13. igraph_vector_ptr_pop_back —  Removes and returns the last element of a pointer vector.

+
2.17.14. igraph_vector_ptr_insert —  Inserts a single element into a pointer vector.

+
2.17.15. igraph_vector_ptr_get —  Access an element of a pointer vector.

+
2.17.16. igraph_vector_ptr_set —  Assign to an element of a pointer vector.

+
2.17.17. igraph_vector_ptr_sort —  Sorts the pointer vector based on an external comparison function.

+
2.17.18. igraph_vector_ptr_sort_ind —  Returns a permutation of indices that sorts a vector of pointers.

+
2.17.19. igraph_vector_ptr_permute —  Permutes the elements of a pointer vector in place according to an index vector.

+
2.17.20. igraph_vector_ptr_get_item_destructor —  Gets the current item destructor for this pointer vector.

+
2.17.21. igraph_vector_ptr_set_item_destructor —  Sets the item destructor for this pointer vector.

+
2.17.22. IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR —  Sets the item destructor for this pointer vector (macro version).

 

 
The igraph_vector_ptr_t data type is very similar to
 the igraph_vector_t type, but it stores generic pointers instead of
@@ -6423,10 +6425,61 @@ 
Warning

 

 

 

-2.17.7. igraph_vector_ptr_clear —  Removes all elements from a pointer vector.

+2.17.7. igraph_vector_ptr_capacity —  Returns the allocated capacity of the pointer vector.

 

 

 
+igraph_integer_t igraph_vector_ptr_capacity(const igraph_vector_ptr_t* v);
+

+

+

+

+
+
+
+
+

+
Arguments: 
+

+

++++
+
+
+
+
+




v:

+  The pointer vector object.
+

+

+

+
Returns: 

+

++++
+
+
+
+
+





+  The allocated capacity.
+  

+

+
+Time complexity: O(1).
+ 
+

+

+

+

+2.17.8. igraph_vector_ptr_clear —  Removes all elements from a pointer vector.

+

+

+
 void igraph_vector_ptr_clear(igraph_vector_ptr_t* v);
 

 

@@ -6474,8 +6527,165 @@ 
Warning

 

 

 

-2.17.8. igraph_vector_ptr_push_back —  Appends an element to the back of a pointer vector.

-

+2.17.9. igraph_vector_ptr_reserve —  Reserves memory for a pointer vector for later use.

+

+

+
+igraph_error_t igraph_vector_ptr_reserve(igraph_vector_ptr_t* v, igraph_integer_t capacity);
+

+

+

+

+
+
+
+
+

+
Returns: 

+

++++
+
+
+
+
+





+  Error code.
+  

+

+ 
+

+

+

+

+2.17.10. igraph_vector_ptr_resize —  Resizes a pointer vector.

+

+

+
+igraph_error_t igraph_vector_ptr_resize(igraph_vector_ptr_t* v, igraph_integer_t newsize);
+

+

+

+

+
+
+
+
+

+

+Note that if a vector is made smaller the pointed object are not
+deallocated by this function and the item destructor is not called
+on the extra elements.
+
+

+
Arguments: 
+

+

++++
+
+
+
+
+
+
+
+
+
+
+




v:

+  A pointer vector.
+
newsize:

+  The new size of the pointer vector.
+

+

+

+
Returns: 

+

++++
+
+
+
+
+





+  Error code.
+  

+

+
+Time complexity: O(1) if the vector if made smaller. Operating
+system dependent otherwise, the amount of “time”
+needed to allocate the memory for the vector elements.
+ 
+

+

+

+

+2.17.11. igraph_vector_ptr_resize_min —  Deallocate the unused memory of a pointer vector.

+

+

+
+void igraph_vector_ptr_resize_min(igraph_vector_ptr_t* v);
+

+

+

+

+
+
+
+
+This function attempts to deallocate the unused reserved storage
+of a pointer vector. If it succeeds, igraph_vector_ptr_size() and
+igraph_vector_ptr_capacity() will be the same. The data in the
+pointer vector is always preserved, even if deallocation is not successful.
+
+

+
Arguments: 
+

+

++++
+
+
+
+
+




v:

+  Pointer to an initialized pointer vector.

+

+
+
+

+
See also: 

+

++++
+
+
+
+
+





+  igraph_vector_ptr_resize(), igraph_vector_ptr_reserve().
+  

+

+
+Time complexity: operating system dependent, O(n) at worst.
+ 
+

+

+

+

+2.17.12. igraph_vector_ptr_push_back —  Appends an element to the back of a pointer vector.

+

 

 
 igraph_error_t igraph_vector_ptr_push_back(igraph_vector_ptr_t* v, void* e);
@@ -6551,8 +6761,8 @@ 
Warning

 

 

 

-2.17.9. igraph_vector_ptr_pop_back —  Removes and returns the last element of a pointer vector.

-

+2.17.13. igraph_vector_ptr_pop_back —  Removes and returns the last element of a pointer vector.

+

 

 
 void *igraph_vector_ptr_pop_back(igraph_vector_ptr_t *v);
@@ -6606,8 +6816,8 @@ 
Warning

 

 

 

-2.17.10. igraph_vector_ptr_insert —  Inserts a single element into a pointer vector.

-

+2.17.14. igraph_vector_ptr_insert —  Inserts a single element into a pointer vector.

+

 

 
 igraph_error_t igraph_vector_ptr_insert(igraph_vector_ptr_t* v, igraph_integer_t pos, void* e);
@@ -6659,8 +6869,8 @@ 
Warning

 

 

 

-2.17.11. igraph_vector_ptr_get —  Access an element of a pointer vector.

-

+2.17.15. igraph_vector_ptr_get —  Access an element of a pointer vector.

+

 

 
 void *igraph_vector_ptr_get(const igraph_vector_ptr_t* v, igraph_integer_t pos);
@@ -6718,8 +6928,8 @@ 
Warning

 

 

 

-2.17.12. igraph_vector_ptr_set —  Assign to an element of a pointer vector.

-

+2.17.16. igraph_vector_ptr_set —  Assign to an element of a pointer vector.

+

 

 
 void igraph_vector_ptr_set(igraph_vector_ptr_t* v, igraph_integer_t pos, void* value);
@@ -6768,75 +6978,8 @@ 
Warning

 

 

 

-2.17.13. igraph_vector_ptr_resize —  Resizes a pointer vector.

-

-

-
-igraph_error_t igraph_vector_ptr_resize(igraph_vector_ptr_t* v, igraph_integer_t newsize);
-

-

-

-

-
-
-
-
-

-

-Note that if a vector is made smaller the pointed object are not
-deallocated by this function and the item destructor is not called
-on the extra elements.
-
-

-
Arguments: 
-

-

----
-
-
-
-
-
-
-
-
-
-
-




v:

-  A pointer vector.
-
newsize:

-  The new size of the pointer vector.
-

-

-

-
Returns: 

-

----
-
-
-
-
-





-  Error code.
-  

-

-
-Time complexity: O(1) if the vector if made smaller. Operating
-system dependent otherwise, the amount of “time”
-needed to allocate the memory for the vector elements.
- 
-

-

-

-

-2.17.14. igraph_vector_ptr_sort —  Sorts the pointer vector based on an external comparison function.

-

+2.17.17. igraph_vector_ptr_sort —  Sorts the pointer vector based on an external comparison function.

+

 

 
 void igraph_vector_ptr_sort(igraph_vector_ptr_t *v, int (*compar)(const void*, const void*));
@@ -6890,8 +7033,8 @@ 
Warning

 

 

 

-2.17.15. igraph_vector_ptr_sort_ind —  Returns a permutation of indices that sorts a vector of pointers.

-

+2.17.18. igraph_vector_ptr_sort_ind —  Returns a permutation of indices that sorts a vector of pointers.

+

 

 
 igraph_error_t igraph_vector_ptr_sort_ind(igraph_vector_ptr_t *v,
@@ -6972,8 +7115,8 @@ 
Warning

 

 

 

-2.17.16. igraph_vector_ptr_permute —  Permutes the elements of a pointer vector in place according to an index vector.

-

+2.17.19. igraph_vector_ptr_permute —  Permutes the elements of a pointer vector in place according to an index vector.

+

 

 
 igraph_error_t igraph_vector_ptr_permute(igraph_vector_ptr_t* v, const igraph_vector_int_t* index);
@@ -7002,8 +7145,8 @@ 
Warning

 

 

 The index vector that this function takes is compatible with the index vector
-returned from igraph_vector_ptr_sort_ind(); passing in the index vector
-from igraph_vector_ptr_sort_ind() will sort the original vector.
+returned from igraph_vector_ptr_sort_ind(); passing in the index vector
+from igraph_vector_ptr_sort_ind() will sort the original vector.
 
 

 

@@ -7059,8 +7202,8 @@ 
Warning

 

 

 

-2.17.17. igraph_vector_ptr_get_item_destructor —  Gets the current item destructor for this pointer vector.

-

+2.17.20. igraph_vector_ptr_get_item_destructor —  Gets the current item destructor for this pointer vector.

+

 

 
 igraph_finally_func_t* igraph_vector_ptr_get_item_destructor(const igraph_vector_ptr_t *v);
@@ -7099,8 +7242,8 @@ 
Warning

 

 

 

-2.17.18. igraph_vector_ptr_set_item_destructor —  Sets the item destructor for this pointer vector.

-

+2.17.21. igraph_vector_ptr_set_item_destructor —  Sets the item destructor for this pointer vector.

+

 

 
 igraph_finally_func_t* igraph_vector_ptr_set_item_destructor(
@@ -7140,8 +7283,8 @@ 
Warning

 

 

 

-2.17.19. IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR —  Sets the item destructor for this pointer vector (macro version).

-

+2.17.22. IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR —  Sets the item destructor for this pointer vector (macro version).

+

 

 
 #define IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(v, func)
@@ -7151,7 +7294,7 @@ 
Warning

 

 
 
-This macro is expanded to igraph_vector_ptr_set_item_destructor(), the
+This macro is expanded to igraph_vector_ptr_set_item_destructor(), the
 only difference is that the second argument is automatically cast to an
 igraph_finally_func_t*. The cast is necessary in most cases as the
 destructor functions we use (such as igraph_vector_destroy()) take a
@@ -11936,7 +12079,6 @@ 
Warning

 
4.8. Eigenvalues and eigenvectors

 
4.9. Conversion to other data types

 
4.10. Writing to a file, or to the screen

-
4.11. Deprecated functions

 

 

 

@@ -17762,95 +17904,6 @@ 
Warning

 column-compressed matrices. nz is the number of non-zero elements,
 n is the number columns in the matrix.
  
-

-

-

-

-

-4.11. Deprecated functions

-

-
4.11.1. igraph_sparsemat_copy —  Copies a sparse matrix (deprecated alias).

-
4.11.2. igraph_sparsemat_diag —  Creates a sparse diagonal matrix (deprecated alias).

-
4.11.3. igraph_sparsemat_eye —  Creates a sparse identity matrix (deprecated alias).

-

-

-

-4.11.1. igraph_sparsemat_copy —  Copies a sparse matrix (deprecated alias).

-

-

-
-igraph_error_t igraph_sparsemat_copy(
-    igraph_sparsemat_t *to, const igraph_sparsemat_t *from
-);
-

-

-

-

-
-
-
-

-

-
Warning

-
Deprecated since version 0.10. Please do not use this function in new
-code; use igraph_sparsemat_init_copy()
-instead.

-

-
 
-

-

-

-

-4.11.2. igraph_sparsemat_diag —  Creates a sparse diagonal matrix (deprecated alias).

-

-

-
-igraph_error_t igraph_sparsemat_diag(
-    igraph_sparsemat_t *A, igraph_integer_t nzmax, const igraph_vector_t *values,
-    igraph_bool_t compress
-);
-

-

-

-

-
-
-
-

-

-
Warning

-
Deprecated since version 0.10. Please do not use this function in new
-code; use igraph_sparsemat_init_diag()
-instead.

-

-
 
-

-

-

-

-4.11.3. igraph_sparsemat_eye —  Creates a sparse identity matrix (deprecated alias).

-

-

-
-igraph_error_t igraph_sparsemat_eye(
-    igraph_sparsemat_t *A, igraph_integer_t n, igraph_integer_t nzmax,
-    igraph_real_t value, igraph_bool_t compress
-);
-

-

-

-

-
-
-
-

-

-
Warning

-
Deprecated since version 0.10. Please do not use this function in new
-code; use igraph_sparsemat_init_eye()
-instead.

-

-
 
 

 

 

@@ -20426,7 +20479,7 @@ 
Warning

 

 
 igraph_error_t igraph_strvector_append(igraph_strvector_t *to,
-                            const igraph_strvector_t *from);
+                                       const igraph_strvector_t *from);
 

 

 

@@ -21091,7 +21144,7 @@ 
Warning

 items become invalid at once.

 
Speaking about pointers, the typical way of working with vectors in
 a list is to obtain a pointer to one of the items via the
-igraph_vector_list_get_ptr() method and then passing this pointer
+igraph_vector_list_get_ptr() method and then passing this pointer
 onwards to functions that manipulate igraph_vector_t objects. However,
 note that the pointers are ephemeral in the sense that they may be
 invalidated any time when the list is modified because a modification may
@@ -21122,15 +21175,15 @@ 
Warning

 list due to the ownership rules. If you want to keep a few of the vectors
 in the vector list, you need to copy them with igraph_vector_init_copy() or
 igraph_vector_update(), or you need to remove them from the list and
-take ownership by calling igraph_vector_list_pop_back(),
-igraph_vector_list_remove() or igraph_vector_list_remove_fast() .

+take ownership by calling igraph_vector_list_pop_back(),
+igraph_vector_list_remove() or igraph_vector_list_remove_fast() .

 

 

 9.2.1. igraph_vector_list_init —  Initializes a list of vectors (constructor).

 

 

 
-igraph_error_t igraph_vector_list_init(igraph_vector_list_t* v, igraph_integer_t size);
+igraph_error_t igraph_vector_list_init(igraph_vector_list_t *v, igraph_integer_t size);
 

 

 

@@ -21269,7 +21322,7 @@ 
Warning

 

 

 
-void igraph_vector_list_destroy(igraph_vector_list_t* v);
+void igraph_vector_list_destroy(igraph_vector_list_t *v);
 

 

 

@@ -21316,13 +21369,13 @@ 
Warning

 

 9.3.  Accessing elements

 

-
9.3.1. igraph_vector_list_get_ptr —  Retrieve the address of a vector in the vector list.

-
9.3.2. igraph_vector_list_tail_ptr —  Retrieve the address of the last vector in the vector list.

+
9.3.1. igraph_vector_list_get_ptr —  The address of a vector in the vector list.

+
9.3.2. igraph_vector_list_tail_ptr —  The address of the last vector in the vector list.

 
9.3.3. igraph_vector_list_set —  Sets the vector at the given index in the list.

 
9.3.4. igraph_vector_list_replace —  Replaces the vector at the given index in the list with another one.

 

 
Elements of a vector list may be accessed with the
-igraph_vector_list_get_ptr() function. The function returns a pointer
+igraph_vector_list_get_ptr() function. The function returns a pointer
 to the vector with a given index inside the list, and you may then pass
 this pointer onwards to other functions that can query or manipulate
 vectors. The pointer itself is guaranteed to stay valid as long as the
@@ -21337,22 +21390,22 @@ 
Warning

 
Note that the standard VECTOR macro that works for ordinary vectors
 does not work for lists of vectors to access the i-th element (but of course
 you can use it to index into an existing vector that you retrieved from the
-vector list with igraph_vector_list_get_ptr() ). This is because the
+vector list with igraph_vector_list_get_ptr() ). This is because the
 macro notation would allow one to overwrite the vector in the list with
 another one without the list knowing about it, so the list would not be able
 to destroy the vector that was overwritten by a new one.
 

-
 igraph_vector_list_tail_ptr() returns a pointer to the last
+
 igraph_vector_list_tail_ptr() returns a pointer to the last
 vector in the list, or NULL if the list is empty. There is no
 igraph_vector_list_head_ptr(), however, as it is easy to
 write igraph_vector_list_get_ptr(v, 0) instead.

 

 

-9.3.1. igraph_vector_list_get_ptr —  Retrieve the address of a vector in the vector list.

+9.3.1. igraph_vector_list_get_ptr —  The address of a vector in the vector list.

 

 

 
-igraph_vector_t* igraph_vector_list_get_ptr(const igraph_vector_list_t* v, igraph_integer_t pos);
+igraph_vector_t *igraph_vector_list_get_ptr(const igraph_vector_list_t *v, igraph_integer_t pos);
 

 

 

@@ -21360,6 +21413,7 @@ 
Warning

 
 
 
+
 

 
Arguments: 
 

@@ -21408,11 +21462,11 @@ 
Warning

 

 

 

-9.3.2. igraph_vector_list_tail_ptr —  Retrieve the address of the last vector in the vector list.

+9.3.2. igraph_vector_list_tail_ptr —  The address of the last vector in the vector list.

 

 

 
-igraph_vector_t* igraph_vector_list_tail_ptr(const igraph_vector_list_t *v);
+igraph_vector_t *igraph_vector_list_tail_ptr(const igraph_vector_list_t *v);
 

 

 

@@ -21420,6 +21474,7 @@ 
Warning

 
 
 
+
 

 
Arguments: 
 

@@ -21463,7 +21518,7 @@ 
Warning

 

 

 
-void igraph_vector_list_set(igraph_vector_list_t* v, igraph_integer_t pos, igraph_vector_t* e);
+void igraph_vector_list_set(igraph_vector_list_t *v, igraph_integer_t pos, igraph_vector_t *e);
 

 

 

@@ -21522,7 +21577,7 @@ 
Warning

 

 

 
-void igraph_vector_list_replace(igraph_vector_list_t* v, igraph_integer_t pos, igraph_vector_t* e);
+void igraph_vector_list_replace(igraph_vector_list_t *v, igraph_integer_t pos, igraph_vector_t *e);
 

 

 

@@ -21582,7 +21637,7 @@ 
Warning

 9.4. Vector properties

 

 
9.4.1. igraph_vector_list_empty —  Decides whether the size of the list is zero.

-
9.4.2. igraph_vector_list_size —  Returns the size (=length) of the vector.

+
9.4.2. igraph_vector_list_size —  The size of the vector list.

 
9.4.3. igraph_vector_list_capacity —  Returns the allocated capacity of the list.

 

 

@@ -21591,7 +21646,7 @@ 
Warning

 

 

 
-igraph_bool_t igraph_vector_list_empty(const igraph_vector_list_t* v);
+igraph_bool_t igraph_vector_list_empty(const igraph_vector_list_t *v);
 

 

 

@@ -21638,11 +21693,11 @@ 
Warning

 

 

 

-9.4.2. igraph_vector_list_size —  Returns the size (=length) of the vector.

+9.4.2. igraph_vector_list_size —  The size of the vector list.

 

 

 
-igraph_integer_t igraph_vector_list_size(const igraph_vector_list_t* v);
+igraph_integer_t igraph_vector_list_size(const igraph_vector_list_t *v);
 

 

 

@@ -21651,6 +21706,8 @@ 
Warning

 
 
 
+Returns the number of vectors stored in the list.
+
 

 
Arguments: 
 

@@ -21693,7 +21750,7 @@ 
Warning

 

 

 
-igraph_integer_t igraph_vector_list_capacity(const igraph_vector_list_t* v);
+igraph_integer_t igraph_vector_list_capacity(const igraph_vector_list_t *v);
 

 

 

@@ -21703,7 +21760,7 @@ 
Warning

 
 
 Note that this might be different from the size of the list (as
-queried by igraph_vector_list_size()), and specifies how many vectors
+queried by igraph_vector_list_size()), and specifies how many vectors
 the list can hold, without reallocation.
 
 

@@ -21748,7 +21805,7 @@ 
Warning

 
 

 

-  igraph_vector_list_size().
+  igraph_vector_list_size().
   

 
 

@@ -21765,19 +21822,19 @@ 
Warning

 

 
9.5.1. igraph_vector_list_clear —  Removes all elements from a list of vectors.

 
9.5.2. igraph_vector_list_reserve —  Reserves memory for a list.

-
9.5.3. igraph_vector_list_resize —  Resize the list of vectors.

-
9.5.4. igraph_vector_list_push_back —  Append an existing vector to the list, transferring ownership.

-
9.5.5. igraph_vector_list_push_back_copy —  Append the copy of a vector to the list.

-
9.5.6. igraph_vector_list_push_back_new —  Append a new vector to the list.

-
9.5.7. igraph_vector_list_pop_back —  Remove the last item from the vector list and transfer ownership to the caller.

-
9.5.8. igraph_vector_list_insert —  Insert an existing vector into the list, transferring ownership.

-
9.5.9. igraph_vector_list_insert_copy —  Insert the copy of a vector to the list.

-
9.5.10. igraph_vector_list_insert_new —  Insert a new vector into the list.

-
9.5.11. igraph_vector_list_remove —  Remove the item at the given index from the vector list and transfer ownership to the caller.

-
9.5.12. igraph_vector_list_remove_fast —  Remove the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.

-
9.5.13. igraph_vector_list_discard —  Discard the item at the given index in the vector list.

-
9.5.14. igraph_vector_list_discard_back —  Discard the last item in the vector list.

-
9.5.15. igraph_vector_list_discard_fast —  Discard the item at the given index in the vector list and move the last item to its place.

+
9.5.3. igraph_vector_list_resize —  Resizes the list of vectors.

+
9.5.4. igraph_vector_list_push_back —  Appends an existing vector to the list, transferring ownership.

+
9.5.5. igraph_vector_list_push_back_copy —  Appends the copy of a vector to the list.

+
9.5.6. igraph_vector_list_push_back_new —  Appends a new vector to the list.

+
9.5.7. igraph_vector_list_pop_back —  Removes the last item from the vector list and transfer ownership to the caller.

+
9.5.8. igraph_vector_list_insert —  Inserts an existing vector into the list, transferring ownership.

+
9.5.9. igraph_vector_list_insert_copy —  Inserts the copy of a vector to the list.

+
9.5.10. igraph_vector_list_insert_new —  Inserts a new vector into the list.

+
9.5.11. igraph_vector_list_remove —  Removes the item at the given index from the vector list and transfer ownership to the caller.

+
9.5.12. igraph_vector_list_remove_fast —  Removes the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.

+
9.5.13. igraph_vector_list_discard —  Discards the item at the given index in the vector list.

+
9.5.14. igraph_vector_list_discard_back —  Discards the last item in the vector list.

+
9.5.15. igraph_vector_list_discard_fast —  Discards the item at the given index in the vector list and moves the last item to its place.

 

 

 

@@ -21785,7 +21842,7 @@ 
Warning

 

 

 
-void igraph_vector_list_clear(igraph_vector_list_t* v);
+void igraph_vector_list_clear(igraph_vector_list_t *v);
 

 

 

@@ -21794,8 +21851,6 @@ 
Warning

 
 
 
-

-

 This function sets the size of the list to zero, and it also destroys all
 the vectors that were placed in the list before clearing it.
 
@@ -21826,7 +21881,7 @@ 
Warning

 

 

 
-igraph_error_t igraph_vector_list_reserve(igraph_vector_list_t* v, igraph_integer_t capacity);
+igraph_error_t igraph_vector_list_reserve(igraph_vector_list_t *v, igraph_integer_t capacity);
 

 

 

@@ -21897,11 +21952,11 @@ 
Warning

 

 

 

-9.5.3. igraph_vector_list_resize —  Resize the list of vectors.

+9.5.3. igraph_vector_list_resize —  Resizes the list of vectors.

 

 

 
-igraph_error_t igraph_vector_list_resize(igraph_vector_list_t* v, igraph_integer_t new_size);
+igraph_error_t igraph_vector_list_resize(igraph_vector_list_t *v, igraph_integer_t new_size);
 

 

 

@@ -21992,11 +22047,11 @@ 
Warning

 

 

 

-9.5.4. igraph_vector_list_push_back —  Append an existing vector to the list, transferring ownership.

+9.5.4. igraph_vector_list_push_back —  Appends an existing vector to the list, transferring ownership.

 

 

 
-igraph_error_t igraph_vector_list_push_back(igraph_vector_list_t* v, igraph_vector_t* e);
+igraph_error_t igraph_vector_list_push_back(igraph_vector_list_t *v, igraph_vector_t *e);
 

 

 

@@ -22005,8 +22060,6 @@ 
Warning

 
 
 
-

-

 This function resizes the list to be one element longer, and sets the very last
 element in the list to the specified vector e . The list takes ownership
 of the vector so the user is not responsible for freeing e any more;
@@ -22067,11 +22120,11 @@ 
Warning

 

 

 

-9.5.5. igraph_vector_list_push_back_copy —  Append the copy of a vector to the list.

+9.5.5. igraph_vector_list_push_back_copy —  Appends the copy of a vector to the list.

 

 

 
-igraph_error_t igraph_vector_list_push_back_copy(igraph_vector_list_t* v, const igraph_vector_t* e);
+igraph_error_t igraph_vector_list_push_back_copy(igraph_vector_list_t *v, const igraph_vector_t *e);
 

 

 

@@ -22080,8 +22133,6 @@ 
Warning

 
 
 
-

-

 This function resizes the list to be one element longer, and copies the
 specified vector given as an argument to the last element. The newly added
 element is owned by the list, but the ownership of the original vector is
@@ -22128,18 +22179,18 @@ 
Warning

 

 

 
-Time complexity: same as igraph_vector_list_push_back() plus the time
+Time complexity: same as igraph_vector_list_push_back() plus the time
 needed to copy the vector (which is O(n) for n elements in the vector).
  
 

 

 

 

-9.5.6. igraph_vector_list_push_back_new —  Append a new vector to the list.

+9.5.6. igraph_vector_list_push_back_new —  Appends a new vector to the list.

 

 

 
-igraph_error_t igraph_vector_list_push_back_new(igraph_vector_list_t* v, igraph_vector_t** e);
+igraph_error_t igraph_vector_list_push_back_new(igraph_vector_list_t *v, igraph_vector_t** e);
 

 

 

@@ -22148,8 +22199,6 @@ 
Warning

 
 
 
-

-

 This function resizes the list to be one element longer. The newly added
 element will be an empty vector that is owned by the list. A pointer to
 the newly added element is returned in the last argument if it is not
@@ -22198,17 +22247,17 @@ 
Warning

 

 

 
-Time complexity: same as igraph_vector_list_push_back().
+Time complexity: same as igraph_vector_list_push_back().
  
 

 

 

 

-9.5.7. igraph_vector_list_pop_back —  Remove the last item from the vector list and transfer ownership to the caller.

+9.5.7. igraph_vector_list_pop_back —  Removes the last item from the vector list and transfer ownership to the caller.

 

 

 
-igraph_vector_t igraph_vector_list_pop_back(igraph_vector_list_t* v);
+igraph_vector_t igraph_vector_list_pop_back(igraph_vector_list_t *v);
 

 

 

@@ -22217,8 +22266,6 @@ 
Warning

 
 
 
-

-

 This function removes the last vector from the list. The vector that was
 removed from the list is returned and its ownership is passed back to the
 caller; in other words, the caller becomes responsible for destroying
@@ -22246,7 +22293,7 @@ 
Warning

 
 
result:

 

-  Pointer to an igraph_vector_t object; it will be updated to the
+  Pointer to an igraph_vector_t object; it will be updated to the
        item that was removed from the list. Ownership of this vector is
        passed on to the caller.

 
@@ -22261,11 +22308,11 @@ 
Warning

 

 

 

-9.5.8. igraph_vector_list_insert —  Insert an existing vector into the list, transferring ownership.

+9.5.8. igraph_vector_list_insert —  Inserts an existing vector into the list, transferring ownership.

 

 

 
-igraph_error_t igraph_vector_list_insert(igraph_vector_list_t* v, igraph_integer_t pos, igraph_vector_t* e);
+igraph_error_t igraph_vector_list_insert(igraph_vector_list_t *v, igraph_integer_t pos, igraph_vector_t *e);
 

 

 

@@ -22274,8 +22321,6 @@ 
Warning

 
 
 
-

-

 This function inserts e into the list at the given index, moving other
 items towards the end of the list as needed. The list takes ownership
 of the vector so the user is not responsible for freeing e any more;
@@ -22335,11 +22380,11 @@ 
Warning

-9.5.9. igraph_vector_list_insert_copy — Insert the copy of a vector to the list.

+9.5.9. igraph_vector_list_insert_copy — Inserts the copy of a vector to the list.

-igraph_error_t igraph_vector_list_insert_copy(igraph_vector_list_t* v, igraph_integer_t pos, const igraph_vector_t* e);
+igraph_error_t igraph_vector_list_insert_copy(igraph_vector_list_t *v, igraph_integer_t pos, const igraph_vector_t *e);

@@ -22348,8 +22393,6 @@

Warning

-

-

This function inserts a copy of e into the list at the given index, moving other items towards the end of the list as needed. The newly added element is owned by the list, but the ownership of the original vector is @@ -22402,18 +22445,18 @@

Warning

-Time complexity: same as igraph_vector_list_insert() plus the time +Time complexity: same as igraph_vector_list_insert() plus the time needed to copy the vector (which is O(n) for n elements in the vector).

-9.5.10. igraph_vector_list_insert_new — Insert a new vector into the list.

+9.5.10. igraph_vector_list_insert_new — Inserts a new vector into the list.

-igraph_error_t igraph_vector_list_insert_new(igraph_vector_list_t* v, igraph_integer_t pos, igraph_vector_t** e);
+igraph_error_t igraph_vector_list_insert_new(igraph_vector_list_t *v, igraph_integer_t pos, igraph_vector_t** e);

@@ -22422,8 +22465,6 @@

Warning

-

-

This function inserts a newly created empty vector into the list at the given index, moving other items towards the end of the list as needed. The newly added vector is owned by the list. A pointer to the new element is returned @@ -22478,17 +22519,17 @@

Warning

-Time complexity: same as igraph_vector_list_push_back(). +Time complexity: same as igraph_vector_list_push_back().

-9.5.11. igraph_vector_list_remove — Remove the item at the given index from the vector list and transfer ownership to the caller.

+9.5.11. igraph_vector_list_remove — Removes the item at the given index from the vector list and transfer ownership to the caller.

-igraph_error_t igraph_vector_list_remove(igraph_vector_list_t* v, igraph_integer_t index, igraph_vector_t* result);
+igraph_error_t igraph_vector_list_remove(igraph_vector_list_t *v, igraph_integer_t index, igraph_vector_t *result);

@@ -22497,8 +22538,6 @@

Warning

-

-

This function removes the vector at the given index from the list, and moves all subsequent items in the list by one slot to the left to fill the gap. The vector that was removed from the list is returned in e @@ -22529,7 +22568,7 @@

Warning

result:

- Pointer to an igraph_vector_t object; it will be updated to the + Pointer to an igraph_vector_t object; it will be updated to the item that was removed from the list. Ownership of this vector is passed on to the caller. It is an error to supply a null pointer here.

@@ -22547,8 +22586,8 @@

Warning

- igraph_vector_list_discard() if you are not interested in the item -that was removed, igraph_vector_list_remove_fast() if you do not care + igraph_vector_list_discard() if you are not interested in the item +that was removed, igraph_vector_list_remove_fast() if you do not care about the order of the items in the list.

@@ -22561,11 +22600,11 @@

Warning

-9.5.12. igraph_vector_list_remove_fast — Remove the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.

+9.5.12. igraph_vector_list_remove_fast — Removes the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.

-igraph_error_t igraph_vector_list_remove_fast(igraph_vector_list_t* v, igraph_integer_t index, igraph_vector_t* result);
+igraph_error_t igraph_vector_list_remove_fast(igraph_vector_list_t *v, igraph_integer_t index, igraph_vector_t *result);

@@ -22574,8 +22613,6 @@

Warning

-

-

This function removes the vector at the given index from the list, moves the last item in the list to index to fill the gap, and then transfers ownership of the removed vector back to the caller; in other words, @@ -22606,7 +22643,7 @@

Warning

result:

- Pointer to an igraph_vector_t object; it will be updated to the + Pointer to an igraph_vector_t object; it will be updated to the item that was removed from the list. Ownership of this vector is passed on to the caller. It is an error to supply a null pointer here.

@@ -22624,8 +22661,8 @@

Warning

- igraph_vector_list_remove() if you want to preserve the order of the -items in the list, igraph_vector_list_discard_fast() if you are not + igraph_vector_list_remove() if you want to preserve the order of the +items in the list, igraph_vector_list_discard_fast() if you are not interested in the item that was removed.

@@ -22638,11 +22675,11 @@

Warning

-9.5.13. igraph_vector_list_discard — Discard the item at the given index in the vector list.

+9.5.13. igraph_vector_list_discard — Discards the item at the given index in the vector list.

-void igraph_vector_list_discard(igraph_vector_list_t* v, igraph_integer_t index);
+void igraph_vector_list_discard(igraph_vector_list_t *v, igraph_integer_t index);

@@ -22651,8 +22688,6 @@

Warning

-

-

This function removes the vector at the given index from the list, and moves all subsequent items in the list by one slot to the left to fill the gap. The vector that was removed from the list is destroyed automatically. @@ -22691,8 +22726,8 @@

Warning

- igraph_vector_list_discard_fast() if you do not care about the -order of the items in the list, igraph_vector_list_remove() if you + igraph_vector_list_discard_fast() if you do not care about the +order of the items in the list, igraph_vector_list_remove() if you want to gain ownership of the item that was removed instead of destroying it.

@@ -22705,11 +22740,11 @@

Warning

-9.5.14. igraph_vector_list_discard_back — Discard the last item in the vector list.

+9.5.14. igraph_vector_list_discard_back — Discards the last item in the vector list.

-void igraph_vector_list_discard_back(igraph_vector_list_t* v);
+void igraph_vector_list_discard_back(igraph_vector_list_t *v);

@@ -22718,8 +22753,6 @@

Warning

-

-

This function removes the last vector from the list and destroys it.

@@ -22745,11 +22778,11 @@

Warning

-9.5.15. igraph_vector_list_discard_fast — Discard the item at the given index in the vector list and move the last item to its place.

+9.5.15. igraph_vector_list_discard_fast — Discards the item at the given index in the vector list and moves the last item to its place.

-void igraph_vector_list_discard_fast(igraph_vector_list_t* v, igraph_integer_t index);
+void igraph_vector_list_discard_fast(igraph_vector_list_t *v, igraph_integer_t index);

@@ -22758,8 +22791,6 @@

Warning

-

-

This function removes the vector at the given index from the list, and moves the last item in the list to index to fill the gap. The vector that was removed from the list is destroyed automatically. @@ -22798,8 +22829,8 @@

Warning

- igraph_vector_list_discard() if you want to preserve the order of the -items in the list, igraph_vector_list_remove_fast() if you want to gain + igraph_vector_list_discard() if you want to preserve the order of the +items in the list, igraph_vector_list_remove_fast() if you want to gain ownership of the item that was removed instead of destroying it.

@@ -22827,7 +22858,7 @@

Warning

-igraph_error_t igraph_vector_list_permute(igraph_vector_list_t* v, const igraph_vector_int_t* index);
+igraph_error_t igraph_vector_list_permute(igraph_vector_list_t *v, const igraph_vector_int_t* index);

@@ -23098,6 +23129,7 @@

Warning

Note that currently no range checking is performed. +

Arguments: 

@@ -23663,8 +23695,9 @@

Warning

-Returns a pointer to an igraph_vector_int_t object from an +Returns a pointer to an igraph_vector_int_t object from an adjacency list. The vector can be modified as desired. +

Arguments: 

@@ -23699,7 +23732,7 @@

Warning

- Pointer to the igraph_vector_int_t object. + Pointer to the igraph_vector_int_t object.

@@ -25483,13 +25516,18 @@

Warning

single bit of memory.

The elements in an igraph_bitset_t object and its variants are indexed from zero, we follow the usual C convention here. Bitsets are indexed -from right to left, meaning index 0 is the least significant bit and index n-1 -is the most significant bit.

+from right to left, meaning index 0 is the least significant bit and index +n - 1 is the most significant bit.

The elements of a bitset always occupy a single block of memory, the starting address of this memory block can be queried with the VECTOR() macro. This way, bitset objects can be used with standard mathematical libraries, like the GNU Scientific Library.

+

Note that while the interface of bitset functions is similar to +igraph's vector functions, there is one major difference: bitset functions +such as igraph_bitset_and() do not verify that that sizes of input +parameters are compatible, and do not automatically resize the output +parameter. Doing so is the responsibility of the user.

@@ -25617,11 +25655,9 @@

Warning

We reserve the right to change the function signature without changing the major version of igraph. Use it at your own risk.

-

-

- -The contents of the existing bitset object will be copied to +

The contents of the existing bitset object will be copied to the new one. +

Arguments: 

@@ -25692,9 +25728,7 @@

Warning

We reserve the right to change the function signature without changing the major version of igraph. Use it at your own risk.

-

-

-All bitsets initialized by igraph_bitset_init() should be properly +

All bitsets initialized by igraph_bitset_init() should be properly destroyed by this function. A destroyed bitset needs to be reinitialized by igraph_bitset_init() or another constructor. @@ -26134,7 +26168,7 @@

Warning

-*

+

See also: 

@@ -26261,13 +26295,13 @@

Warning

+ A bitset. Must have have same size as dest.

src1:

- A bitset + A bitset. Must have have same size as dest.

src2:

- A bitset
@@ -26325,13 +26359,13 @@

Warning

src1:

- A bitset + A bitset. Must have have same size as dest.

src2:

- A bitset

+ A bitset. Must have have same size as dest.

@@ -26390,13 +26424,13 @@

Warning

src1:

- A bitset + A bitset. Must have have same size as dest.

src2:

- A bitset

+ A bitset. Must have have same size as dest.

@@ -26453,7 +26487,7 @@

Warning

src:

- A bitset

+ A bitset. Must have have same size as dest.

@@ -27180,9 +27214,7 @@

Warning

We reserve the right to change the function signature without changing the major version of igraph. Use it at your own risk.

-

-

-igraph bitsets are flexible, they can grow and +

igraph bitsets are flexible, they can grow and shrink. Growing however occasionally needs the data in the bitset to be copied. In order to avoid this, you can call this function to reserve space for @@ -27195,6 +27227,7 @@

Warning

reserve space for 100 elements and the size of your bitset was (and still is) 60, then you can surely add additional 40 elements to your bitset before it will be copied. +

Arguments: 

@@ -27265,9 +27298,7 @@

Warning

We reserve the right to change the function signature without changing the major version of igraph. Use it at your own risk.

-

-

-Note that this function does not free any memory, just sets the +

Note that this function does not free any memory, just sets the size of the bitset to the given one. It may, on the other hand, allocate more memory if the new size is larger than the previous one. In this case the newly appeared elements in the bitset are diff --git a/docs/c/html/develop/igraph-Foreign.html b/docs/c/html/develop/igraph-Foreign.html index 02dd1f380..01d57cca6 100644 --- a/docs/c/html/develop/igraph-Foreign.html +++ b/docs/c/html/develop/igraph-Foreign.html @@ -159,7 +159,6 @@

igraph Reference Manual

7. Graphviz format
8. LEDA format
9. Convenience functions for locale change
-
10. Deprecated functions

These functions can write a graph to a file, or read a graph from a file.

@@ -1137,7 +1136,7 @@

igraph Reference Manual

- igraph_write_graph_dimacs() + igraph_write_graph_dimacs_flow()

@@ -3062,70 +3061,6 @@

Warning

-

- - -
-

-10. Deprecated functions

-
-
10.1. igraph_read_graph_dimacs — Read a graph in DIMACS format (deprecated alias).
-
10.2. igraph_write_graph_dimacs — Write a graph in DIMACS format (deprecated alias).
-
-
-

-10.1. igraph_read_graph_dimacs — Read a graph in DIMACS format (deprecated alias).

-

-

-
-igraph_error_t igraph_read_graph_dimacs(igraph_t *graph, FILE *instream,
-                             igraph_strvector_t *problem,
-                             igraph_vector_int_t *label,
-                             igraph_integer_t *source,
-                             igraph_integer_t *target,
-                             igraph_vector_t *capacity,
-                             igraph_bool_t directed);
-
-

-

-

- - - -

-
-

Warning

-

Deprecated since version 0.10.0. Please do not use this function in new -code; use igraph_read_graph_dimacs_flow() -instead.

-
-

-

-
-
-

-10.2. igraph_write_graph_dimacs — Write a graph in DIMACS format (deprecated alias).

-

-

-
-igraph_error_t igraph_write_graph_dimacs(const igraph_t *graph, FILE *outstream,
-                              igraph_integer_t source, igraph_integer_t target,
-                              const igraph_vector_t *capacity);
-
-

-

-

- - - -

-
-

Warning

-

Deprecated since version 0.10.0. Please do not use this function in new -code; use igraph_write_graph_dimacs_flow() -instead.

-
-

diff --git a/docs/c/html/develop/igraph-Generators.html b/docs/c/html/develop/igraph-Generators.html index 617a13a53..f0478ee0d 100644 --- a/docs/c/html/develop/igraph-Generators.html +++ b/docs/c/html/develop/igraph-Generators.html @@ -1093,7 +1093,7 @@

igraph Reference Manual

Logical, for undirected graphs this specified whether each edge is included twice, in the vectors of - both adjacent vertices. If this is false (0), then it is + both adjacent vertices. If this is false, then it is assumed that every edge is included only once. This argument is ignored for directed graphs.

@@ -1545,14 +1545,7 @@

igraph Reference Manual

-

-
-

Warning

-

This function is experimental and its signature is not considered final yet. -We reserve the right to change the function signature without changing the -major version of igraph. Use it at your own risk.

-
-

The hypercube graph Q_n has 2^n vertices and +The hypercube graph Q_n has 2^n vertices and 2^(n-1) n edges. Two vertices are connected when the binary representations of their zero-based vertex IDs differs in precisely one bit. @@ -2159,7 +2152,7 @@

Warning

Note that for n=0, the null graph is returned, -which is not considered to be a tree by igraph_is_tree(). +which is not considered to be a tree by igraph_is_tree().

Arguments:  @@ -2292,10 +2285,10 @@

Warning

with edges pointing towards the root. */ igraph_kary_tree(&graph, 15, 2, IGRAPH_TREE_IN); - igraph_is_tree(&graph, &res, NULL, IGRAPH_IN); + igraph_is_tree(&graph, &res, NULL, IGRAPH_IN); printf("Is it an in-tree? %s\n", res ? "Yes" : "No"); - igraph_is_tree(&graph, &res, NULL, IGRAPH_OUT); + igraph_is_tree(&graph, &res, NULL, IGRAPH_OUT); printf("Is it an out-tree? %s\n", res ? "Yes" : "No"); igraph_destroy(&graph); @@ -2459,10 +2452,10 @@

Warning

with edges pointing towards the root. */ igraph_symmetric_tree(&graph, &v, IGRAPH_TREE_IN); - igraph_is_tree(&graph, &res, NULL, IGRAPH_IN); + igraph_is_tree(&graph, &res, NULL, IGRAPH_IN); printf("Is it an in-tree? %s\n", res ? "Yes" : "No"); - igraph_is_tree(&graph, &res, NULL, IGRAPH_OUT); + igraph_is_tree(&graph, &res, NULL, IGRAPH_OUT); printf("Is it an out-tree? %s\n", res ? "Yes" : "No"); igraph_destroy(&graph); @@ -2627,7 +2620,7 @@

Warning

igraph_regular_tree(&tree, 4, 3, IGRAPH_TREE_UNDIRECTED); /* Bethe lattices are trees. */ - igraph_is_tree(&tree, &is_tree, NULL, IGRAPH_ALL); + igraph_is_tree(&tree, &is_tree, NULL, IGRAPH_ALL); printf("Is it a tree? %s\n", is_tree ? "Yes." : "No."); /* Compute and print eccentricities. The root is the most central. */ @@ -2792,7 +2785,7 @@

Warning

igraph_bfs(), igraph_bfs_simple() for back-conversion; igraph_from_prufer() for creating trees from Prüfer sequences; -igraph_is_tree() and igraph_is_forest() to check if a graph +igraph_is_tree() and igraph_is_forest() to check if a graph is a tree or forest.

@@ -4569,7 +4562,7 @@

Warning

- igraph_to_prufer(), igraph_kary_tree(), igraph_tree_game() + igraph_to_prufer(), igraph_kary_tree(), igraph_tree_game()

@@ -9722,7 +9715,7 @@

Warning

Note that for n=0, the null graph is returned, -which is not considered to be a tree by igraph_is_tree(). +which is not considered to be a tree by igraph_is_tree().

Arguments:  diff --git a/docs/c/html/develop/igraph-Isomorphism.html b/docs/c/html/develop/igraph-Isomorphism.html index c9d851b7e..bf45902ed 100644 --- a/docs/c/html/develop/igraph-Isomorphism.html +++ b/docs/c/html/develop/igraph-Isomorphism.html @@ -156,7 +156,6 @@

igraph Reference Manual

4. The LAD algorithm
5. Functions for small graphs
6. Utility functions
-
7. Deprecated functions

@@ -1275,7 +1274,6 @@

igraph Reference Manual

3.8. igraph_count_subisomorphisms_vf2 — Number of subgraph isomorphisms using VF2
3.9. igraph_get_subisomorphisms_vf2 — Return all subgraph isomorphic mappings.
3.10. igraph_get_subisomorphisms_vf2_callback — Generic VF2 function for subgraph isomorphism problems.
-
3.11. Deprecated aliases

The VF2 algorithm can search for a subgraph in a larger graph, or check if two @@ -2693,76 +2691,6 @@

igraph Reference Manual

-
-

-3.11. Deprecated aliases

-
-
3.11.1. igraph_isomorphic_function_vf2 — The generic VF2 interface (deprecated alias).
-
3.11.2. igraph_subisomorphic_function_vf2 — Generic VF2 function for subgraph isomorphism problems (deprecated alias).
-
-
-

-3.11.1. igraph_isomorphic_function_vf2 — The generic VF2 interface (deprecated alias).

-

-

-
-igraph_error_t igraph_isomorphic_function_vf2(
-    const igraph_t *graph1, const igraph_t *graph2,
-    const igraph_vector_int_t *vertex_color1, const igraph_vector_int_t *vertex_color2,
-    const igraph_vector_int_t *edge_color1, const igraph_vector_int_t *edge_color2,
-    igraph_vector_int_t *map12, igraph_vector_int_t *map21,
-    igraph_isohandler_t *isohandler_fn, igraph_isocompat_t *node_compat_fn,
-    igraph_isocompat_t *edge_compat_fn, void *arg
-);
-
-

-

-

- - - -

-
-

Warning

-

Deprecated since version 0.10.0. Please do not use this function in new -code; use igraph_get_isomorphisms_vf2_callback() -instead.

-
-

-

-
-
-

-3.11.2. igraph_subisomorphic_function_vf2 — Generic VF2 function for subgraph isomorphism problems (deprecated alias).

-

-

-
-igraph_error_t igraph_subisomorphic_function_vf2(
-    const igraph_t *graph1, const igraph_t *graph2,
-    const igraph_vector_int_t *vertex_color1, const igraph_vector_int_t *vertex_color2,
-    const igraph_vector_int_t *edge_color1, const igraph_vector_int_t *edge_color2,
-    igraph_vector_int_t *map12, igraph_vector_int_t *map21,
-    igraph_isohandler_t *isohandler_fn, igraph_isocompat_t *node_compat_fn,
-    igraph_isocompat_t *edge_compat_fn, void *arg
-);
-
-

-

-

- - - -

-
-

Warning

-

Deprecated since version 0.10.0. Please do not use this function in new -code; use igraph_get_subisomorphisms_vf2_callback() -instead.

-
-

-

-
-

@@ -3633,93 +3561,6 @@

Warning

-

-
-
-
-

-7. Deprecated functions

-
7.1. igraph_isomorphic_34 — Graph isomorphism for 3-4 vertices (deprecated).
-
-

-7.1. igraph_isomorphic_34 — Graph isomorphism for 3-4 vertices (deprecated).

-

-

-
-igraph_error_t igraph_isomorphic_34(
-    const igraph_t *graph1, const igraph_t *graph2, igraph_bool_t *iso
-);
-
-

-

-

- - - -

-
-

Warning

-

Deprecated since version 0.10.0. Please do not use this function in new -code; use igraph_isomorphic() -instead.

-
-

-If you really care about performance and you know for sure that your -input graphs are simple and have either 3 or 4 vertices for directed graphs, -or 3-6 vertices for undirected graphs, you can compare their isomorphism -classes obtained from igraph_isoclass() directly instead of calling -igraph_isomorphic(); this saves the cost of checking whether the graphs -do not contain multiple edges or self-loops. - -

-

Arguments:  -

-
---- - - - - - - - - - - - - - - -

graph1:

- The first input graph. -

graph2:

- The second input graph. Must have the same - directedness as graph1. -

iso:

- Pointer to a boolean, the result is stored here. -

-

-

-

Returns: 

-
---- - - - - -

- Error code. -

-

- -Time complexity: O(1). -

diff --git a/docs/c/html/develop/igraph-Motifs.html b/docs/c/html/develop/igraph-Motifs.html index c88254659..4336ed501 100644 --- a/docs/c/html/develop/igraph-Motifs.html +++ b/docs/c/html/develop/igraph-Motifs.html @@ -902,7 +902,7 @@

igraph Reference Manual

/* Compute the total number of motifs (connected 4-vertex subgraphs) * so that we can print the normalized distribution. */ igraph_real_t sum = 0.0; - igraph_integer_t n = igraph_vector_size(&hist); + igraph_integer_t n = igraph_vector_size(&hist); for (igraph_integer_t i=0; i < n; i++) { if (!isnan(VECTOR(hist)[i])) { sum += VECTOR(hist)[i]; @@ -1287,7 +1287,7 @@

igraph Reference Manual

/* Compute the total number of motifs (connected 4-vertex subgraphs) * so that we can print the normalized distribution. */ igraph_real_t sum = 0.0; - igraph_integer_t n = igraph_vector_size(&hist); + igraph_integer_t n = igraph_vector_size(&hist); for (igraph_integer_t i=0; i < n; i++) { if (!isnan(VECTOR(hist)[i])) { sum += VECTOR(hist)[i]; diff --git a/docs/c/html/develop/igraph-Operators.html b/docs/c/html/develop/igraph-Operators.html index a6ba0d550..83cfd7d66 100644 --- a/docs/c/html/develop/igraph-Operators.html +++ b/docs/c/html/develop/igraph-Operators.html @@ -153,7 +153,6 @@

igraph Reference Manual

1. Union and intersection
2. Other set-like operators
3. Miscellaneous operators
-
4. Deprecated functions

@@ -941,7 +940,7 @@

Warning

#include <igraph.h>
 
 void print_vector(igraph_vector_t *v) {
-    igraph_integer_t i, l = igraph_vector_size(v);
+    igraph_integer_t i, l = igraph_vector_size(v);
     for (i = 0; i < l; i++) {
         printf(" %" IGRAPH_PRId "", (igraph_integer_t) VECTOR(*v)[i]);
     }
@@ -2930,39 +2929,6 @@ 
Warning

 Time complexity: O(1) if all edges are reversed, otherwise
 O(|E|) where |E| is the number of edges in the graph.
  
-

-
-
-
-

-4. Deprecated functions

-
4.1. igraph_subgraph_edges — Creates a subgraph with the specified edges and their endpoints.
-
-

-4.1. igraph_subgraph_edges — Creates a subgraph with the specified edges and their endpoints.

-

-

-
-igraph_error_t igraph_subgraph_edges(
-    const igraph_t *graph, igraph_t *res, const igraph_es_t eids,
-    igraph_bool_t delete_vertices
-);
-
-

-

-

- - - - -

-
-

Warning

-

Deprecated since version 0.10.3. Please do not use this function in new -code; use igraph_subgraph_from_edges() -instead.

-
-

diff --git a/docs/c/html/develop/igraph-Structural.html b/docs/c/html/develop/igraph-Structural.html index 1f257b286..d81cdf995 100644 --- a/docs/c/html/develop/igraph-Structural.html +++ b/docs/c/html/develop/igraph-Structural.html @@ -176,7 +176,6 @@

igraph Reference Manual

24. Matchings
25. Unfolding a graph into a tree
26. Other operations
-
27. Deprecated functions

These functions usually calculate some structural property of a graph, like its diameter, the degree of the nodes, etc.

@@ -1831,7 +1830,7 @@

Warning

IGRAPH_FLOYD_WARSHALL_AUTOMATIC

- tried to select the best performing variant for the current graph; + tries to select the best performing variant for the current graph; presently this option always uses the "Tree" method.

@@ -2586,11 +2585,11 @@

Warning

- igraph_distances_dijkstra() if you only need the path length but + igraph_distances_dijkstra() if you only need the path lengths but not the paths themselves; igraph_get_shortest_paths() if all edge weights are equal; igraph_get_all_shortest_paths() to find all shortest paths between (source, target) pairs; -igraph_get_shortest_paths_bellman_ford() if some edge weighted are +igraph_get_shortest_paths_bellman_ford() if some edge weights are negative.

@@ -3797,7 +3796,7 @@

Warning

igraph_distances_dijkstra() if you only need the path -length but not the paths themselves, igraph_get_all_shortest_paths() +lengths but not the paths themselves, igraph_get_all_shortest_paths() if all edge weights are equal.

@@ -9156,8 +9155,8 @@

Warning

The maximum number of components to return. The first maxcompno components will be returned (which hold at least minelements vertices, see the next parameter), the - others will be ignored. Supply -1 here if you don't want to limit - the number of components. + others will be ignored. Supply -1 here if you don't + want to limit the number of components.

@@ -9165,7 +9164,7 @@

Warning

The minimum number of vertices a component should contain in order to place it in the components - vector. Eg. supply 2 here to ignore isolated vertices. + vector. For example, supplying 2 here ignored isolated vertices.

@@ -16761,23 +16760,21 @@

Warning

15. Trees and forests

-
15.1. igraph_minimum_spanning_tree — Calculates one minimum spanning tree of a graph.
-
15.2. igraph_minimum_spanning_tree_unweighted — Calculates one minimum spanning tree of an unweighted graph.
-
15.3. igraph_minimum_spanning_tree_prim — Calculates one minimum spanning tree of a weighted graph.
-
15.4. igraph_random_spanning_tree — Uniformly samples the spanning trees of a graph.
-
15.5. igraph_is_tree — Decides whether the graph is a tree.
-
15.6. igraph_is_forest — Decides whether the graph is a forest.
-
15.7. igraph_to_prufer — Converts a tree to its Prüfer sequence.
+
15.1. igraph_minimum_spanning_tree — Calculates a minimum spanning tree of a graph.
+
15.2. igraph_random_spanning_tree — Uniformly samples the spanning trees of a graph.
+
15.3. igraph_is_tree — Decides whether the graph is a tree.
+
15.4. igraph_is_forest — Decides whether the graph is a forest.
+
15.5. igraph_to_prufer — Converts a tree to its Prüfer sequence.

-15.1. igraph_minimum_spanning_tree — Calculates one minimum spanning tree of a graph.

+15.1. igraph_minimum_spanning_tree — Calculates a minimum spanning tree of a graph.

 igraph_error_t igraph_minimum_spanning_tree(
-    const igraph_t *graph, igraph_vector_int_t *res, const igraph_vector_t *weights
-);
+    const igraph_t *graph, igraph_vector_int_t *res,
+    const igraph_vector_t *weights, igraph_mst_algorithm_t method);

@@ -16786,20 +16783,39 @@

Warning

-Finds a spanning tree of the graph. If the graph is not connected -then its minimum spanning forest is returned. This is the set of the -minimum spanning trees of each component. +Finds a minimum weight spanning tree of the graph. If the graph is not +connected then its minimum spanning forest is returned, i.e. the set +of the minimum spanning trees of each component.

-Directed graphs are considered as undirected for this computation. +Directed graphs are treated as undirected for this computation.

This function is deterministic, i.e. it always returns the same -spanning tree. See igraph_random_spanning_tree() for the uniform +spanning tree. See igraph_random_spanning_tree() for the uniform random sampling of spanning trees of a graph. +

+

+References: + +

+

+Prim, R.C.: Shortest connection networks and some +generalizations, Bell System Technical +Journal, Vol. 36, +1957, 1389--1401. +https://doi.org/10.1002/j.1538-7305.1957.tb01515.x + +

+

+Kruskal, J. B.: +On the shortest spanning subtree of a graph and the traveling salesman problem, +Proc. Amer. Math. Soc. 7 (1956), 48-50 +https://doi.org/10.1090%2FS0002-9939-1956-0078686-7 +

Arguments: 

@@ -16812,7 +16828,7 @@

Warning

graph:

- The graph object. + The graph object. Edge directions will be ignored.

@@ -16827,146 +16843,17 @@

Warning

weights:

- A vector containing the weights of the edges - in the same order as the simple edge iterator visits them - (i.e. in increasing order of edge IDs). + A vector containing the weights of the edges in the order + of edge IDs. Weights must not be NaN. Supply NULL to treat all + edges as having the same weight.

- -
-

-

-

Returns: 

-
---- - - - - -

- Error code: - IGRAPH_ENOMEM, not enough memory for - temporary data. -

-

- -Time complexity: O(|V|+|E|) for the unweighted case, O(|E| log |V|) -for the weighted case. |V| is the number of vertices, |E| the -number of edges in the graph. - -

-

See also: 

-
---- - - - - -

- igraph_minimum_spanning_tree_unweighted() and - igraph_minimum_spanning_tree_prim() if you only need the - tree as a separate graph object. -

-

- -

-
-
-

Example 13.31.  File examples/simple/igraph_minimum_spanning_tree.c

-
-
#include <igraph.h>
-
-int main(void) {
-
-    igraph_t graph, tree;
-    igraph_vector_t eb;
-    igraph_vector_int_t edges;
-
-    /* Create the Frucht graph */
-    igraph_famous(&graph, "Frucht");
-
-    /* Compute the edge betweenness. */
-    igraph_vector_init(&eb, igraph_ecount(&graph));
-    igraph_edge_betweenness(&graph, &eb, IGRAPH_UNDIRECTED, /*weights=*/ NULL);
-
-    /* Compute and output a minimum weight spanning tree using edge betweenness
-     * values as weights. */
-    igraph_minimum_spanning_tree_prim(&graph, &tree, &eb);
-    printf("Minimum spanning tree:\n");
-    igraph_write_graph_edgelist(&tree, stdout);
-
-    /* A maximum spanning tree can be computed by first negating the weights. */
-    igraph_vector_scale(&eb, -1);
-
-    /* Compute and output the edges that belong to the maximum weight spanning tree. */
-    igraph_vector_int_init(&edges, 0);
-    igraph_minimum_spanning_tree(&graph, &edges, &eb);
-    printf("\nMaximum spanning tree edges:\n");
-    igraph_vector_int_print(&edges);
-
-    igraph_real_t total_tree_weight = 0;
-    igraph_integer_t n = igraph_vector_int_size(&edges);
-    for (igraph_integer_t i=0; i < n; i++) {
-        total_tree_weight += -VECTOR(eb)[ VECTOR(edges)[i] ];
-    }
-    printf("\nTotal maximum spanning tree weight: %g\n", total_tree_weight);
-
-    /* Clean up */
-    igraph_vector_int_destroy(&edges);
-    igraph_destroy(&tree);
-    igraph_destroy(&graph);
-    igraph_vector_destroy(&eb);
-
-    return 0;
-}
-
-

-
-
-
-
-

-

- -
-

-15.2. igraph_minimum_spanning_tree_unweighted — Calculates one minimum spanning tree of an unweighted graph.

-

-

-
-igraph_error_t igraph_minimum_spanning_tree_unweighted(const igraph_t *graph,
-        igraph_t *mst);
-
-

-

-

- - - - -If the graph has more minimum spanning trees (this is always the -case, except if it is a forest) this implementation returns only -the same one. - -

-

-Directed graphs are considered as undirected for this computation. - -

+ +

method:

+

-If the graph is not connected then its minimum spanning forest is -returned. This is the set of the minimum spanning trees of each -component. - -

-

Arguments:  -

+ The type of the algorithm used. +

@@ -16974,139 +16861,47 @@

Warning

- + - - - - -

graph:

IGRAPH_MST_AUTOMATIC

- The graph object. Edge directions will be ignored. + + tries to select the best performing algorithm for the current graph. +

mst:

- The minimum spanning tree, another graph object. Do - not initialize this object before passing it to - this function, but be sure to call igraph_destroy() on it if - you don't need it any more. -

-

-

-

Returns: 

-
---- - - - - -

- Error code: - IGRAPH_ENOMEM, not enough memory for - temporary data. -

-

- -Time complexity: O(|V|+|E|), -|V| is the -number of vertices, |E| the number -of edges in the graph. - -

-

See also: 

-
---- - - + - -

IGRAPH_MST_UNWEIGHTED

- igraph_minimum_spanning_tree_prim() for weighted graphs, - igraph_minimum_spanning_tree() if you need the IDs of the - edges that constitute the spanning tree. -

-

- -

-
-
-

-15.3. igraph_minimum_spanning_tree_prim — Calculates one minimum spanning tree of a weighted graph.

-

-

-
-igraph_error_t igraph_minimum_spanning_tree_prim(const igraph_t *graph, igraph_t *mst,
-                                      const igraph_vector_t *weights);
-
-

-

-

- - - - -Finds a spanning tree or spanning forest for which the sum of edge -weights is the smallest. This function uses Prim's method for carrying -out the computation. - -

-

-Directed graphs are considered as undirected for this computation. - -

-

-Reference: - -

-

-Prim, R.C.: Shortest connection networks and some -generalizations, Bell System Technical -Journal, Vol. 36, -1957, 1389--1401. -https://doi.org/10.1002/j.1538-7305.1957.tb01515.x -

-

Arguments:  -

-
---- - - - - - + - +

graph:

- The graph object. Edge directions will be ignored. + ignores edge weights and produces an arbitrary spanning tree. +

mst:

IGRAPH_MST_PRIM

- The result of the computation, a graph object containing - the minimum spanning tree of the graph. - Do not initialize this object before passing it to - this function, but be sure to call igraph_destroy() on it if - you don't need it any more. + + uses Prim's algorithm. +

weights:

IGRAPH_MST_KRUSKAL

- A vector containing the weights of the edges - in the same order as the simple edge iterator visits them - (i.e. in increasing order of edge IDs). + + uses Kruskal's algorithm. +

+ + + +
+

+

Returns: 

@@ -17116,19 +16911,13 @@

Warning

- Error code: - IGRAPH_ENOMEM, not enough memory. - IGRAPH_EINVAL, length of weight vector does not - match number of edges. + Error code.

-Time complexity: O(|E| log |V|), -|V| is the number of vertices, -|E| the number of edges in the -graph. +Time complexity: See the functions implementing the specific algorithms.

See also: 

@@ -17140,9 +16929,8 @@

Warning

- igraph_minimum_spanning_tree_unweighted() for unweighted graphs, - igraph_minimum_spanning_tree() if you need the IDs of the - edges that constitute the spanning tree. + igraph_random_spanning_tree() to compute a random spanning tree + instead of a minimum one.

@@ -17151,16 +16939,18 @@

Warning

-

Example 13.32.  File examples/simple/igraph_minimum_spanning_tree.c

+

Example 13.31.  File examples/simple/igraph_minimum_spanning_tree.c

#include <igraph.h>
 
 int main(void) {
-
-    igraph_t graph, tree;
+    igraph_t graph;
     igraph_vector_t eb;
     igraph_vector_int_t edges;
 
+    /* Create the vector where the tree edges will be stored. */
+    igraph_vector_int_init(&edges, 0);
+
     /* Create the Frucht graph */
     igraph_famous(&graph, "Frucht");
 
@@ -17168,18 +16958,18 @@ 
Warning

     igraph_vector_init(&eb, igraph_ecount(&graph));
     igraph_edge_betweenness(&graph, &eb, IGRAPH_UNDIRECTED, /*weights=*/ NULL);
 
-    /* Compute and output a minimum weight spanning tree using edge betweenness
-     * values as weights. */
-    igraph_minimum_spanning_tree_prim(&graph, &tree, &eb);
-    printf("Minimum spanning tree:\n");
-    igraph_write_graph_edgelist(&tree, stdout);
+    /* Use Prim's algorithm to compute the edges that belong to the minimum weight
+     * spanning tree, using edge betweenness values as edge weights. */
+    igraph_minimum_spanning_tree(&graph, &edges, &eb, IGRAPH_MST_PRIM);
+    printf("Minimum spanning tree edges:\n");
+    igraph_vector_int_print(&edges);
 
     /* A maximum spanning tree can be computed by first negating the weights. */
     igraph_vector_scale(&eb, -1);
 
-    /* Compute and output the edges that belong to the maximum weight spanning tree. */
-    igraph_vector_int_init(&edges, 0);
-    igraph_minimum_spanning_tree(&graph, &edges, &eb);
+    /* Compute and output the edges that belong to the maximum weight spanning tree,
+     * letting igraph automatically select the most suitable algorithm. */
+    igraph_minimum_spanning_tree(&graph, &edges, &eb, IGRAPH_MST_AUTOMATIC);
     printf("\nMaximum spanning tree edges:\n");
     igraph_vector_int_print(&edges);
 
@@ -17191,10 +16981,9 @@ 
Warning

     printf("\nTotal maximum spanning tree weight: %g\n", total_tree_weight);
 
     /* Clean up */
-    igraph_vector_int_destroy(&edges);
-    igraph_destroy(&tree);
     igraph_destroy(&graph);
     igraph_vector_destroy(&eb);
+    igraph_vector_int_destroy(&edges);
 
     return 0;
 }
@@ -17209,8 +16998,8 @@ 
Warning

-15.4. igraph_random_spanning_tree — Uniformly samples the spanning trees of a graph.

-

+15.2. igraph_random_spanning_tree — Uniformly samples the spanning trees of a graph.

+

 igraph_error_t igraph_random_spanning_tree(const igraph_t *graph, igraph_vector_int_t *res, igraph_integer_t vid);
@@ -17296,7 +17085,7 @@ 
Warning

 
 

 

-  igraph_minimum_spanning_tree(), igraph_random_walk()
+  igraph_minimum_spanning_tree(), igraph_random_walk()
@@ -17307,8 +17096,8 @@

Warning

-15.5. igraph_is_tree — Decides whether the graph is a tree.

-

+15.3. igraph_is_tree — Decides whether the graph is a tree.

+

 igraph_error_t igraph_is_tree(const igraph_t *graph, igraph_bool_t *res, igraph_integer_t *root, igraph_neimode_t mode);
@@ -17418,7 +17207,7 @@ 
Warning

 

 

 

-
Example 13.33.  File examples/simple/igraph_kary_tree.c

+
Example 13.32.  File examples/simple/igraph_kary_tree.c

 

 
#include <igraph.h>
 
@@ -17430,10 +17219,10 @@ 
Warning

        with edges pointing towards the root. */
     igraph_kary_tree(&graph, 15, 2, IGRAPH_TREE_IN);
 
-    igraph_is_tree(&graph, &res, NULL, IGRAPH_IN);
+    igraph_is_tree(&graph, &res, NULL, IGRAPH_IN);
     printf("Is it an in-tree? %s\n", res ? "Yes" : "No");
 
-    igraph_is_tree(&graph, &res, NULL, IGRAPH_OUT);
+    igraph_is_tree(&graph, &res, NULL, IGRAPH_OUT);
     printf("Is it an out-tree? %s\n", res ? "Yes" : "No");
 
     igraph_destroy(&graph);
@@ -17451,8 +17240,8 @@ 
Warning

 

 

 

-15.6. igraph_is_forest —  Decides whether the graph is a forest.

-

+15.4. igraph_is_forest —  Decides whether the graph is a forest.

+

 

 
 igraph_error_t igraph_is_forest(const igraph_t *graph, igraph_bool_t *res,
@@ -17555,8 +17344,8 @@ 
Warning

 

 

 

-15.7. igraph_to_prufer —  Converts a tree to its Prüfer sequence.

-

+15.5. igraph_to_prufer —  Converts a tree to its Prüfer sequence.
+

 igraph_error_t igraph_to_prufer(const igraph_t *graph, igraph_vector_int_t* prufer);
@@ -17789,7 +17578,7 @@ 
Warning

 

 

 

-
Example 13.34.  File examples/simple/igraph_transitivity.c

+
Example 13.33.  File examples/simple/igraph_transitivity.c

 

 
#include <igraph.h>
 
@@ -18562,7 +18351,7 @@ 
Warning

 

 

 

-
Example 13.35.  File examples/simple/igraph_to_undirected.c

+
Example 13.34.  File examples/simple/igraph_to_undirected.c

 

 
#include <igraph.h>
 
@@ -18721,7 +18510,7 @@ 
Warning

 

 

 

-
Example 13.36.  File examples/simple/igraph_get_laplacian.c

+
Example 13.35.  File examples/simple/igraph_get_laplacian.c

 

 
#include <igraph.h>
 
@@ -18845,7 +18634,7 @@ 
Warning

 

 

 

-
Example 13.37.  File examples/simple/igraph_get_laplacian_sparse.c

+
Example 13.36.  File examples/simple/igraph_get_laplacian_sparse.c

 

 
#include <igraph.h>
 
@@ -19006,7 +18795,7 @@ 
Warning

 
 
IGRAPH_LAPLACIAN_SYMMETRIC:

 

-  Symmetric normalized Laplacian, L = I - D^(-1/2) A D^(-1/2).
+  Symmetrically normalized Laplacian, L = I - D^(-1/2) A D^(-1/2).
 

 
 
@@ -19129,7 +18918,7 @@ 
Warning

 

 
 igraph_error_t igraph_is_loop(const igraph_t *graph, igraph_vector_bool_t *res,
-                   igraph_es_t es);
+                              igraph_es_t es);
 

 

 

@@ -19137,7 +18926,7 @@ 
Warning

 
 
 
-A loop edge is an edge from a vertex to itself.
+A loop edge, also called a self-loop, is an edge from a vertex to itself.
 
 

 
Arguments: 
@@ -19207,7 +18996,7 @@ 
Warning

 

 

 

-
Example 13.38.  File examples/simple/igraph_is_loop.c

+
Example 13.37.  File examples/simple/igraph_is_loop.c

 

 
#include <igraph.h>
 
@@ -19325,7 +19114,7 @@ 
Warning

 

 

 

-
Example 13.39.  File examples/simple/igraph_is_loop.c

+
Example 13.38.  File examples/simple/igraph_is_loop.c

 

 
#include <igraph.h>
 
@@ -19387,15 +19176,8 @@ 
Warning

 
 
 
-

-

-
Warning

-
This function is experimental and its signature is not considered final yet.
-We reserve the right to change the function signature without changing the
-major version of igraph. Use it at your own risk.

-

-
Counts loop edges, i.e. edges whose two endpoints coincide.
-
+Counts loop edges, i.e. edges whose two endpoints coincide.
+
 

 
Arguments: 
 

@@ -19441,7 +19223,7 @@ 
Warning

 

 

 

-
Example 13.40.  File examples/simple/igraph_is_loop.c

+
Example 13.39.  File examples/simple/igraph_is_loop.c

 

 
#include <igraph.h>
 
@@ -19496,7 +19278,7 @@ 
Warning

 

 
 igraph_error_t igraph_is_multiple(const igraph_t *graph, igraph_vector_bool_t *res,
-                       igraph_es_t es);
+                                  igraph_es_t es);
 

 

 

@@ -19570,7 +19352,8 @@ 
Warning

 
 

 

-  igraph_count_multiple(), igraph_has_multiple() and igraph_simplify().
+  igraph_count_multiple(), igraph_count_multiple_1(),
+igraph_has_multiple() and igraph_simplify().
   

 
 

@@ -19583,7 +19366,7 @@ 
Warning

 

 

 

-
Example 13.41.  File examples/simple/igraph_is_multiple.c

+
Example 13.40.  File examples/simple/igraph_is_multiple.c

 

 
#include <igraph.h>
 
@@ -19713,7 +19496,7 @@ 
Warning

 

 

 

-
Example 13.42.  File examples/simple/igraph_has_multiple.c

+
Example 13.41.  File examples/simple/igraph_has_multiple.c

 

 
#include <igraph.h>
 
@@ -19792,7 +19575,8 @@ 
Warning

 

 

 
-igraph_error_t igraph_count_multiple(const igraph_t *graph, igraph_vector_int_t *res, igraph_es_t es);
+igraph_error_t igraph_count_multiple(const igraph_t *graph, igraph_vector_int_t *res,
+                                     igraph_es_t es);
 

 

 

@@ -19883,7 +19667,8 @@ 
Warning

 

 

 
-igraph_error_t igraph_count_multiple_1(const igraph_t *graph, igraph_integer_t *res, igraph_integer_t eid);
+igraph_error_t igraph_count_multiple_1(const igraph_t *graph, igraph_integer_t *res,
+                                       igraph_integer_t eid);
 

 

 

@@ -20134,7 +19919,7 @@ 
Warning

 

 

 

-
Example 13.43.  File examples/simple/igraph_assortativity_nominal.c

+
Example 13.42.  File examples/simple/igraph_assortativity_nominal.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -20471,7 +20256,7 @@ 
Warning

 

 

 

-
Example 13.44.  File examples/simple/igraph_assortativity_degree.c

+
Example 13.43.  File examples/simple/igraph_assortativity_degree.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -21421,7 +21206,7 @@ 
Warning

 

 

 

-
Example 13.45.  File examples/simple/igraph_topological_sorting.c

+
Example 13.44.  File examples/simple/igraph_topological_sorting.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -21582,7 +21367,7 @@ 
Warning

 

 

 

-
Example 13.46.  File examples/simple/igraph_feedback_arc_set.c

+
Example 13.45.  File examples/simple/igraph_feedback_arc_set.c

 

 
#include <igraph.h>
 #include <string.h>
@@ -21662,7 +21447,7 @@ 
Warning

 

 

 

-
Example 13.47.  File examples/simple/igraph_feedback_arc_set_ip.c

+
Example 13.46.  File examples/simple/igraph_feedback_arc_set_ip.c

 

 
#include <igraph.h>
 #include <string.h>
@@ -22122,7 +21907,7 @@ 
Warning

 

 

 

-
Example 13.48.  File examples/simple/igraph_maximum_bipartite_matching.c

+
Example 13.47.  File examples/simple/igraph_maximum_bipartite_matching.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -22272,7 +22057,7 @@ 
Warning

 

 

 

-
Example 13.49.  File examples/simple/igraph_maximum_bipartite_matching.c

+
Example 13.48.  File examples/simple/igraph_maximum_bipartite_matching.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -22476,7 +22261,7 @@ 
Warning

 

 

 

-
Example 13.50.  File examples/simple/igraph_maximum_bipartite_matching.c

+
Example 13.49.  File examples/simple/igraph_maximum_bipartite_matching.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -22755,14 +22540,7 @@ 
Warning

 
 
 
-

-

-
Warning

-
This function is experimental and its signature is not considered final yet.
-We reserve the right to change the function signature without changing the
-major version of igraph. Use it at your own risk.

-

-
This is a convenience function that computes the average of all vertex
+This is a convenience function that computes the average of all vertex
 degrees. In directed graphs, the average of out-degrees and in-degrees is
 the same; this is the number that is returned. For the null graph, which
 has no vertices, NaN is returned.
@@ -22924,7 +22702,7 @@ 
Warning

 

 

 

-
Example 13.51.  File examples/simple/igraph_reciprocity.c

+
Example 13.50.  File examples/simple/igraph_reciprocity.c

 

 
#include <igraph.h>
 #include <math.h>
@@ -23078,7 +22856,8 @@ 
Warning

 

 

 
-igraph_error_t igraph_is_mutual(const igraph_t *graph, igraph_vector_bool_t *res, igraph_es_t es, igraph_bool_t loops);
+igraph_error_t igraph_is_mutual(const igraph_t *graph, igraph_vector_bool_t *res,
+                                igraph_es_t es, igraph_bool_t loops);
 

 

 

@@ -23168,7 +22947,8 @@ 
Warning

 

 

 
-igraph_error_t igraph_has_mutual(const igraph_t *graph, igraph_bool_t *res, igraph_bool_t loops);
+igraph_error_t igraph_has_mutual(const igraph_t *graph, igraph_bool_t *res,
+                                 igraph_bool_t loops);
 

 

 

@@ -23416,7 +23196,7 @@ 
Warning

 

 

 

-
Example 13.52.  File examples/simple/igraph_avg_nearest_neighbor_degree.c

+
Example 13.51.  File examples/simple/igraph_avg_nearest_neighbor_degree.c

 

 
#include <igraph.h>
 
@@ -23973,8 +23753,18 @@ 
Warning

 
 
 Stochastic matrix of a graph. The stochastic matrix of a graph is
-its adjacency matrix, normalized row-wise or column-wise, such that
-the sum of each row (or column) is one.
+its adjacency matrix, normalized row-wise (or column-wise), such that
+the sum of each row (or column) is one. The row-wise normalized matrix
+is also called a right-stochastic and containt the transition
+probabilities of a random walk that follows edge directions in a directed
+graph. The column-wise normalized matrix is called left-stochastic and
+is related to random walks moving against edge directions.
+
+

+

+When the out-degree (or in-degree) of a vertex is zero, the corresponding
+row (or column) of the row-wise (or column-wise) normalized stochastic
+matrix will be zero.
 
 

 
Arguments: 
@@ -24001,7 +23791,8 @@ 
Warning

 
 
column_wise:

 

-  Whether to normalize column-wise.
+  If false, row-wise normalization is used.
+                   If true, column-wise normalization is used.
 

 
 
@@ -24023,7 +23814,7 @@ 
Warning

 

 

 
-Time complexity: O(|V||V|), |V| is the number of vertices in the graph.
+Time complexity: O(|V|^2), |V| is the number of vertices in the graph.
 
 

 
See also: 

@@ -24061,9 +23852,8 @@ 
Warning

 
 
 
-Stochastic matrix of a graph. The stochastic matrix of a graph is
-its adjacency matrix, normalized row-wise or column-wise, such that
-the sum of each row (or column) is one.
+Stochastic matrix of a graph in sparse format. See igraph_get_stochastic()
+for the information on stochastic matrices.
 
 

 
Arguments: 
@@ -24090,7 +23880,8 @@ 
Warning

 
 
column_wise:

 

-  Whether to normalize column-wise.
+  If false, row-wise normalization is used.
+                   If true, column-wise normalization is used.
 

 
 
@@ -24281,359 +24072,6 @@ 
Warning

 Time complexity: O(|V|+|E|), where |V| and |E| are the number of
 vertices and edges in the original input graph.
  
-

-

-

-

-

-27. Deprecated functions

-

-
27.1. igraph_are_connected —  Decides whether two vertices are adjacent (deprecated alias).

-
27.2. igraph_get_stochastic_sparsemat —  Stochastic adjacency matrix of a graph (deprecated).

-
27.3. igraph_get_sparsemat —  Converts an igraph graph to a sparse matrix (deprecated).

-
27.4. igraph_laplacian —  Returns the Laplacian matrix of a graph (deprecated).

-

-

-

-27.1. igraph_are_connected —  Decides whether two vertices are adjacent (deprecated alias).

-

-

-
-igraph_error_t igraph_are_connected(const igraph_t *graph,
-                                   igraph_integer_t v1, igraph_integer_t v2,
-                                   igraph_bool_t *res);
-

-

-

-

-
-
-
-
-

-

-
Warning

-
Deprecated since version 0.10.10. Please do not use this function in new
-code; use igraph_are_adjacent()
-instead.

-

-

-Decides whether there are any edges that have v1 and v2
-as endpoints. This function is of course symmetric for undirected
-graphs.
-
-

-
Arguments: 
-

-

----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-




graph:

-  The graph object.
-
v1:

-  The first vertex.
-
v2:

-  The second vertex.
-
res:

-  Boolean, true if there is an edge from
-        v1 to v2, false otherwise.
-

-

-

-
Returns: 

-

----
-
-
-
-
-





-  The error code IGRAPH_EINVVID is returned if an invalid
-        vertex ID is given.
-  

-

-
-Time complexity: O( min(log(d1), log(d2)) ),
-d1 is the (out-)degree of v1 and d2 is the (in-)degree of v2.
- 
-

-

-

-

-27.2. igraph_get_stochastic_sparsemat —  Stochastic adjacency matrix of a graph (deprecated).

-

-

-
-igraph_error_t igraph_get_stochastic_sparsemat(const igraph_t *graph,
-                                               igraph_sparsemat_t *res,
-                                               igraph_bool_t column_wise);
-

-

-

-

-
-
-
-This function is deprecated in favour of igraph_get_stochastic_sparse(),
-but does not work in an identical way. This function takes an uninitialized
-igraph_sparsemat_t while igraph_get_stochastic_sparse() takes
-an already initialized one.
-
-

-
Arguments: 
-

-

----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-




graph:

-  The input graph.
-
res:

-  Pointer to an uninitialized sparse matrix, the
-   result is stored here. The matrix will be resized as needed.
-
column_wise:

-  Whether to normalize column-wise. For undirected
-   graphs this argument does not have any effect.
-

-

-

-
Returns: 

-

----
-
-
-
-
-





-  Error code.
-  

-

-
-

-

-
Warning

-
Deprecated since version 0.10.0. Please do not use this function in new
-code; use igraph_get_stochastic_sparse()
-instead.

-

-
 
-

-

-

-

-27.3. igraph_get_sparsemat —  Converts an igraph graph to a sparse matrix (deprecated).

-

-

-
-igraph_error_t igraph_get_sparsemat(const igraph_t *graph, igraph_sparsemat_t *res);
-

-

-

-

-
-
-
-If the graph is undirected, then a symmetric matrix is created.
-
-

-

-This function is deprecated in favour of igraph_get_adjacency_sparse(),
-but does not work in an identical way. This function takes an uninitialized
-igraph_sparsemat_t while igraph_get_adjacency_sparse() takes
-an already initialized one.
-
-

-
Arguments: 
-

-

----
-
-
-
-
-
-
-
-
-
-
-




graph:

-  The input graph.
-
res:

-  Pointer to an uninitialized sparse matrix. The result
-   will be stored here.
-

-

-

-
Returns: 

-

----
-
-
-
-
-





-  Error code.
-  

-

-
-

-

-
Warning

-
Deprecated since version 0.10.0. Please do not use this function in new
-code; use igraph_get_adjacency_sparse()
-instead.

-

-
 
-

-

-

-

-27.4. igraph_laplacian —  Returns the Laplacian matrix of a graph (deprecated).

-

-

-
-igraph_error_t igraph_laplacian(
-    const igraph_t *graph, igraph_matrix_t *res, igraph_sparsemat_t *sparseres,
-    igraph_bool_t normalized, const igraph_vector_t *weights
-);
-

-

-

-

-
-
-
-This function produces the Laplacian matrix of a graph in either dense or
-sparse format. When normalized is set to true, the type of normalization
-used depends on the directnedness of the graph: symmetric normalization
-is used for undirected graphs and left stochastic normalization for
-directed graphs.
-
-

-
Arguments: 
-

-

----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-




graph:

-  Pointer to the graph to convert.
-
res:

-  Pointer to an initialized matrix object or NULL. The dense matrix
-       result will be stored here.
-
sparseres:

-  Pointer to an initialized sparse matrix object or NULL.
-       The sparse matrix result will be stored here.
-
mode:

-  Controls whether to use out- or in-degrees in directed graphs.
-       If set to IGRAPH_ALL, edge directions will be ignored.
-
normalized:

-  Boolean, whether to normalize the result.
-
weights:

-  An optional vector containing non-negative edge weights,
-       to calculate the weighted Laplacian matrix. Set it to a null pointer to
-       calculate the unweighted Laplacian.
-

-

-

-
Returns: 

-

----
-
-
-
-
-





-  Error code.
-  

-

-
-

-

-
Warning

-
Deprecated since version 0.10.0. Please do not use this function in new
-code; use igraph_get_laplacian()
-instead.

-

-
 
 

 

 

diff --git a/docs/c/html/develop/igraph-Tutorial.html b/docs/c/html/develop/igraph-Tutorial.html
index 130be469b..5d3233528 100644
--- a/docs/c/html/develop/igraph-Tutorial.html
+++ b/docs/c/html/develop/igraph-Tutorial.html
@@ -462,8 +462,8 @@ 
C++ must be enabled in igraph projects

 

 

 The vertices in a graph are identified by a vertex ID, an integer between
-0 and N-1, where N is the number of vertices in the graph. The vertex count can be
-retrieved using igraph_vcount(),
+0 and n - 1, where n is the number of vertices in the graph.
+The vertex count can be retrieved using igraph_vcount(),
 as in the example.
 

 

diff --git a/docs/c/html/develop/igraph-Visitors.html b/docs/c/html/develop/igraph-Visitors.html
index 5a1645d12..c6b2645c7 100644
--- a/docs/c/html/develop/igraph-Visitors.html
+++ b/docs/c/html/develop/igraph-Visitors.html
@@ -153,7 +153,6 @@ 
igraph Reference Manual

 
1. Breadth-first search

 
2. Depth-first search

 
3. Random walks

-
4. Deprecated functions

 

 

 

@@ -1127,130 +1126,6 @@ 
igraph Reference Manual

   where l is the length of the walk, d is the total degree of the visited nodes
   and k is the average degree of vertices of the given graph.
  
-

-

-

-

-

-4. Deprecated functions

-
4.1. igraph_random_edge_walk —  Performs a random walk on a graph and returns the traversed edges.

-

-

-4.1. igraph_random_edge_walk —  Performs a random walk on a graph and returns the traversed edges.

-

-

-
-igraph_error_t igraph_random_edge_walk(
-        const igraph_t *graph,
-        const igraph_vector_t *weights,
-        igraph_vector_int_t *edgewalk,
-        igraph_integer_t start, igraph_neimode_t mode,
-        igraph_integer_t steps,
-        igraph_random_walk_stuck_t stuck);
-

-

-

-

-
-
-
-Performs a random walk with a given length on a graph, from the given
-start vertex. Edge directions are (potentially) considered, depending on
-the mode argument.
-
-

-
Arguments: 
-

-

----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-




graph:

-  The input graph, it can be directed or undirected.
-  Multiple edges are respected, so are loop edges.
-
weights:

-  A vector of non-negative edge weights. It is assumed
-  that at least one strictly positive weight is found among the
-  outgoing edges of each vertex. Additionally, no edge weight may
-  be NaN. If either case does not hold, an error is returned. If it
-  is a NULL pointer, all edges are considered to have equal weight.
-
edgewalk:

-  An initialized vector; the indices of traversed
-  edges are stored here. It will be resized as needed.
-
start:

-  The start vertex for the walk.
-
steps:

-  The number of steps to take. If the random walk gets
-  stuck, then the stuck argument specifies what happens.
-
mode:

-  How to walk along the edges in directed graphs.
-  IGRAPH_OUT means following edge directions, IGRAPH_IN means
-  going opposite the edge directions, IGRAPH_ALL means ignoring
-  edge directions. This argument is ignored for undirected graphs.
-
stuck:

-  What to do if the random walk gets stuck.
-  IGRAPH_RANDOM_WALK_STUCK_RETURN means that the function returns
-  with a shorter walk; IGRAPH_RANDOM_WALK_STUCK_ERROR means
-  that an IGRAPH_ERWSTUCK error is reported. In both cases,
-  edgewalk is truncated to contain the actual interrupted walk.

-

-
-
-

-
Returns: 

-

----
-
-
-
-
-





-  Error code.
-  

-

-
-

-

-
Warning

-
Deprecated since version 0.10.0. Please do not use this function in new
-code; use igraph_random_walk()
-instead.

-

-
 
 

 

 

diff --git a/docs/c/html/develop/index.html b/docs/c/html/develop/index.html
index f85919eea..602ac6784 100644
--- a/docs/c/html/develop/index.html
+++ b/docs/c/html/develop/index.html
@@ -191,9 +191,9 @@ 

 

 

 

-
0.10.12-553-gc894aae3d

+
0.10.13-480-g3ef669bf3

 

-
This manual is for igraph, version 0.10.12-553-gc894aae3d.

+
This manual is for igraph, version 0.10.13-480-g3ef669bf3.

 

       Copyright (C) 2005-2019 Gábor Csárdi and Tamás Nepusz.
       Copyright (C) 2020-2024 igraph development team.
diff --git a/docs/c/html/develop/ix01.html b/docs/c/html/develop/ix01.html
index b5b9945f3..bd285bf20 100644
--- a/docs/c/html/develop/ix01.html
+++ b/docs/c/html/develop/ix01.html
@@ -157,480 +157,478 @@ 
A

 
 
add_vertices, igraph_add_vertices —  Adds vertices to a graph.
 

-
adhesion, igraph_adhesion —  Graph adhesion, this is (almost) the same as edge connectivity.
+
adhesion, igraph_adhesion —  Graph adhesion, this is (almost) the same as edge connectivity.
 

-
adjacency, igraph_adjacency —  Creates a graph from an adjacency matrix.
+
adjacency, igraph_adjacency —  Creates a graph from an adjacency matrix.
 

-
adjacency_spectral_embedding, igraph_adjacency_spectral_embedding — Adjacency spectral embedding
+
adjacency_spectral_embedding, igraph_adjacency_spectral_embedding — Adjacency spectral embedding
 

-
adjacent_triangles, igraph_adjacent_triangles —  Count the number of triangles a vertex is part of.
+
adjacent_triangles, igraph_adjacent_triangles —  Count the number of triangles a vertex is part of.
 

-
adjlist, igraph_adjlist —  Creates a graph from an adjacency list.
+
adjlist, igraph_adjlist —  Creates a graph from an adjacency list.
 

-
adjlist_clear, igraph_adjlist_clear —  Removes all edges from an adjacency list.
+
adjlist_clear, igraph_adjlist_clear —  Removes all edges from an adjacency list.
 

-
adjlist_destroy, igraph_adjlist_destroy —  Deallocates an adjacency list.
+
adjlist_destroy, igraph_adjlist_destroy —  Deallocates an adjacency list.
 

-
adjlist_get, igraph_adjlist_get —  Query a vector in an adjacency list.
+
adjlist_get, igraph_adjlist_get —  Query a vector in an adjacency list.
 

-
adjlist_init, igraph_adjlist_init —  Constructs an adjacency list of vertices from a given graph.
+
adjlist_init, igraph_adjlist_init —  Constructs an adjacency list of vertices from a given graph.
 

-
adjlist_init_complementer, igraph_adjlist_init_complementer —  Adjacency lists for the complementer graph.
+
adjlist_init_complementer, igraph_adjlist_init_complementer —  Adjacency lists for the complementer graph.
 

-
adjlist_init_empty, igraph_adjlist_init_empty —  Initializes an empty adjacency list.
+
adjlist_init_empty, igraph_adjlist_init_empty —  Initializes an empty adjacency list.
 

-
adjlist_init_from_inclist, igraph_adjlist_init_from_inclist —  Constructs an adjacency list of vertices from an incidence list.
+
adjlist_init_from_inclist, igraph_adjlist_init_from_inclist —  Constructs an adjacency list of vertices from an incidence list.
 

-
adjlist_simplify, igraph_adjlist_simplify —  Simplifies an adjacency list.
+
adjlist_simplify, igraph_adjlist_simplify —  Simplifies an adjacency list.
 

-
adjlist_size, igraph_adjlist_size —  Returns the number of vertices in an adjacency list.
+
adjlist_size, igraph_adjlist_size —  Returns the number of vertices in an adjacency list.
 

-
adjlist_sort, igraph_adjlist_sort —  Sorts each vector in an adjacency list.
+
adjlist_sort, igraph_adjlist_sort —  Sorts each vector in an adjacency list.
 

-
all_minimal_st_separators, igraph_all_minimal_st_separators —  List all vertex sets that are minimal (s,t) separators for some s and t.
+
all_minimal_st_separators, igraph_all_minimal_st_separators —  List all vertex sets that are minimal (s,t) separators for some s and t.
 

-
all_st_cuts, igraph_all_st_cuts — List all edge-cuts between two vertices in a directed graph
+
all_st_cuts, igraph_all_st_cuts — List all edge-cuts between two vertices in a directed graph
 

-
all_st_mincuts, igraph_all_st_mincuts —  All minimum s-t cuts of a directed graph.
+
all_st_mincuts, igraph_all_st_mincuts —  All minimum s-t cuts of a directed graph.
 

-
almost_equals, igraph_almost_equals —  Compare two double-precision floats with a tolerance.
+
almost_equals, igraph_almost_equals —  Compare two double-precision floats with a tolerance.
 

-
are_adjacent, igraph_are_adjacent —  Decides whether two vertices are adjacent.
+
are_adjacent, igraph_are_adjacent —  Decides whether two vertices are adjacent.
 

-
are_connected, igraph_are_connected —  Decides whether two vertices are adjacent (deprecated alias).
+
arpack_function_t, igraph_arpack_function_t —  Type of the ARPACK callback function.
 

-
arpack_function_t, igraph_arpack_function_t —  Type of the ARPACK callback function.
+
arpack_options_init, igraph_arpack_options_init —  Initialize ARPACK options.
 

-
arpack_options_init, igraph_arpack_options_init —  Initialize ARPACK options.
+
arpack_options_t, igraph_arpack_options_t —  Options for ARPACK.
 

-
arpack_options_t, igraph_arpack_options_t —  Options for ARPACK.
+
arpack_rnsolve, igraph_arpack_rnsolve —  ARPACK solver for non-symmetric matrices.
 

-
arpack_rnsolve, igraph_arpack_rnsolve —  ARPACK solver for non-symmetric matrices.
+
arpack_rssolve, igraph_arpack_rssolve —  ARPACK solver for symmetric matrices.
 

-
arpack_rssolve, igraph_arpack_rssolve —  ARPACK solver for symmetric matrices.
+
arpack_storage_destroy, igraph_arpack_storage_destroy —  Deallocate ARPACK storage.
 

-
arpack_storage_destroy, igraph_arpack_storage_destroy —  Deallocate ARPACK storage.
+
arpack_storage_init, igraph_arpack_storage_init —  Initialize ARPACK storage.
 

-
arpack_storage_init, igraph_arpack_storage_init —  Initialize ARPACK storage.
+
arpack_storage_t, igraph_arpack_storage_t —  Storage for ARPACK.
 

-
arpack_storage_t, igraph_arpack_storage_t —  Storage for ARPACK.
+
arpack_unpack_complex, igraph_arpack_unpack_complex —  Makes the result of the non-symmetric ARPACK solver more readable.
 

-
arpack_unpack_complex, igraph_arpack_unpack_complex —  Makes the result of the non-symmetric ARPACK solver more readable.
-

-
articulation_points, igraph_articulation_points —  Finds the articulation points in a graph.
+
articulation_points, igraph_articulation_points —  Finds the articulation points in a graph.
 

 
ASSERT, IGRAPH_ASSERT —  igraph-specific replacement for assert().
 

-
assortativity, igraph_assortativity —  Assortativity based on numeric properties of vertices.
+
assortativity, igraph_assortativity —  Assortativity based on numeric properties of vertices.
 

-
assortativity_degree, igraph_assortativity_degree —  Assortativity of a graph based on vertex degree.
+
assortativity_degree, igraph_assortativity_degree —  Assortativity of a graph based on vertex degree.
 

-
assortativity_nominal, igraph_assortativity_nominal —  Assortativity of a graph based on vertex categories.
+
assortativity_nominal, igraph_assortativity_nominal —  Assortativity of a graph based on vertex categories.
 

-
astar_heuristic_func_t, igraph_astar_heuristic_func_t —  Distance estimator for A* algorithm.
+
astar_heuristic_func_t, igraph_astar_heuristic_func_t —  Distance estimator for A* algorithm.
 

-
asymmetric_preference_game, igraph_asymmetric_preference_game —  Generates a graph with asymmetric vertex types and connection preferences.
+
asymmetric_preference_game, igraph_asymmetric_preference_game —  Generates a graph with asymmetric vertex types and connection preferences.
 

-
atlas, igraph_atlas —  Create a small graph from the “Graph Atlas”.
+
atlas, igraph_atlas —  Create a small graph from the “Graph Atlas”.
 

-
attribute_combination, igraph_attribute_combination —  Initialize attribute combination list and add records.
+
attribute_combination, igraph_attribute_combination —  Initialize attribute combination list and add records.
 

-
attribute_combination_add, igraph_attribute_combination_add —  Add combination record to attribute combination list.
+
attribute_combination_add, igraph_attribute_combination_add —  Add combination record to attribute combination list.
 

-
attribute_combination_destroy, igraph_attribute_combination_destroy —  Destroy attribute combination list.
+
attribute_combination_destroy, igraph_attribute_combination_destroy —  Destroy attribute combination list.
 

-
attribute_combination_init, igraph_attribute_combination_init —  Initialize attribute combination list.
+
attribute_combination_init, igraph_attribute_combination_init —  Initialize attribute combination list.
 

-
attribute_combination_remove, igraph_attribute_combination_remove —  Remove a record from an attribute combination list.
+
attribute_combination_remove, igraph_attribute_combination_remove —  Remove a record from an attribute combination list.
 

-
attribute_combination_type_t, igraph_attribute_combination_type_t — The possible types of attribute combinations.
+
attribute_combination_type_t, igraph_attribute_combination_type_t — The possible types of attribute combinations.
 

-
attribute_elemtype_t, igraph_attribute_elemtype_t —  Types of objects to which attributes can be attached.
+
attribute_elemtype_t, igraph_attribute_elemtype_t —  Types of objects to which attributes can be attached.
 

-
attribute_record_destroy, igraph_attribute_record_destroy —  Destroys an attribute record.
+
attribute_record_destroy, igraph_attribute_record_destroy —  Destroys an attribute record.
 

-
attribute_record_init, igraph_attribute_record_init —  Initializes an attribute record with a given name and type.
+
attribute_record_init, igraph_attribute_record_init —  Initializes an attribute record with a given name and type.
 

-
attribute_record_init_copy, igraph_attribute_record_init_copy —  Initializes an attribute record by copying another record.
+
attribute_record_init_copy, igraph_attribute_record_init_copy —  Initializes an attribute record by copying another record.
 

-
attribute_record_resize, igraph_attribute_record_resize —  Resizes the value vector in an attribute record.
+
attribute_record_resize, igraph_attribute_record_resize —  Resizes the value vector in an attribute record.
 

-
attribute_record_set_default_boolean, igraph_attribute_record_set_default_boolean —  Sets the default value of the attribute to the given logical value.
+
attribute_record_set_default_boolean, igraph_attribute_record_set_default_boolean —  Sets the default value of the attribute to the given logical value.
 

-
attribute_record_set_default_numeric, igraph_attribute_record_set_default_numeric —  Sets the default value of the attribute to the given number.
+
attribute_record_set_default_numeric, igraph_attribute_record_set_default_numeric —  Sets the default value of the attribute to the given number.
 

-
attribute_record_set_default_string, igraph_attribute_record_set_default_string —  Sets the default value of the attribute to the given string.
+
attribute_record_set_default_string, igraph_attribute_record_set_default_string —  Sets the default value of the attribute to the given string.
 

-
attribute_record_set_name, igraph_attribute_record_set_name —  Sets the attribute name in an attribute record.
+
attribute_record_set_name, igraph_attribute_record_set_name —  Sets the attribute name in an attribute record.
 

-
attribute_record_set_type, igraph_attribute_record_set_type —  Sets the type of an attribute record.
+
attribute_record_set_type, igraph_attribute_record_set_type —  Sets the type of an attribute record.
 

-
attribute_record_size, igraph_attribute_record_size —  Returns the size of the value vector in an attribute record.
+
attribute_record_size, igraph_attribute_record_size —  Returns the size of the value vector in an attribute record.
 

-
attribute_record_t, igraph_attribute_record_t —  An attribute record holding the name, type and values of an attribute.
+
attribute_record_t, igraph_attribute_record_t —  An attribute record holding the name, type and values of an attribute.
 

-
attribute_table_t, igraph_attribute_table_t —  Table of functions to perform operations on attributes.
+
attribute_table_t, igraph_attribute_table_t —  Table of functions to perform operations on attributes.
 

-
attribute_type_t, igraph_attribute_type_t —  The possible types of the attributes.
+
attribute_type_t, igraph_attribute_type_t —  The possible types of the attributes.
 

-
automorphism_group, igraph_automorphism_group —  Automorphism group generators of a graph.
+
automorphism_group, igraph_automorphism_group —  Automorphism group generators of a graph.
 

-
automorphism_group_bliss, igraph_automorphism_group_bliss —  Automorphism group generators using Bliss.
+
automorphism_group_bliss, igraph_automorphism_group_bliss —  Automorphism group generators using Bliss.
 

-
average_local_efficiency, igraph_average_local_efficiency —  Calculates the average local efficiency in a network.
+
average_local_efficiency, igraph_average_local_efficiency —  Calculates the average local efficiency in a network.
 

-
average_path_length, igraph_average_path_length —  Calculates the average unweighted shortest path length between all vertex pairs.
+
average_path_length, igraph_average_path_length —  Calculates the average unweighted shortest path length between all vertex pairs.
 

-
average_path_length_dijkstra, igraph_average_path_length_dijkstra —  Calculates the average weighted shortest path length between all vertex pairs.
+
average_path_length_dijkstra, igraph_average_path_length_dijkstra —  Calculates the average weighted shortest path length between all vertex pairs.
 

-
avg_nearest_neighbor_degree, igraph_avg_nearest_neighbor_degree —  Average neighbor degree.
+
avg_nearest_neighbor_degree, igraph_avg_nearest_neighbor_degree —  Average neighbor degree.
 

 
 

 

 
B

 

-
barabasi_aging_game, igraph_barabasi_aging_game —  Preferential attachment with aging of vertices.
+
barabasi_aging_game, igraph_barabasi_aging_game —  Preferential attachment with aging of vertices.
 

-
barabasi_game, igraph_barabasi_game —  Generates a graph based on the Barabási-Albert model.
+
barabasi_game, igraph_barabasi_game —  Generates a graph based on the Barabási-Albert model.
 

-
betweenness, igraph_betweenness —  Betweenness centrality of some vertices.
+
betweenness, igraph_betweenness —  Betweenness centrality of some vertices.
 

-
betweenness_cutoff, igraph_betweenness_cutoff —  Range-limited betweenness centrality.
+
betweenness_cutoff, igraph_betweenness_cutoff —  Range-limited betweenness centrality.
 

-
betweenness_subset, igraph_betweenness_subset —  Betweenness centrality for a subset of source and target vertices.
+
betweenness_subset, igraph_betweenness_subset —  Betweenness centrality for a subset of source and target vertices.
 

-
bfs, igraph_bfs —  Breadth-first search.
+
bfs, igraph_bfs —  Breadth-first search.
 

-
bfshandler_t, igraph_bfshandler_t —  Callback type for BFS function.
+
bfshandler_t, igraph_bfshandler_t —  Callback type for BFS function.
 

-
bfs_simple, igraph_bfs_simple — Breadth-first search, single-source version
+
bfs_simple, igraph_bfs_simple — Breadth-first search, single-source version
 

-
biadjacency, igraph_biadjacency —  Creates a bipartite graph from a bipartite adjacency matrix.
+
biadjacency, igraph_biadjacency —  Creates a bipartite graph from a bipartite adjacency matrix.
 

-
bibcoupling, igraph_bibcoupling —  Bibliographic coupling.
+
bibcoupling, igraph_bibcoupling —  Bibliographic coupling.
 

-
biconnected_components, igraph_biconnected_components —  Calculates biconnected components.
+
biconnected_components, igraph_biconnected_components —  Calculates biconnected components.
 

-
bipartite_game_gnm, igraph_bipartite_game_gnm —  Generate a random bipartite graph with a fixed number of edges.
+
bipartite_game_gnm, igraph_bipartite_game_gnm —  Generate a random bipartite graph with a fixed number of edges.
 

-
bipartite_game_gnp, igraph_bipartite_game_gnp —  Generates a random bipartite graph with a fixed connection probability.
+
bipartite_game_gnp, igraph_bipartite_game_gnp —  Generates a random bipartite graph with a fixed connection probability.
 

-
bipartite_projection, igraph_bipartite_projection —  Create one or both projections of a bipartite (two-mode) network.
+
bipartite_projection, igraph_bipartite_projection —  Create one or both projections of a bipartite (two-mode) network.
 

-
bipartite_projection_size, igraph_bipartite_projection_size —  Calculate the number of vertices and edges in the bipartite projections.
+
bipartite_projection_size, igraph_bipartite_projection_size —  Calculate the number of vertices and edges in the bipartite projections.
 

-
bitset_and, igraph_bitset_and —  Bitwise AND of two bitsets.
+
bitset_and, igraph_bitset_and —  Bitwise AND of two bitsets.
 

-
bitset_capacity, igraph_bitset_capacity —  Returns the allocated capacity of the bitset.
+
bitset_capacity, igraph_bitset_capacity —  Returns the allocated capacity of the bitset.
 

-
bitset_countl_one, igraph_bitset_countl_one —  The number of leading ones in the bitset.
+
bitset_countl_one, igraph_bitset_countl_one —  The number of leading ones in the bitset.
 

-
bitset_countl_zero, igraph_bitset_countl_zero —  The number of leading zeros in the bitset.
+
bitset_countl_zero, igraph_bitset_countl_zero —  The number of leading zeros in the bitset.
 

-
bitset_countr_one, igraph_bitset_countr_one —  The number of trailing ones in the bitset.
+
bitset_countr_one, igraph_bitset_countr_one —  The number of trailing ones in the bitset.
 

-
bitset_countr_zero, igraph_bitset_countr_zero —  The number of trailing zeros in the bitset.
+
bitset_countr_zero, igraph_bitset_countr_zero —  The number of trailing zeros in the bitset.
 

-
bitset_destroy, igraph_bitset_destroy —  Destroys a bitset object.
+
bitset_destroy, igraph_bitset_destroy —  Destroys a bitset object.
 

-
bitset_fill, igraph_bitset_fill —  Fills a bitset with a constant value.
+
bitset_fill, igraph_bitset_fill —  Fills a bitset with a constant value.
 

-
bitset_init, igraph_bitset_init —  Initializes a bitset object (constructor).
+
bitset_init, igraph_bitset_init —  Initializes a bitset object (constructor).
 

-
bitset_init_copy, igraph_bitset_init_copy —  Initializes a bitset from another bitset object (constructor).
+
bitset_init_copy, igraph_bitset_init_copy —  Initializes a bitset from another bitset object (constructor).
 

-
bitset_is_all_one, igraph_bitset_is_all_one —  Are all bits ones?
+
bitset_is_all_one, igraph_bitset_is_all_one —  Are all bits ones?
 

-
bitset_is_all_zero, igraph_bitset_is_all_zero —  Are all bits zeros?
+
bitset_is_all_zero, igraph_bitset_is_all_zero —  Are all bits zeros?
 

-
bitset_is_any_one, igraph_bitset_is_any_one —  Are any bits ones?
+
bitset_is_any_one, igraph_bitset_is_any_one —  Are any bits ones?
 

-
bitset_is_any_zero, igraph_bitset_is_any_zero —  Are any bits zeros?
+
bitset_is_any_zero, igraph_bitset_is_any_zero —  Are any bits zeros?
 

-
bitset_not, igraph_bitset_not —  Bitwise negation of a bitset.
+
bitset_not, igraph_bitset_not —  Bitwise negation of a bitset.
 

-
bitset_null, igraph_bitset_null —  Clears all bits in a bitset.
+
bitset_null, igraph_bitset_null —  Clears all bits in a bitset.
 

-
bitset_or, igraph_bitset_or —  Bitwise OR of two bitsets.
+
bitset_or, igraph_bitset_or —  Bitwise OR of two bitsets.
 

-
bitset_popcount, igraph_bitset_popcount —  The population count of the bitset.
+
bitset_popcount, igraph_bitset_popcount —  The population count of the bitset.
 

-
bitset_reserve, igraph_bitset_reserve —  Reserves memory for a bitset.
+
bitset_reserve, igraph_bitset_reserve —  Reserves memory for a bitset.
 

-
bitset_resize, igraph_bitset_resize —  Resizes the bitset.
+
bitset_resize, igraph_bitset_resize —  Resizes the bitset.
 

-
bitset_size, igraph_bitset_size —  Returns the length of the bitset.
+
bitset_size, igraph_bitset_size —  Returns the length of the bitset.
 

-
bitset_xor, igraph_bitset_xor —  Bitwise XOR of two bitsets.
+
bitset_xor, igraph_bitset_xor —  Bitwise XOR of two bitsets.
 

-
BIT_CLEAR, IGRAPH_BIT_CLEAR —  Sets a specific bit in a bitset to 0 without altering other bits.
+
BIT_CLEAR, IGRAPH_BIT_CLEAR —  Sets a specific bit in a bitset to 0 without altering other bits.
 

-
BIT_MASK, IGRAPH_BIT_MASK —  Computes mask used to access a specific bit of an integer.
+
BIT_MASK, IGRAPH_BIT_MASK —  Computes mask used to access a specific bit of an integer.
 

-
BIT_NSLOTS, IGRAPH_BIT_NSLOTS —  Computes the number of slots required to store a specified number of bits.
+
BIT_NSLOTS, IGRAPH_BIT_NSLOTS —  Computes the number of slots required to store a specified number of bits.
 

-
BIT_SET, IGRAPH_BIT_SET —  Sets a specific bit in a bitset to 1 without altering other bits.
+
BIT_SET, IGRAPH_BIT_SET —  Sets a specific bit in a bitset to 1 without altering other bits.
 

-
BIT_SLOT, IGRAPH_BIT_SLOT —  Computes index used to access a specific slot of a bitset.
+
BIT_SLOT, IGRAPH_BIT_SLOT —  Computes index used to access a specific slot of a bitset.
 

-
BIT_TEST, IGRAPH_BIT_TEST —  Tests whether a bit is set in a bitset.
+
BIT_TEST, IGRAPH_BIT_TEST —  Tests whether a bit is set in a bitset.
 

-
blas_ddot, igraph_blas_ddot —  Dot product of two vectors.
+
blas_ddot, igraph_blas_ddot —  Dot product of two vectors.
 

-
blas_dgemm, igraph_blas_dgemm —  Matrix-matrix multiplication using BLAS.
+
blas_dgemm, igraph_blas_dgemm —  Matrix-matrix multiplication using BLAS.
 

-
blas_dgemv, igraph_blas_dgemv —  Matrix-vector multiplication using BLAS, vector version.
+
blas_dgemv, igraph_blas_dgemv —  Matrix-vector multiplication using BLAS, vector version.
 

-
blas_dgemv_array, igraph_blas_dgemv_array —  Matrix-vector multiplication using BLAS, array version.
+
blas_dgemv_array, igraph_blas_dgemv_array —  Matrix-vector multiplication using BLAS, array version.
 

-
blas_dnrm2, igraph_blas_dnrm2 —  Euclidean norm of a vector.
+
blas_dnrm2, igraph_blas_dnrm2 —  Euclidean norm of a vector.
 

-
bliss_info_t, igraph_bliss_info_t —  Information about a Bliss run.
+
bliss_info_t, igraph_bliss_info_t —  Information about a Bliss run.
 

-
bliss_sh_t, igraph_bliss_sh_t —  Splitting heuristics for Bliss.
+
bliss_sh_t, igraph_bliss_sh_t —  Splitting heuristics for Bliss.
 

-
bridges, igraph_bridges —  Finds all bridges in a graph.
+
bridges, igraph_bridges —  Finds all bridges in a graph.
 

 

 

 

 
C

 

-
callaway_traits_game, igraph_callaway_traits_game —  Simulates a growing network with vertex types.
+
callaway_traits_game, igraph_callaway_traits_game —  Simulates a growing network with vertex types.
 

 
calloc, igraph_calloc —  Allocate memory that can be safely deallocated by igraph functions.
 

-
canonical_permutation, igraph_canonical_permutation —  Canonical permutation of a graph.
+
canonical_permutation, igraph_canonical_permutation —  Canonical permutation of a graph.
 

-
canonical_permutation_bliss, igraph_canonical_permutation_bliss —  Canonical permutation using Bliss.
+
canonical_permutation_bliss, igraph_canonical_permutation_bliss —  Canonical permutation using Bliss.
 

-
cattribute_EAB, igraph_cattribute_EAB —  Query a boolean edge attribute.
+
cattribute_EAB, igraph_cattribute_EAB —  Query a boolean edge attribute.
 

-
cattribute_EABV, igraph_cattribute_EABV —  Query a boolean edge attribute for many edges.
+
cattribute_EABV, igraph_cattribute_EABV —  Query a boolean edge attribute for many edges.
 

-
cattribute_EAB_set, igraph_cattribute_EAB_set —  Set a boolean edge attribute.
+
cattribute_EAB_set, igraph_cattribute_EAB_set —  Set a boolean edge attribute.
 

-
cattribute_EAB_setv, igraph_cattribute_EAB_setv —  Set a boolean edge attribute for all edges.
+
cattribute_EAB_setv, igraph_cattribute_EAB_setv —  Set a boolean edge attribute for all edges.
 

-
cattribute_EAN, igraph_cattribute_EAN —  Query a numeric edge attribute.
+
cattribute_EAN, igraph_cattribute_EAN —  Query a numeric edge attribute.
 

-
cattribute_EANV, igraph_cattribute_EANV —  Query a numeric edge attribute for many edges.
+
cattribute_EANV, igraph_cattribute_EANV —  Query a numeric edge attribute for many edges.
 

-
cattribute_EAN_set, igraph_cattribute_EAN_set —  Set a numeric edge attribute.
+
cattribute_EAN_set, igraph_cattribute_EAN_set —  Set a numeric edge attribute.
 

-
cattribute_EAN_setv, igraph_cattribute_EAN_setv —  Set a numeric edge attribute for all edges.
+
cattribute_EAN_setv, igraph_cattribute_EAN_setv —  Set a numeric edge attribute for all edges.
 

-
cattribute_EAS, igraph_cattribute_EAS —  Query a string edge attribute.
+
cattribute_EAS, igraph_cattribute_EAS —  Query a string edge attribute.
 

-
cattribute_EASV, igraph_cattribute_EASV —  Query a string edge attribute for many edges.
+
cattribute_EASV, igraph_cattribute_EASV —  Query a string edge attribute for many edges.
 

-
cattribute_EAS_set, igraph_cattribute_EAS_set —  Set a string edge attribute.
+
cattribute_EAS_set, igraph_cattribute_EAS_set —  Set a string edge attribute.
 

-
cattribute_EAS_setv, igraph_cattribute_EAS_setv —  Set a string edge attribute for all edges.
+
cattribute_EAS_setv, igraph_cattribute_EAS_setv —  Set a string edge attribute for all edges.
 

-
cattribute_GAB, igraph_cattribute_GAB —  Query a boolean graph attribute.
+
cattribute_GAB, igraph_cattribute_GAB —  Query a boolean graph attribute.
 

-
cattribute_GAB_set, igraph_cattribute_GAB_set —  Set a boolean graph attribute.
+
cattribute_GAB_set, igraph_cattribute_GAB_set —  Set a boolean graph attribute.
 

-
cattribute_GAN, igraph_cattribute_GAN —  Query a numeric graph attribute.
+
cattribute_GAN, igraph_cattribute_GAN —  Query a numeric graph attribute.
 

-
cattribute_GAN_set, igraph_cattribute_GAN_set —  Set a numeric graph attribute.
+
cattribute_GAN_set, igraph_cattribute_GAN_set —  Set a numeric graph attribute.
 

-
cattribute_GAS, igraph_cattribute_GAS —  Query a string graph attribute.
+
cattribute_GAS, igraph_cattribute_GAS —  Query a string graph attribute.
 

-
cattribute_GAS_set, igraph_cattribute_GAS_set —  Set a string graph attribute.
+
cattribute_GAS_set, igraph_cattribute_GAS_set —  Set a string graph attribute.
 

-
cattribute_has_attr, igraph_cattribute_has_attr —  Checks whether a (graph, vertex or edge) attribute exists.
+
cattribute_has_attr, igraph_cattribute_has_attr —  Checks whether a (graph, vertex or edge) attribute exists.
 

-
cattribute_list, igraph_cattribute_list —  List all attributes.
+
cattribute_list, igraph_cattribute_list —  List all attributes.
 

-
cattribute_remove_all, igraph_cattribute_remove_all —  Remove all graph/vertex/edge attributes.
+
cattribute_remove_all, igraph_cattribute_remove_all —  Remove all graph/vertex/edge attributes.
 

-
cattribute_remove_e, igraph_cattribute_remove_e —  Remove an edge attribute.
+
cattribute_remove_e, igraph_cattribute_remove_e —  Remove an edge attribute.
 

-
cattribute_remove_g, igraph_cattribute_remove_g —  Remove a graph attribute.
+
cattribute_remove_g, igraph_cattribute_remove_g —  Remove a graph attribute.
 

-
cattribute_remove_v, igraph_cattribute_remove_v —  Remove a vertex attribute.
+
cattribute_remove_v, igraph_cattribute_remove_v —  Remove a vertex attribute.
 

-
cattribute_VAB, igraph_cattribute_VAB —  Query a boolean vertex attribute.
+
cattribute_VAB, igraph_cattribute_VAB —  Query a boolean vertex attribute.
 

-
cattribute_VABV, igraph_cattribute_VABV —  Query a boolean vertex attribute for many vertices.
+
cattribute_VABV, igraph_cattribute_VABV —  Query a boolean vertex attribute for many vertices.
 

-
cattribute_VAB_set, igraph_cattribute_VAB_set —  Set a boolean vertex attribute.
+
cattribute_VAB_set, igraph_cattribute_VAB_set —  Set a boolean vertex attribute.
 

-
cattribute_VAB_setv, igraph_cattribute_VAB_setv —  Set a boolean vertex attribute for all vertices.
+
cattribute_VAB_setv, igraph_cattribute_VAB_setv —  Set a boolean vertex attribute for all vertices.
 

-
cattribute_VAN, igraph_cattribute_VAN —  Query a numeric vertex attribute.
+
cattribute_VAN, igraph_cattribute_VAN —  Query a numeric vertex attribute.
 

-
cattribute_VANV, igraph_cattribute_VANV —  Query a numeric vertex attribute for many vertices.
+
cattribute_VANV, igraph_cattribute_VANV —  Query a numeric vertex attribute for many vertices.
 

-
cattribute_VAN_set, igraph_cattribute_VAN_set —  Set a numeric vertex attribute.
+
cattribute_VAN_set, igraph_cattribute_VAN_set —  Set a numeric vertex attribute.
 

-
cattribute_VAN_setv, igraph_cattribute_VAN_setv —  Set a numeric vertex attribute for all vertices.
+
cattribute_VAN_setv, igraph_cattribute_VAN_setv —  Set a numeric vertex attribute for all vertices.
 

-
cattribute_VAS, igraph_cattribute_VAS —  Query a string vertex attribute.
+
cattribute_VAS, igraph_cattribute_VAS —  Query a string vertex attribute.
 

-
cattribute_VASV, igraph_cattribute_VASV —  Query a string vertex attribute for many vertices.
+
cattribute_VASV, igraph_cattribute_VASV —  Query a string vertex attribute for many vertices.
 

-
cattribute_VAS_set, igraph_cattribute_VAS_set —  Set a string vertex attribute.
+
cattribute_VAS_set, igraph_cattribute_VAS_set —  Set a string vertex attribute.
 

-
cattribute_VAS_setv, igraph_cattribute_VAS_setv —  Set a string vertex attribute for all vertices.
+
cattribute_VAS_setv, igraph_cattribute_VAS_setv —  Set a string vertex attribute for all vertices.
 

-
centralization, igraph_centralization —  Calculate the centralization score from the node level scores.
+
centralization, igraph_centralization —  Calculate the centralization score from the node level scores.
 

-
centralization_betweenness, igraph_centralization_betweenness —  Calculate vertex betweenness and graph centralization.
+
centralization_betweenness, igraph_centralization_betweenness —  Calculate vertex betweenness and graph centralization.
 

-
centralization_betweenness_tmax, igraph_centralization_betweenness_tmax —  Theoretical maximum for graph centralization based on betweenness.
+
centralization_betweenness_tmax, igraph_centralization_betweenness_tmax —  Theoretical maximum for graph centralization based on betweenness.
 

-
centralization_closeness, igraph_centralization_closeness —  Calculate vertex closeness and graph centralization.
+
centralization_closeness, igraph_centralization_closeness —  Calculate vertex closeness and graph centralization.
 

-
centralization_closeness_tmax, igraph_centralization_closeness_tmax —  Theoretical maximum for graph centralization based on closeness.
+
centralization_closeness_tmax, igraph_centralization_closeness_tmax —  Theoretical maximum for graph centralization based on closeness.
 

-
centralization_degree, igraph_centralization_degree —  Calculate vertex degree and graph centralization.
+
centralization_degree, igraph_centralization_degree —  Calculate vertex degree and graph centralization.
 

-
centralization_degree_tmax, igraph_centralization_degree_tmax —  Theoretical maximum for graph centralization based on degree.
+
centralization_degree_tmax, igraph_centralization_degree_tmax —  Theoretical maximum for graph centralization based on degree.
 

-
centralization_eigenvector_centrality, igraph_centralization_eigenvector_centrality —  Calculate eigenvector centrality scores and graph centralization.
+
centralization_eigenvector_centrality, igraph_centralization_eigenvector_centrality —  Calculate eigenvector centrality scores and graph centralization.
 

-
centralization_eigenvector_centrality_tmax, igraph_centralization_eigenvector_centrality_tmax —  Theoretical maximum centralization for eigenvector centrality.
+
centralization_eigenvector_centrality_tmax, igraph_centralization_eigenvector_centrality_tmax —  Theoretical maximum centralization for eigenvector centrality.
 

 
CHECK, IGRAPH_CHECK —  Checks the return value of a function call.
 

 
CHECK_CALLBACK, IGRAPH_CHECK_CALLBACK —  Checks the return value of a callback.
 

-
chung_lu_game, igraph_chung_lu_game —  Samples graphs from the Chung-Lu model.
+
chung_lu_game, igraph_chung_lu_game —  Samples graphs from the Chung-Lu model.
 

-
circulant, igraph_circulant —  Creates a circulant graph.
+
circulant, igraph_circulant —  Creates a circulant graph.
 

-
cited_type_game, igraph_cited_type_game —  Simulates a citation based on vertex types.
+
cited_type_game, igraph_cited_type_game —  Simulates a citation based on vertex types.
 

-
citing_cited_type_game, igraph_citing_cited_type_game —  Simulates a citation network based on vertex types.
+
citing_cited_type_game, igraph_citing_cited_type_game —  Simulates a citation network based on vertex types.
 

-
cliques, igraph_cliques —  Finds all or some cliques in a graph.
+
cliques, igraph_cliques —  Finds all or some cliques in a graph.
 

-
cliques_callback, igraph_cliques_callback —  Calls a function for each clique in the graph.
+
cliques_callback, igraph_cliques_callback —  Calls a function for each clique in the graph.
 

-
clique_handler_t, igraph_clique_handler_t —  Type of clique handler functions.
+
clique_handler_t, igraph_clique_handler_t —  Type of clique handler functions.
 

-
clique_number, igraph_clique_number —  Finds the clique number of the graph.
+
clique_number, igraph_clique_number —  Finds the clique number of the graph.
 

-
clique_size_hist, igraph_clique_size_hist —  Counts cliques of each size in the graph.
+
clique_size_hist, igraph_clique_size_hist —  Counts cliques of each size in the graph.
 

-
closeness, igraph_closeness —  Closeness centrality calculations for some vertices.
+
closeness, igraph_closeness —  Closeness centrality calculations for some vertices.
 

-
closeness_cutoff, igraph_closeness_cutoff —  Range limited closeness centrality.
+
closeness_cutoff, igraph_closeness_cutoff —  Range limited closeness centrality.
 

-
cmp_epsilon, igraph_cmp_epsilon —  Compare two double-precision floats with a tolerance.
+
cmp_epsilon, igraph_cmp_epsilon —  Compare two double-precision floats with a tolerance.
 

-
cocitation, igraph_cocitation —  Cocitation coupling.
+
cocitation, igraph_cocitation —  Cocitation coupling.
 

-
cohesion, igraph_cohesion —  Graph cohesion, this is the same as vertex connectivity.
+
cohesion, igraph_cohesion —  Graph cohesion, this is the same as vertex connectivity.
 

-
cohesive_blocks, igraph_cohesive_blocks —  Identifies the hierarchical cohesive block structure of a graph.
+
cohesive_blocks, igraph_cohesive_blocks —  Identifies the hierarchical cohesive block structure of a graph.
 

-
coloring_greedy_t, igraph_coloring_greedy_t —  Ordering heuristics for greedy graph coloring.
+
coloring_greedy_t, igraph_coloring_greedy_t —  Ordering heuristics for greedy graph coloring.
 

-
community_eb_get_merges, igraph_community_eb_get_merges —  Calculating the merges, i.e. the dendrogram for an edge betweenness community structure.
+
community_eb_get_merges, igraph_community_eb_get_merges —  Calculating the merges, i.e. the dendrogram for an edge betweenness community structure.
 

-
community_edge_betweenness, igraph_community_edge_betweenness —  Community finding based on edge betweenness.
+
community_edge_betweenness, igraph_community_edge_betweenness —  Community finding based on edge betweenness.
 

-
community_fastgreedy, igraph_community_fastgreedy —  Finding community structure by greedy optimization of modularity.
+
community_fastgreedy, igraph_community_fastgreedy —  Finding community structure by greedy optimization of modularity.
 

-
community_fluid_communities, igraph_community_fluid_communities —  Community detection based on fluids interacting on the graph.
+
community_fluid_communities, igraph_community_fluid_communities —  Community detection based on fluids interacting on the graph.
 

-
community_infomap, igraph_community_infomap —  Find community structure that minimizes the expected description length of a random walker trajectory.
+
community_infomap, igraph_community_infomap —  Find community structure that minimizes the expected description length of a random walker trajectory.
 

-
community_label_propagation, igraph_community_label_propagation —  Community detection based on label propagation.
+
community_label_propagation, igraph_community_label_propagation —  Community detection based on label propagation.
 

-
community_leading_eigenvector, igraph_community_leading_eigenvector —  Leading eigenvector community finding (proper version).
+
community_leading_eigenvector, igraph_community_leading_eigenvector —  Leading eigenvector community finding (proper version).
 

-
community_leading_eigenvector_callback_t, igraph_community_leading_eigenvector_callback_t — Callback for the leading eigenvector community finding method.
+
community_leading_eigenvector_callback_t, igraph_community_leading_eigenvector_callback_t — Callback for the leading eigenvector community finding method.
 

-
community_leiden, igraph_community_leiden —  Finding community structure using the Leiden algorithm.
+
community_leiden, igraph_community_leiden —  Finding community structure using the Leiden algorithm.
 

-
community_multilevel, igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity.
+
community_multilevel, igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity (Louvain).
 

-
community_optimal_modularity, igraph_community_optimal_modularity —  Calculate the community structure with the highest modularity value.
+
community_optimal_modularity, igraph_community_optimal_modularity —  Calculate the community structure with the highest modularity value.
 

-
community_spinglass, igraph_community_spinglass —  Community detection based on statistical mechanics.
+
community_spinglass, igraph_community_spinglass —  Community detection based on statistical mechanics.
 

-
community_spinglass_single, igraph_community_spinglass_single —  Community of a single node based on statistical mechanics.
+
community_spinglass_single, igraph_community_spinglass_single —  Community of a single node based on statistical mechanics.
 

-
community_to_membership, igraph_community_to_membership —  Creates a membership vector from a community structure dendrogram.
+
community_to_membership, igraph_community_to_membership —  Creates a membership vector from a community structure dendrogram.
 

-
community_voronoi, igraph_community_voronoi —  Finds communities using Voronoi partitioning.
+
community_voronoi, igraph_community_voronoi —  Finds communities using Voronoi partitioning.
 

-
community_walktrap, igraph_community_walktrap —  Community finding using a random walk based similarity measure.
+
community_walktrap, igraph_community_walktrap —  Community finding using a random walk based similarity measure.
 

-
compare_communities, igraph_compare_communities —  Compares community structures using various metrics.
+
compare_communities, igraph_compare_communities —  Compares community structures using various metrics.
 

-
complementer, igraph_complementer —  Creates the complementer of a graph.
+
complementer, igraph_complementer —  Creates the complementer of a graph.
 

-
complex_almost_equals, igraph_complex_almost_equals —  Compare two complex numbers with a tolerance.
+
complex_almost_equals, igraph_complex_almost_equals —  Compare two complex numbers with a tolerance.
 

-
compose, igraph_compose —  Calculates the composition of two graphs.
+
compose, igraph_compose —  Calculates the composition of two graphs.
 

-
connected_components, igraph_connected_components —  Calculates the (weakly or strongly) connected components in a graph.
+
connected_components, igraph_connected_components —  Calculates the (weakly or strongly) connected components in a graph.
 

-
connect_neighborhood, igraph_connect_neighborhood —  Connects each vertex to its neighborhood.
+
connect_neighborhood, igraph_connect_neighborhood —  Connects each vertex to its neighborhood.
 

-
constraint, igraph_constraint —  Burt's constraint scores.
+
constraint, igraph_constraint —  Burt's constraint scores.
 

-
contract_vertices, igraph_contract_vertices —  Replace multiple vertices with a single one.
+
contract_vertices, igraph_contract_vertices —  Replace multiple vertices with a single one.
 

-
convergence_degree, igraph_convergence_degree —  Calculates the convergence degree of each edge in a graph.
+
convergence_degree, igraph_convergence_degree —  Calculates the convergence degree of each edge in a graph.
 

-
convex_hull, igraph_convex_hull —  Determines the convex hull of a given set of points in the 2D plane.
+
convex_hull, igraph_convex_hull —  Determines the convex hull of a given set of points in the 2D plane.
 

 
copy, igraph_copy —  Creates an exact (deep) copy of a graph.
 

-
coreness, igraph_coreness —  The coreness of the vertices in a graph.
+
coreness, igraph_coreness —  The coreness of the vertices in a graph.
 

-
correlated_game, igraph_correlated_game —  Generates a random graph correlated to an existing graph.
+
correlated_game, igraph_correlated_game —  Generates a random graph correlated to an existing graph.
 

-
correlated_pair_game, igraph_correlated_pair_game —  Generates pairs of correlated random graphs.
+
correlated_pair_game, igraph_correlated_pair_game —  Generates pairs of correlated random graphs.
 

-
count_automorphisms, igraph_count_automorphisms —  Number of automorphisms of a graph.
+
count_automorphisms, igraph_count_automorphisms —  Number of automorphisms of a graph.
 

-
count_automorphisms_bliss, igraph_count_automorphisms_bliss —  Number of automorphisms using Bliss.
+
count_automorphisms_bliss, igraph_count_automorphisms_bliss —  Number of automorphisms using Bliss.
 

-
count_isomorphisms_vf2, igraph_count_isomorphisms_vf2 —  Number of isomorphisms via VF2.
+
count_isomorphisms_vf2, igraph_count_isomorphisms_vf2 —  Number of isomorphisms via VF2.
 

-
count_loops, igraph_count_loops —  Counts the self-loops in the graph.
+
count_loops, igraph_count_loops —  Counts the self-loops in the graph.
 

-
count_multiple, igraph_count_multiple —  The multiplicity of some edges in a graph.
+
count_multiple, igraph_count_multiple —  The multiplicity of some edges in a graph.
 

-
count_multiple_1, igraph_count_multiple_1 —  The multiplicity of a single edge in a graph.
+
count_multiple_1, igraph_count_multiple_1 —  The multiplicity of a single edge in a graph.
 

-
count_reachable, igraph_count_reachable —  The number of vertices reachable from each vertex in the graph.
+
count_reachable, igraph_count_reachable —  The number of vertices reachable from each vertex in the graph.
 

-
count_subisomorphisms_vf2, igraph_count_subisomorphisms_vf2 — Number of subgraph isomorphisms using VF2
+
count_subisomorphisms_vf2, igraph_count_subisomorphisms_vf2 — Number of subgraph isomorphisms using VF2
 

-
create, igraph_create —  Creates a graph with the specified edges.
+
create, igraph_create —  Creates a graph with the specified edges.
 

-
create_bipartite, igraph_create_bipartite —  Create a bipartite graph.
+
create_bipartite, igraph_create_bipartite —  Create a bipartite graph.
 

 

 

 

 
D

 

-
decompose, igraph_decompose —  Decomposes a graph into connected components.
+
decompose, igraph_decompose —  Decomposes a graph into connected components.
 

 
degree, igraph_degree —  The degree of some vertices in a graph.
 

 
degree_1, igraph_degree_1 —  The degree of of a single vertex in the graph.
 

-
degree_correlation_vector, igraph_degree_correlation_vector —  Degree correlation function.
+
degree_correlation_vector, igraph_degree_correlation_vector —  Degree correlation function.
 

-
degree_sequence_game, igraph_degree_sequence_game —  Generates a random graph with a given degree sequence.
+
degree_sequence_game, igraph_degree_sequence_game —  Generates a random graph with a given degree sequence.
 

-
DELALL, DELALL — Remove all attributes.
+
DELALL, DELALL — Remove all attributes.
 

-
DELEA, DELEA — Remove an edge attribute.
+
DELEA, DELEA — Remove an edge attribute.
 

-
DELEAS, DELEAS — Remove all edge attributes.
+
DELEAS, DELEAS — Remove all edge attributes.
 

 
delete_edges, igraph_delete_edges —  Removes edges from a graph.
 

@@ -638,106 +636,106 @@ 
D

 
 
delete_vertices_map, igraph_delete_vertices_map —  Removes some vertices (with all their edges) from the graph.
 

-
DELGA, DELGA — Remove a graph attribute.
+
DELGA, DELGA — Remove a graph attribute.
 

-
DELGAS, DELGAS — Remove all graph attributes.
+
DELGAS, DELGAS — Remove all graph attributes.
 

-
DELVA, DELVA — Remove a vertex attribute.
+
DELVA, DELVA — Remove a vertex attribute.
 

-
DELVAS, DELVAS — Remove all vertex attributes.
+
DELVAS, DELVAS — Remove all vertex attributes.
 

-
density, igraph_density —  Calculate the density of a graph.
+
density, igraph_density —  Calculate the density of a graph.
 

 
destroy, igraph_destroy —  Frees the memory allocated for a graph object.
 

-
deterministic_optimal_imitation, igraph_deterministic_optimal_imitation —  Adopt a strategy via deterministic optimal imitation.
+
deterministic_optimal_imitation, igraph_deterministic_optimal_imitation —  Adopt a strategy via deterministic optimal imitation.
 

-
de_bruijn, igraph_de_bruijn —  Generate a de Bruijn graph.
+
de_bruijn, igraph_de_bruijn —  Generate a de Bruijn graph.
 

-
dfs, igraph_dfs —  Depth-first search.
+
dfs, igraph_dfs —  Depth-first search.
 

-
dfshandler_t, igraph_dfshandler_t —  Callback type for the DFS function.
+
dfshandler_t, igraph_dfshandler_t —  Callback type for the DFS function.
 

-
diameter, igraph_diameter —  Calculates the diameter of a graph (longest geodesic).
+
diameter, igraph_diameter —  Calculates the diameter of a graph (longest geodesic).
 

-
diameter_dijkstra, igraph_diameter_dijkstra —  Calculates the weighted diameter of a graph using Dijkstra's algorithm.
+
diameter_dijkstra, igraph_diameter_dijkstra —  Calculates the weighted diameter of a graph using Dijkstra's algorithm.
 

-
difference, igraph_difference —  Calculates the difference of two graphs.
+
difference, igraph_difference —  Calculates the difference of two graphs.
 

-
dim_select, igraph_dim_select —  Dimensionality selection.
+
dim_select, igraph_dim_select —  Dimensionality selection.
 

-
disjoint_union, igraph_disjoint_union —  Creates the union of two disjoint graphs.
+
disjoint_union, igraph_disjoint_union —  Creates the union of two disjoint graphs.
 

-
disjoint_union_many, igraph_disjoint_union_many —  The disjoint union of many graphs.
+
disjoint_union_many, igraph_disjoint_union_many —  The disjoint union of many graphs.
 

-
distances, igraph_distances —  Length of the shortest paths between vertices.
+
distances, igraph_distances —  Length of the shortest paths between vertices.
 

-
distances_bellman_ford, igraph_distances_bellman_ford —  Weighted shortest path lengths between vertices, allowing negative weights.
+
distances_bellman_ford, igraph_distances_bellman_ford —  Weighted shortest path lengths between vertices, allowing negative weights.
 

-
distances_cutoff, igraph_distances_cutoff —  Length of the shortest paths between vertices, with cutoff.
+
distances_cutoff, igraph_distances_cutoff —  Length of the shortest paths between vertices, with cutoff.
 

-
distances_dijkstra, igraph_distances_dijkstra —  Weighted shortest path lengths between vertices.
+
distances_dijkstra, igraph_distances_dijkstra —  Weighted shortest path lengths between vertices.
 

-
distances_dijkstra_cutoff, igraph_distances_dijkstra_cutoff —  Weighted shortest path lengths between vertices, with cutoff.
+
distances_dijkstra_cutoff, igraph_distances_dijkstra_cutoff —  Weighted shortest path lengths between vertices, with cutoff.
 

-
distances_floyd_warshall, igraph_distances_floyd_warshall —  Weighted all-pairs shortest path lengths with the Floyd-Warshall algorithm.
+
distances_floyd_warshall, igraph_distances_floyd_warshall —  Weighted all-pairs shortest path lengths with the Floyd-Warshall algorithm.
 

-
distances_johnson, igraph_distances_johnson —  Weighted shortest path lengths between vertices, using Johnson's algorithm.
+
distances_johnson, igraph_distances_johnson —  Weighted shortest path lengths between vertices, using Johnson's algorithm.
 

-
diversity, igraph_diversity —  Structural diversity index of the vertices.
+
diversity, igraph_diversity —  Structural diversity index of the vertices.
 

-
dominator_tree, igraph_dominator_tree —  Calculates the dominator tree of a flowgraph.
+
dominator_tree, igraph_dominator_tree —  Calculates the dominator tree of a flowgraph.
 

-
dot_product_game, igraph_dot_product_game —  Generates a random dot product graph.
+
dot_product_game, igraph_dot_product_game —  Generates a random dot product graph.
 

-
dqueue_back, igraph_dqueue_back —  Tail of the queue.
+
dqueue_back, igraph_dqueue_back —  Tail of the queue.
 

-
dqueue_clear, igraph_dqueue_clear —  Remove all elements from the queue.
+
dqueue_clear, igraph_dqueue_clear —  Remove all elements from the queue.
 

-
dqueue_destroy, igraph_dqueue_destroy —  Destroy a double ended queue.
+
dqueue_destroy, igraph_dqueue_destroy —  Destroy a double ended queue.
 

-
dqueue_empty, igraph_dqueue_empty —  Decide whether the queue is empty.
+
dqueue_empty, igraph_dqueue_empty —  Decide whether the queue is empty.
 

-
dqueue_full, igraph_dqueue_full —  Check whether the queue is full.
+
dqueue_full, igraph_dqueue_full —  Check whether the queue is full.
 

-
dqueue_get, igraph_dqueue_get —  Access an element in a queue.
+
dqueue_get, igraph_dqueue_get —  Access an element in a queue.
 

-
dqueue_head, igraph_dqueue_head —  Head of the queue.
+
dqueue_head, igraph_dqueue_head —  Head of the queue.
 

-
dqueue_init, igraph_dqueue_init —  Initialize a double ended queue (deque).
+
dqueue_init, igraph_dqueue_init —  Initialize a double ended queue (deque).
 

-
dqueue_pop, igraph_dqueue_pop —  Remove the head.
+
dqueue_pop, igraph_dqueue_pop —  Remove the head.
 

-
dqueue_pop_back, igraph_dqueue_pop_back —  Removes the tail.
+
dqueue_pop_back, igraph_dqueue_pop_back —  Removes the tail.
 

-
dqueue_push, igraph_dqueue_push —  Appends an element.
+
dqueue_push, igraph_dqueue_push —  Appends an element.
 

-
dqueue_size, igraph_dqueue_size —  Number of elements in the queue.
+
dqueue_size, igraph_dqueue_size —  Number of elements in the queue.
 

-
dyad_census, igraph_dyad_census —  Dyad census, as defined by Holland and Leinhardt.
+
dyad_census, igraph_dyad_census —  Dyad census, as defined by Holland and Leinhardt.
 

 

 

 

 
E

 

-
EAB, EAB — Query a boolean edge attribute.
+
EAB, EAB — Query a boolean edge attribute.
 

-
EABV, EABV — Query a boolean edge attribute for all edges.
+
EABV, EABV — Query a boolean edge attribute for all edges.
 

-
EAN, EAN — Query a numeric edge attribute.
+
EAN, EAN — Query a numeric edge attribute.
 

-
EANV, EANV — Query a numeric edge attribute for all edges.
+
EANV, EANV — Query a numeric edge attribute for all edges.
 

-
EAS, EAS — Query a string edge attribute.
+
EAS, EAS — Query a string edge attribute.
 

-
EASV, EASV — Query a string edge attribute for all edges.
+
EASV, EASV — Query a string edge attribute for all edges.
 

-
ecc, igraph_ecc —  Edge clustering coefficient of some edges.
+
ecc, igraph_ecc —  Edge clustering coefficient of some edges.
 

-
eccentricity, igraph_eccentricity —  Eccentricity of some vertices.
+
eccentricity, igraph_eccentricity —  Eccentricity of some vertices.
 

-
eccentricity_dijkstra, igraph_eccentricity_dijkstra —  Eccentricity of some vertices, using weighted edges.
+
eccentricity_dijkstra, igraph_eccentricity_dijkstra —  Eccentricity of some vertices, using weighted edges.
 

 
ecount, igraph_ecount —  The number of edges in a graph.
 

@@ -747,41 +745,41 @@ 
E

 
 
edges, igraph_edges —  Gives the head and tail vertices of a series of edges.
 

-
edge_betweenness, igraph_edge_betweenness —  Betweenness centrality of the edges.
+
edge_betweenness, igraph_edge_betweenness —  Betweenness centrality of the edges.
 

-
edge_betweenness_cutoff, igraph_edge_betweenness_cutoff —  Range-limited betweenness centrality of the edges.
+
edge_betweenness_cutoff, igraph_edge_betweenness_cutoff —  Range-limited betweenness centrality of the edges.
 

-
edge_betweenness_subset, igraph_edge_betweenness_subset —  Edge betweenness centrality for a subset of source and target vertices.
+
edge_betweenness_subset, igraph_edge_betweenness_subset —  Edge betweenness centrality for a subset of source and target vertices.
 

-
edge_connectivity, igraph_edge_connectivity —  The minimum edge connectivity in a graph.
+
edge_connectivity, igraph_edge_connectivity —  The minimum edge connectivity in a graph.
 

-
edge_disjoint_paths, igraph_edge_disjoint_paths —  The maximum number of edge-disjoint paths between two vertices.
+
edge_disjoint_paths, igraph_edge_disjoint_paths —  The maximum number of edge-disjoint paths between two vertices.
 

-
eigenvector_centrality, igraph_eigenvector_centrality —  Eigenvector centrality of the vertices.
+
eigenvector_centrality, igraph_eigenvector_centrality —  Eigenvector centrality of the vertices.
 

-
eit_create, igraph_eit_create —  Creates an edge iterator from an edge selector.
+
eit_create, igraph_eit_create —  Creates an edge iterator from an edge selector.
 

-
eit_destroy, igraph_eit_destroy —  Destroys an edge iterator.
+
eit_destroy, igraph_eit_destroy —  Destroys an edge iterator.
 

-
EIT_END, IGRAPH_EIT_END —  Are we at the end?
+
EIT_END, IGRAPH_EIT_END —  Are we at the end?
 

-
EIT_GET, IGRAPH_EIT_GET —  Query an edge iterator.
+
EIT_GET, IGRAPH_EIT_GET —  Query an edge iterator.
 

-
EIT_NEXT, IGRAPH_EIT_NEXT —  Next edge.
+
EIT_NEXT, IGRAPH_EIT_NEXT —  Next edge.
 

-
EIT_RESET, IGRAPH_EIT_RESET —  Reset an edge iterator.
+
EIT_RESET, IGRAPH_EIT_RESET —  Reset an edge iterator.
 

-
EIT_SIZE, IGRAPH_EIT_SIZE —  Number of edges in the iterator.
+
EIT_SIZE, IGRAPH_EIT_SIZE —  Number of edges in the iterator.
 

 
empty, igraph_empty —  Creates an empty graph with some vertices and no edges.
 

 
empty_attrs, igraph_empty_attrs —  Creates an empty graph with some vertices, no edges and some graph attributes.
 

-
enter_safelocale, igraph_enter_safelocale —  Temporarily set the C locale.
+
enter_safelocale, igraph_enter_safelocale —  Temporarily set the C locale.
 

-
erdos_renyi_game_gnm, igraph_erdos_renyi_game_gnm —  Generates a random (Erdős-Rényi) graph with a fixed number of edges.
+
erdos_renyi_game_gnm, igraph_erdos_renyi_game_gnm —  Generates a random (Erdős-Rényi) graph with a fixed number of edges.
 

-
erdos_renyi_game_gnp, igraph_erdos_renyi_game_gnp —  Generates a random (Erdős-Rényi) graph with fixed edge probabilities.
+
erdos_renyi_game_gnp, igraph_erdos_renyi_game_gnp —  Generates a random (Erdős-Rényi) graph with fixed edge probabilities.
 

 
ERROR, IGRAPH_ERROR —  Triggers an error.
 

@@ -803,70 +801,70 @@ 
E

 
 
error_type_t, igraph_error_type_t —  Error code type.
 

-
ess_1, igraph_ess_1 —  Immediate version of the single edge edge selector.
+
ess_1, igraph_ess_1 —  Immediate version of the single edge edge selector.
 

-
ess_all, igraph_ess_all —  Edge set, all edges (immediate version).
+
ess_all, igraph_ess_all —  Edge set, all edges (immediate version).
 

-
ess_none, igraph_ess_none —  Immediate empty edge selector.
+
ess_none, igraph_ess_none —  Immediate empty edge selector.
 

-
ess_range, igraph_ess_range —  Immediate version of the sequence edge selector.
+
ess_range, igraph_ess_range —  Immediate version of the sequence edge selector.
 

-
ess_vector, igraph_ess_vector —  Immediate vector view edge selector.
+
ess_vector, igraph_ess_vector —  Immediate vector view edge selector.
 

-
establishment_game, igraph_establishment_game —  Generates a graph with a simple growing model with vertex types.
+
establishment_game, igraph_establishment_game —  Generates a graph with a simple growing model with vertex types.
 

-
es_1, igraph_es_1 —  Edge selector containing a single edge.
+
es_1, igraph_es_1 —  Edge selector containing a single edge.
 

-
es_all, igraph_es_all —  Edge set, all edges.
+
es_all, igraph_es_all —  Edge set, all edges.
 

-
es_all_between, igraph_es_all_between —  Edge selector, all edge IDs between a pair of vertices.
+
es_all_between, igraph_es_all_between —  Edge selector, all edge IDs between a pair of vertices.
 

-
es_as_vector, igraph_es_as_vector —  Transform edge selector into vector.
+
es_as_vector, igraph_es_as_vector —  Transform edge selector into vector.
 

-
es_copy, igraph_es_copy —  Creates a copy of an edge selector.
+
es_copy, igraph_es_copy —  Creates a copy of an edge selector.
 

-
es_destroy, igraph_es_destroy —  Destroys an edge selector object.
+
es_destroy, igraph_es_destroy —  Destroys an edge selector object.
 

-
es_incident, igraph_es_incident —  Edges incident on a given vertex.
+
es_incident, igraph_es_incident —  Edges incident on a given vertex.
 

-
es_is_all, igraph_es_is_all —  Check whether an edge selector includes all edges.
+
es_is_all, igraph_es_is_all —  Check whether an edge selector includes all edges.
 

-
es_none, igraph_es_none —  Empty edge selector.
+
es_none, igraph_es_none —  Empty edge selector.
 

-
es_pairs, igraph_es_pairs —  Edge selector, multiple edges defined by their endpoints in a vector.
+
es_pairs, igraph_es_pairs —  Edge selector, multiple edges defined by their endpoints in a vector.
 

-
es_pairs_small, igraph_es_pairs_small —  Edge selector, multiple edges defined by their endpoints as arguments.
+
es_pairs_small, igraph_es_pairs_small —  Edge selector, multiple edges defined by their endpoints as arguments.
 

-
es_path, igraph_es_path —  Edge selector, edge IDs on a path.
+
es_path, igraph_es_path —  Edge selector, edge IDs on a path.
 

-
es_range, igraph_es_range —  Edge selector, a sequence of edge IDs.
+
es_range, igraph_es_range —  Edge selector, a sequence of edge IDs.
 

-
es_size, igraph_es_size —  Returns the size of the edge selector.
+
es_size, igraph_es_size —  Returns the size of the edge selector.
 

-
es_type, igraph_es_type —  Returns the type of the edge selector.
+
es_type, igraph_es_type —  Returns the type of the edge selector.
 

-
es_vector, igraph_es_vector —  Handle a vector as an edge selector.
+
es_vector, igraph_es_vector —  Handle a vector as an edge selector.
 

-
es_vector_copy, igraph_es_vector_copy —  Edge set, based on a vector, with copying.
+
es_vector_copy, igraph_es_vector_copy —  Edge set, based on a vector, with copying.
 

-
eulerian_cycle, igraph_eulerian_cycle —  Finds an Eulerian cycle.
+
eulerian_cycle, igraph_eulerian_cycle —  Finds an Eulerian cycle.
 

-
eulerian_path, igraph_eulerian_path —  Finds an Eulerian path.
+
eulerian_path, igraph_eulerian_path —  Finds an Eulerian path.
 

-
even_tarjan_reduction, igraph_even_tarjan_reduction —  Even-Tarjan reduction of a graph.
+
even_tarjan_reduction, igraph_even_tarjan_reduction —  Even-Tarjan reduction of a graph.
 

-
exit_safelocale, igraph_exit_safelocale —  Temporarily set the C locale.
+
exit_safelocale, igraph_exit_safelocale —  Temporarily set the C locale.
 

 
expand_path_to_pairs, igraph_expand_path_to_pairs —  Helper function to convert a sequence of vertex IDs describing a path into a "pairs" vector.
 

-
extended_chordal_ring, igraph_extended_chordal_ring —  Create an extended chordal ring.
+
extended_chordal_ring, igraph_extended_chordal_ring —  Create an extended chordal ring.
 

 

 

 

 
F

 

-
famous, igraph_famous —  Create a famous graph by simply providing its name.
+
famous, igraph_famous —  Create a famous graph by simply providing its name.
 

 
FATAL, IGRAPH_FATAL —  Triggers a fatal error.
 

@@ -880,7 +878,7 @@ 
F

 
 
fatal_handler_t, igraph_fatal_handler_t —  The type of igraph fatal error handler functions.
 

-
feedback_arc_set, igraph_feedback_arc_set —  Feedback arc set of a graph using exact or heuristic methods.
+
feedback_arc_set, igraph_feedback_arc_set —  Feedback arc set of a graph using exact or heuristic methods.
 

 
FINALLY, IGRAPH_FINALLY —  Registers an object for deallocation.
 

@@ -888,191 +886,187 @@ 
F

 
 
FINALLY_FREE, IGRAPH_FINALLY_FREE —  Deallocates objects registered at the current level.
 

-
forest_fire_game, igraph_forest_fire_game —  Generates a network according to the “forest fire game”.
+
forest_fire_game, igraph_forest_fire_game —  Generates a network according to the “forest fire game”.
 

 
free, igraph_free —  Deallocate memory that was allocated by igraph functions.
 

 
FROM, IGRAPH_FROM —  The source vertex of an edge.
 

-
from_hrg_dendrogram, igraph_from_hrg_dendrogram —  Create a graph representation of the dendrogram of a hierarchical random graph model.
+
from_hrg_dendrogram, igraph_from_hrg_dendrogram —  Create a graph representation of the dendrogram of a hierarchical random graph model.
 

-
from_prufer, igraph_from_prufer —  Generates a tree from a Prüfer sequence.
+
from_prufer, igraph_from_prufer —  Generates a tree from a Prüfer sequence.
 

-
full, igraph_full —  Creates a full graph (complete graph).
+
full, igraph_full —  Creates a full graph (complete graph).
 

-
full_bipartite, igraph_full_bipartite —  Creates a complete bipartite graph.
+
full_bipartite, igraph_full_bipartite —  Creates a complete bipartite graph.
 

-
full_citation, igraph_full_citation —  Creates a full citation graph (a complete directed acyclic graph).
+
full_citation, igraph_full_citation —  Creates a full citation graph (a complete directed acyclic graph).
 

-
full_multipartite, igraph_full_multipartite —  Creates a full multipartite graph.
+
full_multipartite, igraph_full_multipartite —  Creates a full multipartite graph.
 

-
fundamental_cycles, igraph_fundamental_cycles —  Finds a fundamental cycle basis.
+
fundamental_cycles, igraph_fundamental_cycles —  Finds a fundamental cycle basis.
 

 

 

 

 
G

 

-
GAB, GAB — Query a boolean graph attribute.
+
GAB, GAB — Query a boolean graph attribute.
 

-
GAN, GAN — Query a numeric graph attribute.
+
GAN, GAN — Query a numeric graph attribute.
 

-
GAS, GAS — Query a string graph attribute.
+
GAS, GAS — Query a string graph attribute.
 

-
generalized_petersen, igraph_generalized_petersen —  Creates a Generalized Petersen graph.
+
generalized_petersen, igraph_generalized_petersen —  Creates a Generalized Petersen graph.
 

-
get_adjacency, igraph_get_adjacency —  The adjacency matrix of a graph.
+
get_adjacency, igraph_get_adjacency —  The adjacency matrix of a graph.
 

-
get_adjacency_sparse, igraph_get_adjacency_sparse —  Returns the adjacency matrix of a graph in a sparse matrix format.
+
get_adjacency_sparse, igraph_get_adjacency_sparse —  Returns the adjacency matrix of a graph in a sparse matrix format.
 

 
get_all_eids_between, igraph_get_all_eids_between —  Returns all edge IDs between a pair of vertices.
 

-
get_all_shortest_paths, igraph_get_all_shortest_paths —  All shortest paths (geodesics) from a vertex.
+
get_all_shortest_paths, igraph_get_all_shortest_paths —  All shortest paths (geodesics) from a vertex.
 

-
get_all_shortest_paths_dijkstra, igraph_get_all_shortest_paths_dijkstra —  All weighted shortest paths (geodesics) from a vertex.
+
get_all_shortest_paths_dijkstra, igraph_get_all_shortest_paths_dijkstra —  All weighted shortest paths (geodesics) from a vertex.
 

-
get_all_simple_paths, igraph_get_all_simple_paths —  List all simple paths from one source.
+
get_all_simple_paths, igraph_get_all_simple_paths —  List all simple paths from one source.
 

-
get_biadjacency, igraph_get_biadjacency —  Converts a bipartite graph into a bipartite adjacency matrix.
+
get_biadjacency, igraph_get_biadjacency —  Converts a bipartite graph into a bipartite adjacency matrix.
 

-
get_edgelist, igraph_get_edgelist —  The list of edges in a graph.
+
get_edgelist, igraph_get_edgelist —  The list of edges in a graph.
 

 
get_eid, igraph_get_eid —  Get the edge ID from the endpoints of an edge.
 

 
get_eids, igraph_get_eids — Return edge IDs based on the adjacent vertices.
 

-
get_isomorphisms_vf2, igraph_get_isomorphisms_vf2 —  Collect all isomorphic mappings of two graphs.
-

-
get_isomorphisms_vf2_callback, igraph_get_isomorphisms_vf2_callback — The generic VF2 interface
-

-
get_k_shortest_paths, igraph_get_k_shortest_paths —  k shortest paths between two vertices.
+
get_isomorphisms_vf2, igraph_get_isomorphisms_vf2 —  Collect all isomorphic mappings of two graphs.
 

-
get_laplacian, igraph_get_laplacian —  Returns the Laplacian matrix of a graph.
+
get_isomorphisms_vf2_callback, igraph_get_isomorphisms_vf2_callback — The generic VF2 interface
 

-
get_laplacian_sparse, igraph_get_laplacian_sparse —  Returns the Laplacian of a graph in a sparse matrix format.
+
get_k_shortest_paths, igraph_get_k_shortest_paths —  k shortest paths between two vertices.
 

-
get_shortest_path, igraph_get_shortest_path —  Shortest path from one vertex to another one.
+
get_laplacian, igraph_get_laplacian —  Returns the Laplacian matrix of a graph.
 

-
get_shortest_paths, igraph_get_shortest_paths —  Shortest paths from a vertex.
+
get_laplacian_sparse, igraph_get_laplacian_sparse —  Returns the Laplacian of a graph in a sparse matrix format.
 

-
get_shortest_paths_bellman_ford, igraph_get_shortest_paths_bellman_ford —  Weighted shortest paths from a vertex, allowing negative weights.
+
get_shortest_path, igraph_get_shortest_path —  Shortest path from one vertex to another one.
 

-
get_shortest_paths_dijkstra, igraph_get_shortest_paths_dijkstra —  Weighted shortest paths from a vertex.
+
get_shortest_paths, igraph_get_shortest_paths —  Shortest paths from a vertex.
 

-
get_shortest_path_astar, igraph_get_shortest_path_astar —  A* gives the shortest path from one vertex to another, with heuristic.
+
get_shortest_paths_bellman_ford, igraph_get_shortest_paths_bellman_ford —  Weighted shortest paths from a vertex, allowing negative weights.
 

-
get_shortest_path_bellman_ford, igraph_get_shortest_path_bellman_ford —  Weighted shortest path from one vertex to another one (Bellman-Ford).
+
get_shortest_paths_dijkstra, igraph_get_shortest_paths_dijkstra —  Weighted shortest paths from a vertex.
 

-
get_shortest_path_dijkstra, igraph_get_shortest_path_dijkstra —  Weighted shortest path from one vertex to another one (Dijkstra).
+
get_shortest_path_astar, igraph_get_shortest_path_astar —  A* gives the shortest path from one vertex to another, with heuristic.
 

-
get_sparsemat, igraph_get_sparsemat —  Converts an igraph graph to a sparse matrix (deprecated).
+
get_shortest_path_bellman_ford, igraph_get_shortest_path_bellman_ford —  Weighted shortest path from one vertex to another one (Bellman-Ford).
 

-
get_stochastic, igraph_get_stochastic —  Stochastic adjacency matrix of a graph.
+
get_shortest_path_dijkstra, igraph_get_shortest_path_dijkstra —  Weighted shortest path from one vertex to another one (Dijkstra).
 

-
get_stochastic_sparse, igraph_get_stochastic_sparse —  The stochastic adjacency matrix of a graph.
+
get_stochastic, igraph_get_stochastic —  Stochastic adjacency matrix of a graph.
 

-
get_stochastic_sparsemat, igraph_get_stochastic_sparsemat —  Stochastic adjacency matrix of a graph (deprecated).
+
get_stochastic_sparse, igraph_get_stochastic_sparse —  The stochastic adjacency matrix of a graph.
 

-
get_subisomorphisms_vf2, igraph_get_subisomorphisms_vf2 —  Return all subgraph isomorphic mappings.
+
get_subisomorphisms_vf2, igraph_get_subisomorphisms_vf2 —  Return all subgraph isomorphic mappings.
 

-
get_subisomorphisms_vf2_callback, igraph_get_subisomorphisms_vf2_callback —  Generic VF2 function for subgraph isomorphism problems.
+
get_subisomorphisms_vf2_callback, igraph_get_subisomorphisms_vf2_callback —  Generic VF2 function for subgraph isomorphism problems.
 

-
get_widest_path, igraph_get_widest_path —  Widest path from one vertex to another one.
+
get_widest_path, igraph_get_widest_path —  Widest path from one vertex to another one.
 

-
get_widest_paths, igraph_get_widest_paths —  Widest paths from a single vertex.
+
get_widest_paths, igraph_get_widest_paths —  Widest paths from a single vertex.
 

-
girth, igraph_girth —  The girth of a graph is the length of the shortest cycle in it.
+
girth, igraph_girth —  The girth of a graph is the length of the shortest cycle in it.
 

-
global_efficiency, igraph_global_efficiency —  Calculates the global efficiency of a network.
+
global_efficiency, igraph_global_efficiency —  Calculates the global efficiency of a network.
 

-
gomory_hu_tree, igraph_gomory_hu_tree —  Gomory-Hu tree of a graph.
+
gomory_hu_tree, igraph_gomory_hu_tree —  Gomory-Hu tree of a graph.
 

-
graphlets, igraph_graphlets — Calculate graphlets basis and project the graph on it
+
graphlets, igraph_graphlets — Calculate graphlets basis and project the graph on it
 

-
graphlets_candidate_basis, igraph_graphlets_candidate_basis — Calculate a candidate graphlets basis
+
graphlets_candidate_basis, igraph_graphlets_candidate_basis — Calculate a candidate graphlets basis
 

-
graphlets_project, igraph_graphlets_project — Project a graph on a graphlets basis
+
graphlets_project, igraph_graphlets_project — Project a graph on a graphlets basis
 

-
graph_center, igraph_graph_center —  Central vertices of a graph.
+
graph_center, igraph_graph_center —  Central vertices of a graph.
 

-
graph_center_dijkstra, igraph_graph_center_dijkstra —  Central vertices of a graph, using weighted edges.
+
graph_center_dijkstra, igraph_graph_center_dijkstra —  Central vertices of a graph, using weighted edges.
 

-
graph_count, igraph_graph_count —  The number of unlabelled graphs on the given number of vertices.
+
graph_count, igraph_graph_count —  The number of unlabelled graphs on the given number of vertices.
 

-
graph_power, igraph_graph_power —  The kth power of a graph.
+
graph_power, igraph_graph_power —  The kth power of a graph.
 

-
grg_game, igraph_grg_game —  Generates a geometric random graph.
+
grg_game, igraph_grg_game —  Generates a geometric random graph.
 

-
growing_random_game, igraph_growing_random_game —  Generates a growing random graph.
+
growing_random_game, igraph_growing_random_game —  Generates a growing random graph.
 

 

 

 

 
H

 

-
harmonic_centrality, igraph_harmonic_centrality —  Harmonic centrality for some vertices.
+
harmonic_centrality, igraph_harmonic_centrality —  Harmonic centrality for some vertices.
 

-
harmonic_centrality_cutoff, igraph_harmonic_centrality_cutoff —  Range limited harmonic centrality.
+
harmonic_centrality_cutoff, igraph_harmonic_centrality_cutoff —  Range limited harmonic centrality.
 

-
has_loop, igraph_has_loop —  Returns whether the graph has at least one loop edge.
+
has_loop, igraph_has_loop —  Returns whether the graph has at least one loop edge.
 

-
has_multiple, igraph_has_multiple —  Check whether the graph has at least one multiple edge.
+
has_multiple, igraph_has_multiple —  Check whether the graph has at least one multiple edge.
 

-
has_mutual, igraph_has_mutual —  Check whether a directed graph has any mutual edges.
+
has_mutual, igraph_has_mutual —  Check whether a directed graph has any mutual edges.
 

-
heap_clear, igraph_heap_clear —  Removes all elements from a heap.
+
heap_clear, igraph_heap_clear —  Removes all elements from a heap.
 

-
heap_delete_top, igraph_heap_delete_top —  Removes and returns the top element.
+
heap_delete_top, igraph_heap_delete_top —  Removes and returns the top element.
 

-
heap_destroy, igraph_heap_destroy —  Destroys an initialized heap object.
+
heap_destroy, igraph_heap_destroy —  Destroys an initialized heap object.
 

-
heap_empty, igraph_heap_empty —  Decides whether a heap object is empty.
+
heap_empty, igraph_heap_empty —  Decides whether a heap object is empty.
 

-
heap_init, igraph_heap_init —  Initializes an empty heap object.
+
heap_init, igraph_heap_init —  Initializes an empty heap object.
 

-
heap_init_array, igraph_heap_init_array —  Build a heap from an array.
+
heap_init_array, igraph_heap_init_array —  Build a heap from an array.
 

-
heap_push, igraph_heap_push —  Add an element.
+
heap_push, igraph_heap_push —  Add an element.
 

-
heap_reserve, igraph_heap_reserve —  Reserves memory for a heap.
+
heap_reserve, igraph_heap_reserve —  Reserves memory for a heap.
 

-
heap_size, igraph_heap_size —  Number of elements in the heap.
+
heap_size, igraph_heap_size —  Number of elements in the heap.
 

-
heap_top, igraph_heap_top —  Top element.
+
heap_top, igraph_heap_top —  Top element.
 

-
hexagonal_lattice, igraph_hexagonal_lattice —  A hexagonal lattice with the given shape.
+
hexagonal_lattice, igraph_hexagonal_lattice —  A hexagonal lattice with the given shape.
 

-
hrg_consensus, igraph_hrg_consensus —  Calculate a consensus tree for a HRG.
+
hrg_consensus, igraph_hrg_consensus —  Calculate a consensus tree for a HRG.
 

-
hrg_create, igraph_hrg_create —  Create a HRG from an igraph graph.
+
hrg_create, igraph_hrg_create —  Create a HRG from an igraph graph.
 

-
hrg_dendrogram, igraph_hrg_dendrogram —  Create a dendrogram from a hierarchical random graph.
+
hrg_dendrogram, igraph_hrg_dendrogram —  Create a dendrogram from a hierarchical random graph.
 

-
hrg_destroy, igraph_hrg_destroy —  Deallocate memory for an HRG.
+
hrg_destroy, igraph_hrg_destroy —  Deallocate memory for an HRG.
 

-
hrg_fit, igraph_hrg_fit —  Fit a hierarchical random graph model to a network.
+
hrg_fit, igraph_hrg_fit —  Fit a hierarchical random graph model to a network.
 

-
hrg_game, igraph_hrg_game —  Generate a hierarchical random graph.
+
hrg_game, igraph_hrg_game —  Generate a hierarchical random graph.
 

-
hrg_init, igraph_hrg_init —  Allocate memory for a HRG.
+
hrg_init, igraph_hrg_init —  Allocate memory for a HRG.
 

-
hrg_predict, igraph_hrg_predict —  Predict missing edges in a graph, based on HRG models.
+
hrg_predict, igraph_hrg_predict —  Predict missing edges in a graph, based on HRG models.
 

-
hrg_resize, igraph_hrg_resize —  Resize a HRG.
+
hrg_resize, igraph_hrg_resize —  Resize a HRG.
 

-
hrg_sample, igraph_hrg_sample —  Sample from a hierarchical random graph model.
+
hrg_sample, igraph_hrg_sample —  Sample from a hierarchical random graph model.
 

-
hrg_size, igraph_hrg_size —  Returns the size of the HRG, the number of leaf nodes.
+
hrg_size, igraph_hrg_size —  Returns the size of the HRG, the number of leaf nodes.
 

-
hrg_t, igraph_hrg_t —  Data structure to store a hierarchical random graph.
+
hrg_t, igraph_hrg_t —  Data structure to store a hierarchical random graph.
 

-
hsbm_game, igraph_hsbm_game —  Hierarchical stochastic block model.
+
hsbm_game, igraph_hsbm_game —  Hierarchical stochastic block model.
 

-
hsbm_list_game, igraph_hsbm_list_game —  Hierarchical stochastic block model, more general version.
+
hsbm_list_game, igraph_hsbm_list_game —  Hierarchical stochastic block model, more general version.
 

-
hub_and_authority_scores, igraph_hub_and_authority_scores —  Kleinberg's hub and authority scores (HITS).
+
hub_and_authority_scores, igraph_hub_and_authority_scores —  Kleinberg's hub and authority scores (HITS).
 

-
hypercube, igraph_hypercube —  The n-dimensional hypercube graph.
+
hypercube, igraph_hypercube —  The n-dimensional hypercube graph.
 

 

 

@@ -1097,266 +1091,260 @@ 
I

 
 
incident, igraph_incident —  Gives the incident edges of a vertex.
 

-
inclist_clear, igraph_inclist_clear —  Removes all edges from an incidence list.
+
inclist_clear, igraph_inclist_clear —  Removes all edges from an incidence list.
 

-
inclist_destroy, igraph_inclist_destroy —  Frees all memory allocated for an incidence list.
+
inclist_destroy, igraph_inclist_destroy —  Frees all memory allocated for an incidence list.
 

-
inclist_get, igraph_inclist_get —  Query a vector in an incidence list.
+
inclist_get, igraph_inclist_get —  Query a vector in an incidence list.
 

-
inclist_init, igraph_inclist_init —  Initializes an incidence list.
+
inclist_init, igraph_inclist_init —  Initializes an incidence list.
 

-
inclist_size, igraph_inclist_size —  Returns the number of vertices in an incidence list.
+
inclist_size, igraph_inclist_size —  Returns the number of vertices in an incidence list.
 

-
independence_number, igraph_independence_number —  Finds the independence number of the graph.
+
independence_number, igraph_independence_number —  Finds the independence number of the graph.
 

-
independent_vertex_sets, igraph_independent_vertex_sets —  Finds all independent vertex sets in a graph.
+
independent_vertex_sets, igraph_independent_vertex_sets —  Finds all independent vertex sets in a graph.
 

-
induced_subgraph, igraph_induced_subgraph —  Creates a subgraph induced by the specified vertices.
+
induced_subgraph, igraph_induced_subgraph —  Creates a subgraph induced by the specified vertices.
 

-
induced_subgraph_edges, igraph_induced_subgraph_edges —  The edges contained within an induced sugraph.
+
induced_subgraph_edges, igraph_induced_subgraph_edges —  The edges contained within an induced sugraph.
 

-
induced_subgraph_map, igraph_induced_subgraph_map —  Creates an induced subraph and returns the mapping from the original.
+
induced_subgraph_map, igraph_induced_subgraph_map —  Creates an induced subraph and returns the mapping from the original.
 

-
intersection, igraph_intersection —  Collect the common edges from two graphs.
+
intersection, igraph_intersection —  Collect the common edges from two graphs.
 

-
intersection_many, igraph_intersection_many —  The intersection of more than two graphs.
+
intersection_many, igraph_intersection_many —  The intersection of more than two graphs.
 

 
invalidate_cache, igraph_invalidate_cache —  Invalidates the internal cache of an igraph graph.
 

-
isoclass, igraph_isoclass —  Determine the isomorphism class of small graphs.
-

-
isoclass_create, igraph_isoclass_create —  Creates a graph from the given isomorphism class.
-

-
isoclass_subgraph, igraph_isoclass_subgraph —  The isomorphism class of a subgraph of a graph.
+
isoclass, igraph_isoclass —  Determine the isomorphism class of small graphs.
 

-
isocompat_t, igraph_isocompat_t — Callback type, called to check whether two vertices or edges are compatible
+
isoclass_create, igraph_isoclass_create —  Creates a graph from the given isomorphism class.
 

-
isohandler_t, igraph_isohandler_t — Callback type, called when an isomorphism was found
+
isoclass_subgraph, igraph_isoclass_subgraph —  The isomorphism class of a subgraph of a graph.
 

-
isomorphic, igraph_isomorphic —  Are two graphs isomorphic?
+
isocompat_t, igraph_isocompat_t — Callback type, called to check whether two vertices or edges are compatible
 

-
isomorphic_34, igraph_isomorphic_34 —  Graph isomorphism for 3-4 vertices (deprecated).
+
isohandler_t, igraph_isohandler_t — Callback type, called when an isomorphism was found
 

-
isomorphic_bliss, igraph_isomorphic_bliss —  Graph isomorphism via Bliss.
+
isomorphic, igraph_isomorphic —  Are two graphs isomorphic?
 

-
isomorphic_function_vf2, igraph_isomorphic_function_vf2 —  The generic VF2 interface (deprecated alias).
+
isomorphic_bliss, igraph_isomorphic_bliss —  Graph isomorphism via Bliss.
 

-
isomorphic_vf2, igraph_isomorphic_vf2 —  Isomorphism via VF2.
+
isomorphic_vf2, igraph_isomorphic_vf2 —  Isomorphism via VF2.
 

-
is_acyclic, igraph_is_acyclic —  Checks whether a graph is acyclic or not.
+
is_acyclic, igraph_is_acyclic —  Checks whether a graph is acyclic or not.
 

-
is_biconnected, igraph_is_biconnected —  Checks whether a graph is biconnected.
+
is_biconnected, igraph_is_biconnected —  Checks whether a graph is biconnected.
 

-
is_bigraphical, igraph_is_bigraphical —  Is there a bipartite graph with the given bi-degree-sequence?
+
is_bigraphical, igraph_is_bigraphical —  Is there a bipartite graph with the given bi-degree-sequence?
 

-
is_bipartite, igraph_is_bipartite —  Check whether a graph is bipartite.
+
is_bipartite, igraph_is_bipartite —  Check whether a graph is bipartite.
 

-
is_chordal, igraph_is_chordal —  Decides whether a graph is chordal.
+
is_chordal, igraph_is_chordal —  Decides whether a graph is chordal.
 

-
is_clique, igraph_is_clique —  Does a set of vertices form a clique?
+
is_clique, igraph_is_clique —  Does a set of vertices form a clique?
 

-
is_complete, igraph_is_complete —  Decides whether the graph is complete.
+
is_complete, igraph_is_complete —  Decides whether the graph is complete.
 

-
is_connected, igraph_is_connected —  Decides whether the graph is (weakly or strongly) connected.
+
is_connected, igraph_is_connected —  Decides whether the graph is (weakly or strongly) connected.
 

-
is_dag, igraph_is_dag —  Checks whether a graph is a directed acyclic graph (DAG).
+
is_dag, igraph_is_dag —  Checks whether a graph is a directed acyclic graph (DAG).
 

 
is_directed, igraph_is_directed —  Is this a directed graph?
 

-
is_eulerian, igraph_is_eulerian —  Checks whether an Eulerian path or cycle exists.
+
is_eulerian, igraph_is_eulerian —  Checks whether an Eulerian path or cycle exists.
 

-
is_forest, igraph_is_forest —  Decides whether the graph is a forest.
+
is_forest, igraph_is_forest —  Decides whether the graph is a forest.
 

-
is_graphical, igraph_is_graphical —  Is there a graph with the given degree sequence?
+
is_graphical, igraph_is_graphical —  Is there a graph with the given degree sequence?
 

-
is_independent_vertex_set, igraph_is_independent_vertex_set —  Does a set of vertices form an independent set?
+
is_independent_vertex_set, igraph_is_independent_vertex_set —  Does a set of vertices form an independent set?
 

-
is_loop, igraph_is_loop —  Find the loop edges in a graph.
+
is_loop, igraph_is_loop —  Find the loop edges in a graph.
 

-
is_matching, igraph_is_matching — Checks whether the given matching is valid for the given graph.
+
is_matching, igraph_is_matching — Checks whether the given matching is valid for the given graph.
 

-
is_maximal_matching, igraph_is_maximal_matching —  Checks whether a matching in a graph is maximal.
+
is_maximal_matching, igraph_is_maximal_matching —  Checks whether a matching in a graph is maximal.
 

-
is_minimal_separator, igraph_is_minimal_separator —  Decides whether a set of vertices is a minimal separator.
+
is_minimal_separator, igraph_is_minimal_separator —  Decides whether a set of vertices is a minimal separator.
 

-
is_multiple, igraph_is_multiple —  Find the multiple edges in a graph.
+
is_multiple, igraph_is_multiple —  Find the multiple edges in a graph.
 

-
is_mutual, igraph_is_mutual —  Check whether some edges of a directed graph are mutual.
+
is_mutual, igraph_is_mutual —  Check whether some edges of a directed graph are mutual.
 

-
is_perfect, igraph_is_perfect —  Checks if the graph is perfect.
+
is_perfect, igraph_is_perfect —  Checks if the graph is perfect.
 

 
is_same_graph, igraph_is_same_graph —  Are two graphs identical as labelled graphs?
 

-
is_separator, igraph_is_separator —  Would removing this set of vertices disconnect the graph?
+
is_separator, igraph_is_separator —  Would removing this set of vertices disconnect the graph?
 

-
is_simple, igraph_is_simple —  Decides whether the input graph is a simple graph.
+
is_simple, igraph_is_simple —  Decides whether the input graph is a simple graph.
 

-
is_tree, igraph_is_tree —  Decides whether the graph is a tree.
+
is_tree, igraph_is_tree —  Decides whether the graph is a tree.
 

 
 

 

 
J

 

-
join, igraph_join —  Creates the join of two disjoint graphs.
+
join, igraph_join —  Creates the join of two disjoint graphs.
 

-
joint_degree_distribution, igraph_joint_degree_distribution —  The joint degree distribution of a graph.
+
joint_degree_distribution, igraph_joint_degree_distribution —  The joint degree distribution of a graph.
 

-
joint_degree_matrix, igraph_joint_degree_matrix —  The joint degree matrix of a graph.
+
joint_degree_matrix, igraph_joint_degree_matrix —  The joint degree matrix of a graph.
 

-
joint_type_distribution, igraph_joint_type_distribution —  Mixing matrix for vertex categories.
+
joint_type_distribution, igraph_joint_type_distribution —  Mixing matrix for vertex categories.
 

 

 

 

 
K

 

-
kary_tree, igraph_kary_tree —  Creates a k-ary tree in which almost all vertices have k children.
+
kary_tree, igraph_kary_tree —  Creates a k-ary tree in which almost all vertices have k children.
 

-
kautz, igraph_kautz —  Generate a Kautz graph.
+
kautz, igraph_kautz —  Generate a Kautz graph.
 

-
k_regular_game, igraph_k_regular_game —  Generates a random graph where each vertex has the same degree.
+
k_regular_game, igraph_k_regular_game —  Generates a random graph where each vertex has the same degree.
 

 

 

 

 
L

 

-
lapack_dgeev, igraph_lapack_dgeev —  Eigenvalues and optionally eigenvectors of a non-symmetric matrix.
+
lapack_dgeev, igraph_lapack_dgeev —  Eigenvalues and optionally eigenvectors of a non-symmetric matrix.
 

-
lapack_dgeevx, igraph_lapack_dgeevx —  Eigenvalues/vectors of nonsymmetric matrices, expert mode.
+
lapack_dgeevx, igraph_lapack_dgeevx —  Eigenvalues/vectors of nonsymmetric matrices, expert mode.
 

-
lapack_dgesv, igraph_lapack_dgesv —  Solve system of linear equations with LU factorization.
+
lapack_dgesv, igraph_lapack_dgesv —  Solve system of linear equations with LU factorization.
 

-
lapack_dgetrf, igraph_lapack_dgetrf —  LU factorization of a general M-by-N matrix.
+
lapack_dgetrf, igraph_lapack_dgetrf —  LU factorization of a general M-by-N matrix.
 

-
lapack_dgetrs, igraph_lapack_dgetrs —  Solve general system of linear equations using LU factorization.
+
lapack_dgetrs, igraph_lapack_dgetrs —  Solve general system of linear equations using LU factorization.
 

-
lapack_dsyevr, igraph_lapack_dsyevr —  Selected eigenvalues and optionally eigenvectors of a symmetric matrix.
+
lapack_dsyevr, igraph_lapack_dsyevr —  Selected eigenvalues and optionally eigenvectors of a symmetric matrix.
 

-
laplacian, igraph_laplacian —  Returns the Laplacian matrix of a graph (deprecated).
+
laplacian_normalization_t, igraph_laplacian_normalization_t —  Normalization methods for a Laplacian matrix.
 

-
laplacian_normalization_t, igraph_laplacian_normalization_t —  Normalization methods for a Laplacian matrix.
+
laplacian_spectral_embedding, igraph_laplacian_spectral_embedding — Spectral embedding of the Laplacian of a graph
 

-
laplacian_spectral_embedding, igraph_laplacian_spectral_embedding — Spectral embedding of the Laplacian of a graph
+
largest_cliques, igraph_largest_cliques —  Finds the largest clique(s) in a graph.
 

-
largest_cliques, igraph_largest_cliques —  Finds the largest clique(s) in a graph.
+
largest_independent_vertex_sets, igraph_largest_independent_vertex_sets —  Finds the largest independent vertex set(s) in a graph.
 

-
largest_independent_vertex_sets, igraph_largest_independent_vertex_sets —  Finds the largest independent vertex set(s) in a graph.
+
largest_weighted_cliques, igraph_largest_weighted_cliques —  Finds the largest weight clique(s) in a graph.
 

-
largest_weighted_cliques, igraph_largest_weighted_cliques —  Finds the largest weight clique(s) in a graph.
+
lastcit_game, igraph_lastcit_game —  Simulates a citation network, based on time passed since the last citation.
 

-
lastcit_game, igraph_lastcit_game —  Simulates a citation network, based on time passed since the last citation.
+
layout_bipartite, igraph_layout_bipartite — Simple layout for bipartite graphs.
 

-
layout_bipartite, igraph_layout_bipartite — Simple layout for bipartite graphs.
+
layout_circle, igraph_layout_circle —  Places the vertices uniformly on a circle in arbitrary order.
 

-
layout_circle, igraph_layout_circle —  Places the vertices uniformly on a circle in arbitrary order.
+
layout_davidson_harel, igraph_layout_davidson_harel —  Davidson-Harel layout algorithm.
 

-
layout_davidson_harel, igraph_layout_davidson_harel —  Davidson-Harel layout algorithm.
+
layout_drl, igraph_layout_drl — The DrL layout generator
 

-
layout_drl, igraph_layout_drl — The DrL layout generator
+
layout_drl_3d, igraph_layout_drl_3d — The DrL layout generator, 3d version.
 

-
layout_drl_3d, igraph_layout_drl_3d — The DrL layout generator, 3d version.
+
layout_drl_default_t, igraph_layout_drl_default_t — Predefined parameter templates for the DrL layout generator
 

-
layout_drl_default_t, igraph_layout_drl_default_t — Predefined parameter templates for the DrL layout generator
+
layout_drl_options_init, igraph_layout_drl_options_init — Initialize parameters for the DrL layout generator
 

-
layout_drl_options_init, igraph_layout_drl_options_init — Initialize parameters for the DrL layout generator
+
layout_drl_options_t, igraph_layout_drl_options_t — Parameters for the DrL layout generator
 

-
layout_drl_options_t, igraph_layout_drl_options_t — Parameters for the DrL layout generator
+
layout_fruchterman_reingold, igraph_layout_fruchterman_reingold —  Places the vertices on a plane according to the Fruchterman-Reingold algorithm.
 

-
layout_fruchterman_reingold, igraph_layout_fruchterman_reingold —  Places the vertices on a plane according to the Fruchterman-Reingold algorithm.
+
layout_fruchterman_reingold_3d, igraph_layout_fruchterman_reingold_3d —  3D Fruchterman-Reingold algorithm.
 

-
layout_fruchterman_reingold_3d, igraph_layout_fruchterman_reingold_3d —  3D Fruchterman-Reingold algorithm.
+
layout_gem, igraph_layout_gem —  Layout graph according to GEM algorithm.
 

-
layout_gem, igraph_layout_gem —  Layout graph according to GEM algorithm.
+
layout_graphopt, igraph_layout_graphopt —  Optimizes vertex layout via the graphopt algorithm.
 

-
layout_graphopt, igraph_layout_graphopt —  Optimizes vertex layout via the graphopt algorithm.
+
layout_grid, igraph_layout_grid —  Places the vertices on a regular grid on the plane.
 

-
layout_grid, igraph_layout_grid —  Places the vertices on a regular grid on the plane.
+
layout_grid_3d, igraph_layout_grid_3d —  Places the vertices on a regular grid in the 3D space.
 

-
layout_grid_3d, igraph_layout_grid_3d —  Places the vertices on a regular grid in the 3D space.
+
layout_kamada_kawai, igraph_layout_kamada_kawai —  Places the vertices on a plane according to the Kamada-Kawai algorithm.
 

-
layout_kamada_kawai, igraph_layout_kamada_kawai —  Places the vertices on a plane according to the Kamada-Kawai algorithm.
+
layout_kamada_kawai_3d, igraph_layout_kamada_kawai_3d —  3D version of the Kamada-Kawai layout generator.
 

-
layout_kamada_kawai_3d, igraph_layout_kamada_kawai_3d —  3D version of the Kamada-Kawai layout generator.
+
layout_lgl, igraph_layout_lgl —  Force based layout algorithm for large graphs.
 

-
layout_lgl, igraph_layout_lgl —  Force based layout algorithm for large graphs.
+
layout_mds, igraph_layout_mds —  Place the vertices on a plane using multidimensional scaling.
 

-
layout_mds, igraph_layout_mds —  Place the vertices on a plane using multidimensional scaling.
+
layout_merge_dla, igraph_layout_merge_dla —  Merges multiple layouts by using a DLA algorithm.
 

-
layout_merge_dla, igraph_layout_merge_dla —  Merges multiple layouts by using a DLA algorithm.
+
layout_random, igraph_layout_random —  Places the vertices uniform randomly on a plane.
 

-
layout_random, igraph_layout_random —  Places the vertices uniform randomly on a plane.
+
layout_random_3d, igraph_layout_random_3d —  Places the vertices uniform randomly in a cube.
 

-
layout_random_3d, igraph_layout_random_3d —  Places the vertices uniform randomly in a cube.
+
layout_reingold_tilford, igraph_layout_reingold_tilford —  Reingold-Tilford layout for tree graphs.
 

-
layout_reingold_tilford, igraph_layout_reingold_tilford —  Reingold-Tilford layout for tree graphs.
+
layout_reingold_tilford_circular, igraph_layout_reingold_tilford_circular —  Circular Reingold-Tilford layout for trees.
 

-
layout_reingold_tilford_circular, igraph_layout_reingold_tilford_circular —  Circular Reingold-Tilford layout for trees.
+
layout_sphere, igraph_layout_sphere —  Places vertices (more or less) uniformly on a sphere.
 

-
layout_sphere, igraph_layout_sphere —  Places vertices (more or less) uniformly on a sphere.
+
layout_star, igraph_layout_star —  Generates a star-like layout.
 

-
layout_star, igraph_layout_star —  Generates a star-like layout.
+
layout_sugiyama, igraph_layout_sugiyama —  Sugiyama layout algorithm for layered directed acyclic graphs.
 

-
layout_sugiyama, igraph_layout_sugiyama —  Sugiyama layout algorithm for layered directed acyclic graphs.
+
layout_umap, igraph_layout_umap —  Layout using Uniform Manifold Approximation and Projection (UMAP).
 

-
layout_umap, igraph_layout_umap —  Layout using Uniform Manifold Approximation and Projection (UMAP).
+
layout_umap_3d, igraph_layout_umap_3d —  3D layout using UMAP.
 

-
layout_umap_3d, igraph_layout_umap_3d —  3D layout using UMAP.
+
layout_umap_compute_weights, igraph_layout_umap_compute_weights —  Compute weights for a UMAP layout starting from distances.
 

-
layout_umap_compute_weights, igraph_layout_umap_compute_weights —  Compute weights for a UMAP layout starting from distances.
+
lazy_adjlist_clear, igraph_lazy_adjlist_clear —  Removes all edges from a lazy adjacency list.
 

-
lazy_adjlist_clear, igraph_lazy_adjlist_clear —  Removes all edges from a lazy adjacency list.
+
lazy_adjlist_destroy, igraph_lazy_adjlist_destroy —  Deallocate a lazt adjacency list.
 

-
lazy_adjlist_destroy, igraph_lazy_adjlist_destroy —  Deallocate a lazt adjacency list.
+
lazy_adjlist_get, igraph_lazy_adjlist_get —  Query neighbor vertices.
 

-
lazy_adjlist_get, igraph_lazy_adjlist_get —  Query neighbor vertices.
+
lazy_adjlist_has, igraph_lazy_adjlist_has —  Are adjacenct vertices already stored in a lazy adjacency list?
 

-
lazy_adjlist_has, igraph_lazy_adjlist_has —  Are adjacenct vertices already stored in a lazy adjacency list?
+
lazy_adjlist_init, igraph_lazy_adjlist_init —  Initializes a lazy adjacency list.
 

-
lazy_adjlist_init, igraph_lazy_adjlist_init —  Initializes a lazy adjacency list.
+
lazy_adjlist_size, igraph_lazy_adjlist_size —  Returns the number of vertices in a lazy adjacency list.
 

-
lazy_adjlist_size, igraph_lazy_adjlist_size —  Returns the number of vertices in a lazy adjacency list.
+
lazy_inclist_clear, igraph_lazy_inclist_clear —  Removes all edges from a lazy incidence list.
 

-
lazy_inclist_clear, igraph_lazy_inclist_clear —  Removes all edges from a lazy incidence list.
+
lazy_inclist_destroy, igraph_lazy_inclist_destroy —  Deallocates a lazy incidence list.
 

-
lazy_inclist_destroy, igraph_lazy_inclist_destroy —  Deallocates a lazy incidence list.
+
lazy_inclist_get, igraph_lazy_inclist_get —  Query incident edges.
 

-
lazy_inclist_get, igraph_lazy_inclist_get —  Query incident edges.
+
lazy_inclist_has, igraph_lazy_inclist_has —  Are incident edges already stored in a lazy inclist?
 

-
lazy_inclist_has, igraph_lazy_inclist_has —  Are incident edges already stored in a lazy inclist?
+
lazy_inclist_init, igraph_lazy_inclist_init —  Initializes a lazy incidence list of edges.
 

-
lazy_inclist_init, igraph_lazy_inclist_init —  Initializes a lazy incidence list of edges.
+
lazy_inclist_size, igraph_lazy_inclist_size —  Returns the number of vertices in a lazy incidence list.
 

-
lazy_inclist_size, igraph_lazy_inclist_size —  Returns the number of vertices in a lazy incidence list.
+
lcf, igraph_lcf —  Creates a graph from LCF notation.
 

-
lcf, igraph_lcf —  Creates a graph from LCF notation.
+
lcf_vector, igraph_lcf_vector —  Creates a graph from LCF notation.
 

-
lcf_vector, igraph_lcf_vector —  Creates a graph from LCF notation.
+
le_community_to_membership, igraph_le_community_to_membership —  Vertex membership from the leading eigenvector community structure.
 

-
le_community_to_membership, igraph_le_community_to_membership —  Vertex membership from the leading eigenvector community structure.
+
linegraph, igraph_linegraph —  Create the line graph of a graph.
 

-
linegraph, igraph_linegraph —  Create the line graph of a graph.
+
list_triangles, igraph_list_triangles —  Find all triangles in a graph.
 

-
list_triangles, igraph_list_triangles —  Find all triangles in a graph.
+
local_efficiency, igraph_local_efficiency —  Calculates the local efficiency around each vertex in a network.
 

-
local_efficiency, igraph_local_efficiency —  Calculates the local efficiency around each vertex in a network.
+
local_scan_0, igraph_local_scan_0 — Local scan-statistics, k=0
 

-
local_scan_0, igraph_local_scan_0 — Local scan-statistics, k=0
+
local_scan_0_them, igraph_local_scan_0_them — Local THEM scan-statistics, k=0
 

-
local_scan_0_them, igraph_local_scan_0_them — Local THEM scan-statistics, k=0
+
local_scan_1_ecount, igraph_local_scan_1_ecount — Local scan-statistics, k=1, edge count and sum of weights
 

-
local_scan_1_ecount, igraph_local_scan_1_ecount — Local scan-statistics, k=1, edge count and sum of weights
+
local_scan_1_ecount_them, igraph_local_scan_1_ecount_them — Local THEM scan-statistics, k=1, edge count and sum of weights
 

-
local_scan_1_ecount_them, igraph_local_scan_1_ecount_them — Local THEM scan-statistics, k=1, edge count and sum of weights
+
local_scan_k_ecount, igraph_local_scan_k_ecount —  Sum the number of edges or the weights in k-neighborhood of every vertex.
 

-
local_scan_k_ecount, igraph_local_scan_k_ecount —  Sum the number of edges or the weights in k-neighborhood of every vertex.
+
local_scan_k_ecount_them, igraph_local_scan_k_ecount_them —  Local THEM scan-statistics, edge count or sum of weights.
 

-
local_scan_k_ecount_them, igraph_local_scan_k_ecount_them —  Local THEM scan-statistics, edge count or sum of weights.
+
local_scan_neighborhood_ecount, igraph_local_scan_neighborhood_ecount — Local scan-statistics with pre-calculated neighborhoods
 

-
local_scan_neighborhood_ecount, igraph_local_scan_neighborhood_ecount — Local scan-statistics with pre-calculated neighborhoods
-

-
local_scan_subset_ecount, igraph_local_scan_subset_ecount —  Local scan-statistics of subgraphs induced by subsets of vertices.
+
local_scan_subset_ecount, igraph_local_scan_subset_ecount —  Local scan-statistics of subgraphs induced by subsets of vertices.
 

 

 

@@ -1365,222 +1353,218 @@ 
M

 

 
malloc, igraph_malloc —  Allocate memory that can be safely deallocated by igraph functions.
 

-
MATRIX, MATRIX —  Accessing an element of a matrix.
-

-
matrix_add, igraph_matrix_add — Add two matrices.
-

-
matrix_add_cols, igraph_matrix_add_cols —  Adds columns to a matrix.
+
MATRIX, MATRIX —  Accessing an element of a matrix.
 

-
matrix_add_constant, igraph_matrix_add_constant — Add a constant to every element.
+
matrix_add, igraph_matrix_add — Add two matrices.
 

-
matrix_add_rows, igraph_matrix_add_rows —  Adds rows to a matrix.
+
matrix_add_cols, igraph_matrix_add_cols —  Adds columns to a matrix.
 

-
matrix_all_almost_e, igraph_matrix_all_almost_e —  Are all elements almost equal?
+
matrix_add_constant, igraph_matrix_add_constant — Add a constant to every element.
 

-
matrix_all_e, igraph_matrix_all_e —  Are all elements equal?
+
matrix_add_rows, igraph_matrix_add_rows —  Adds rows to a matrix.
 

-
matrix_all_g, igraph_matrix_all_g —  Are all elements greater?
+
matrix_all_almost_e, igraph_matrix_all_almost_e —  Are all elements almost equal?
 

-
matrix_all_ge, igraph_matrix_all_ge —  Are all elements greater or equal?
+
matrix_all_e, igraph_matrix_all_e —  Are all elements equal?
 

-
matrix_all_l, igraph_matrix_all_l —  Are all elements less?
+
matrix_all_g, igraph_matrix_all_g —  Are all elements greater?
 

-
matrix_all_le, igraph_matrix_all_le —  Are all elements less or equal?
+
matrix_all_ge, igraph_matrix_all_ge —  Are all elements greater or equal?
 

-
matrix_as_sparsemat, igraph_matrix_as_sparsemat —  Converts a dense matrix to a sparse matrix.
+
matrix_all_l, igraph_matrix_all_l —  Are all elements less?
 

-
matrix_capacity, igraph_matrix_capacity —  Returns the number of elements allocated for a matrix.
+
matrix_all_le, igraph_matrix_all_le —  Are all elements less or equal?
 

-
matrix_cbind, igraph_matrix_cbind — Combine matrices columnwise.
+
matrix_as_sparsemat, igraph_matrix_as_sparsemat —  Converts a dense matrix to a sparse matrix.
 

-
matrix_colsum, igraph_matrix_colsum —  Columnwise sum.
+
matrix_capacity, igraph_matrix_capacity —  Returns the number of elements allocated for a matrix.
 

-
matrix_complex_all_almost_e, igraph_matrix_complex_all_almost_e —  Are all elements almost equal?
+
matrix_cbind, igraph_matrix_cbind — Combine matrices columnwise.
 

-
matrix_complex_create, igraph_matrix_complex_create —  Creates a complex matrix from a real and imaginary part.
+
matrix_colsum, igraph_matrix_colsum —  Columnwise sum.
 

-
matrix_complex_create_polar, igraph_matrix_complex_create_polar —  Creates a complex matrix from a magnitude and an angle.
+
matrix_complex_all_almost_e, igraph_matrix_complex_all_almost_e —  Are all elements almost equal?
 

-
matrix_complex_imag, igraph_matrix_complex_imag —  Gives the imaginary part of a complex matrix.
+
matrix_complex_create, igraph_matrix_complex_create —  Creates a complex matrix from a real and imaginary part.
 

-
matrix_complex_real, igraph_matrix_complex_real —  Gives the real part of a complex matrix.
+
matrix_complex_create_polar, igraph_matrix_complex_create_polar —  Creates a complex matrix from a magnitude and an angle.
 

-
matrix_complex_realimag, igraph_matrix_complex_realimag —  Gives the real and imaginary parts of a complex matrix.
+
matrix_complex_imag, igraph_matrix_complex_imag —  Gives the imaginary part of a complex matrix.
 

-
matrix_complex_zapsmall, igraph_matrix_complex_zapsmall —  Replaces small elements of a complex matrix by exact zeros.
+
matrix_complex_real, igraph_matrix_complex_real —  Gives the real part of a complex matrix.
 

-
matrix_contains, igraph_matrix_contains — Search for an element.
+
matrix_complex_realimag, igraph_matrix_complex_realimag —  Gives the real and imaginary parts of a complex matrix.
 

-
matrix_copy_to, igraph_matrix_copy_to —  Copies a matrix to a regular C array.
+
matrix_complex_zapsmall, igraph_matrix_complex_zapsmall —  Replaces small elements of a complex matrix by exact zeros.
 

-
matrix_destroy, igraph_matrix_destroy —  Destroys a matrix object.
+
matrix_contains, igraph_matrix_contains — Search for an element.
 

-
matrix_div_elements, igraph_matrix_div_elements — Elementwise division.
+
matrix_copy_to, igraph_matrix_copy_to —  Copies a matrix to a regular C array.
 

-
matrix_empty, igraph_matrix_empty —  Is the matrix empty?
+
matrix_destroy, igraph_matrix_destroy —  Destroys a matrix object.
 

-
matrix_fill, igraph_matrix_fill — Fill with an element.
+
matrix_div_elements, igraph_matrix_div_elements — Elementwise division.
 

-
matrix_get, igraph_matrix_get — Extract an element from a matrix.
+
matrix_empty, igraph_matrix_empty —  Is the matrix empty?
 

-
matrix_get_col, igraph_matrix_get_col —  Select a column.
+
matrix_fill, igraph_matrix_fill — Fill with an element.
 

-
matrix_get_ptr, igraph_matrix_get_ptr — Pointer to an element of a matrix.
+
matrix_get, igraph_matrix_get — Extract an element from a matrix.
 

-
matrix_get_row, igraph_matrix_get_row — Extract a row.
+
matrix_get_col, igraph_matrix_get_col —  Select a column.
 

-
matrix_init, igraph_matrix_init —  Initializes a matrix.
+
matrix_get_ptr, igraph_matrix_get_ptr — Pointer to an element of a matrix.
 

-
matrix_init_array, igraph_matrix_init_array —  Initializes a matrix from an ordinary C array (constructor).
+
matrix_get_row, igraph_matrix_get_row — Extract a row.
 

-
matrix_init_copy, igraph_matrix_init_copy —  Copies a matrix.
+
matrix_init, igraph_matrix_init —  Initializes a matrix.
 

-
matrix_isnull, igraph_matrix_isnull —  Checks for a null matrix.
+
matrix_init_array, igraph_matrix_init_array —  Initializes a matrix from an ordinary C array (constructor).
 

-
matrix_is_symmetric, igraph_matrix_is_symmetric —  Is the matrix symmetric?
+
matrix_init_copy, igraph_matrix_init_copy —  Copies a matrix.
 

-
matrix_max, igraph_matrix_max —  Largest element of a matrix.
+
matrix_isnull, igraph_matrix_isnull —  Checks for a null matrix.
 

-
matrix_maxdifference, igraph_matrix_maxdifference —  Maximum absolute difference between two matrices.
+
matrix_is_symmetric, igraph_matrix_is_symmetric —  Is the matrix symmetric?
 

-
matrix_min, igraph_matrix_min —  Smallest element of a matrix.
+
matrix_max, igraph_matrix_max —  Largest element of a matrix.
 

-
matrix_minmax, igraph_matrix_minmax —  Minimum and maximum elements of a matrix.
+
matrix_maxdifference, igraph_matrix_maxdifference —  Maximum absolute difference between two matrices.
 

-
matrix_mul_elements, igraph_matrix_mul_elements —  Elementwise matrix multiplication.
+
matrix_min, igraph_matrix_min —  Smallest element of a matrix.
 

-
matrix_ncol, igraph_matrix_ncol —  The number of columns in a matrix.
+
matrix_minmax, igraph_matrix_minmax —  Minimum and maximum elements of a matrix.
 

-
matrix_nrow, igraph_matrix_nrow —  The number of rows in a matrix.
+
matrix_mul_elements, igraph_matrix_mul_elements —  Elementwise matrix multiplication.
 

-
matrix_null, igraph_matrix_null —  Sets all elements in a matrix to zero.
+
matrix_ncol, igraph_matrix_ncol —  The number of columns in a matrix.
 

-
matrix_prod, igraph_matrix_prod —  Product of all matrix elements.
+
matrix_nrow, igraph_matrix_nrow —  The number of rows in a matrix.
 

-
matrix_rbind, igraph_matrix_rbind — Combine two matrices rowwise.
+
matrix_null, igraph_matrix_null —  Sets all elements in a matrix to zero.
 

-
matrix_remove_col, igraph_matrix_remove_col —  Removes a column from a matrix.
+
matrix_prod, igraph_matrix_prod —  Product of all matrix elements.
 

-
matrix_remove_row, igraph_matrix_remove_row — Remove a row.
+
matrix_rbind, igraph_matrix_rbind — Combine two matrices rowwise.
 

-
matrix_resize, igraph_matrix_resize —  Resizes a matrix.
+
matrix_remove_col, igraph_matrix_remove_col —  Removes a column from a matrix.
 

-
matrix_resize_min, igraph_matrix_resize_min —  Deallocates unused memory for a matrix.
+
matrix_remove_row, igraph_matrix_remove_row — Remove a row.
 

-
matrix_rowsum, igraph_matrix_rowsum —  Rowwise sum.
+
matrix_resize, igraph_matrix_resize —  Resizes a matrix.
 

-
matrix_scale, igraph_matrix_scale — Multiplies each element of the matrix by a constant.
+
matrix_resize_min, igraph_matrix_resize_min —  Deallocates unused memory for a matrix.
 

-
matrix_search, igraph_matrix_search — Search from a given position.
+
matrix_rowsum, igraph_matrix_rowsum —  Rowwise sum.
 

-
matrix_select_cols, igraph_matrix_select_cols —  Select some columns of a matrix.
+
matrix_scale, igraph_matrix_scale — Multiplies each element of the matrix by a constant.
 

-
matrix_select_rows, igraph_matrix_select_rows —  Select some rows of a matrix.
+
matrix_search, igraph_matrix_search — Search from a given position.
 

-
matrix_select_rows_cols, igraph_matrix_select_rows_cols —  Select some rows and columns of a matrix.
+
matrix_select_cols, igraph_matrix_select_cols —  Select some columns of a matrix.
 

-
matrix_set, igraph_matrix_set — Set an element.
+
matrix_select_rows, igraph_matrix_select_rows —  Select some rows of a matrix.
 

-
matrix_set_col, igraph_matrix_set_col — Set a column from a vector.
+
matrix_select_rows_cols, igraph_matrix_select_rows_cols —  Select some rows and columns of a matrix.
 

-
matrix_set_row, igraph_matrix_set_row — Set a row from a vector.
+
matrix_set, igraph_matrix_set — Set an element.
 

-
matrix_size, igraph_matrix_size —  The number of elements in a matrix.
+
matrix_set_col, igraph_matrix_set_col — Set a column from a vector.
 

-
matrix_sub, igraph_matrix_sub — Difference of two matrices.
+
matrix_set_row, igraph_matrix_set_row — Set a row from a vector.
 

-
matrix_sum, igraph_matrix_sum —  Sum of elements.
+
matrix_size, igraph_matrix_size —  The number of elements in a matrix.
 

-
matrix_swap, igraph_matrix_swap —  Swap two matrices.
+
matrix_sub, igraph_matrix_sub — Difference of two matrices.
 

-
matrix_swap_cols, igraph_matrix_swap_cols — Swap two columns.
+
matrix_sum, igraph_matrix_sum —  Sum of elements.
 

-
matrix_swap_rows, igraph_matrix_swap_rows — Swap two rows.
+
matrix_swap, igraph_matrix_swap —  Swap two matrices.
 

-
matrix_transpose, igraph_matrix_transpose —  Transpose of a matrix.
+
matrix_swap_cols, igraph_matrix_swap_cols — Swap two columns.
 

-
matrix_update, igraph_matrix_update — Update from another matrix.
+
matrix_swap_rows, igraph_matrix_swap_rows — Swap two rows.
 

-
matrix_view, igraph_matrix_view —  Creates a matrix view into an existing array.
+
matrix_transpose, igraph_matrix_transpose —  Transpose of a matrix.
 

-
matrix_view_from_vector, igraph_matrix_view_from_vector —  Creates a matrix view that treats an existing vector as a matrix.
+
matrix_update, igraph_matrix_update — Update from another matrix.
 

-
matrix_which_max, igraph_matrix_which_max —  Indices of the largest element.
+
matrix_view, igraph_matrix_view —  Creates a matrix view into an existing array.
 

-
matrix_which_min, igraph_matrix_which_min —  Indices of the smallest element.
+
matrix_view_from_vector, igraph_matrix_view_from_vector —  Creates a matrix view that treats an existing vector as a matrix.
 

-
matrix_which_minmax, igraph_matrix_which_minmax —  Indices of the minimum and maximum elements.
+
matrix_which_max, igraph_matrix_which_max —  Indices of the largest element.
 

-
matrix_zapsmall, igraph_matrix_zapsmall —  Replaces small elements of a matrix by exact zeros.
+
matrix_which_min, igraph_matrix_which_min —  Indices of the smallest element.
 

-
maxdegree, igraph_maxdegree —  The maximum degree in a graph (or set of vertices).
+
matrix_which_minmax, igraph_matrix_which_minmax —  Indices of the minimum and maximum elements.
 

-
maxflow, igraph_maxflow —  Maximum network flow between a pair of vertices.
+
matrix_zapsmall, igraph_matrix_zapsmall —  Replaces small elements of a matrix by exact zeros.
 

-
maxflow_stats_t, igraph_maxflow_stats_t —  Data structure holding statistics from the push-relabel maximum flow solver.
+
maxdegree, igraph_maxdegree —  The maximum degree in a graph (or set of vertices).
 

-
maxflow_value, igraph_maxflow_value —  Maximum flow in a network with the push/relabel algorithm.
+
maxflow, igraph_maxflow —  Maximum network flow between a pair of vertices.
 

-
maximal_cliques, igraph_maximal_cliques —  Finds all maximal cliques in a graph.
+
maxflow_stats_t, igraph_maxflow_stats_t —  Data structure holding statistics from the push-relabel maximum flow solver.
 

-
maximal_cliques_callback, igraph_maximal_cliques_callback —  Finds maximal cliques in a graph and calls a function for each one.
+
maxflow_value, igraph_maxflow_value —  Maximum flow in a network with the push/relabel algorithm.
 

-
maximal_cliques_count, igraph_maximal_cliques_count —  Count the number of maximal cliques in a graph.
+
maximal_cliques, igraph_maximal_cliques —  Finds all maximal cliques in a graph.
 

-
maximal_cliques_file, igraph_maximal_cliques_file —  Find maximal cliques and write them to a file.
+
maximal_cliques_callback, igraph_maximal_cliques_callback —  Finds maximal cliques in a graph and calls a function for each one.
 

-
maximal_cliques_hist, igraph_maximal_cliques_hist —  Counts the number of maximal cliques of each size in a graph.
+
maximal_cliques_count, igraph_maximal_cliques_count —  Count the number of maximal cliques in a graph.
 

-
maximal_cliques_subset, igraph_maximal_cliques_subset —  Maximal cliques for a subset of initial vertices.
+
maximal_cliques_file, igraph_maximal_cliques_file —  Find maximal cliques and write them to a file.
 

-
maximal_independent_vertex_sets, igraph_maximal_independent_vertex_sets —  Finds all maximal independent vertex sets of a graph.
+
maximal_cliques_hist, igraph_maximal_cliques_hist —  Counts the number of maximal cliques of each size in a graph.
 

-
maximum_bipartite_matching, igraph_maximum_bipartite_matching — Calculates a maximum matching in a bipartite graph.
+
maximal_cliques_subset, igraph_maximal_cliques_subset —  Maximal cliques for a subset of initial vertices.
 

-
maximum_cardinality_search, igraph_maximum_cardinality_search —  Maximum cardinality search.
+
maximal_independent_vertex_sets, igraph_maximal_independent_vertex_sets —  Finds all maximal independent vertex sets of a graph.
 

-
mean_degree, igraph_mean_degree —  The mean degree of a graph.
+
maximum_bipartite_matching, igraph_maximum_bipartite_matching — Calculates a maximum matching in a bipartite graph.
 

-
mincut, igraph_mincut —  Calculates the minimum cut in a graph.
+
maximum_cardinality_search, igraph_maximum_cardinality_search —  Maximum cardinality search.
 

-
mincut_value, igraph_mincut_value —  The minimum edge cut in a graph.
+
mean_degree, igraph_mean_degree —  The mean degree of a graph.
 

-
minimum_cycle_basis, igraph_minimum_cycle_basis —  Computes a minimum weight cycle basis.
+
mincut, igraph_mincut —  Calculates the minimum cut in a graph.
 

-
minimum_size_separators, igraph_minimum_size_separators —  Find all minimum size separating vertex sets.
+
mincut_value, igraph_mincut_value —  The minimum edge cut in a graph.
 

-
minimum_spanning_tree, igraph_minimum_spanning_tree —  Calculates one minimum spanning tree of a graph.
+
minimum_cycle_basis, igraph_minimum_cycle_basis —  Computes a minimum weight cycle basis.
 

-
minimum_spanning_tree_prim, igraph_minimum_spanning_tree_prim —  Calculates one minimum spanning tree of a weighted graph.
+
minimum_size_separators, igraph_minimum_size_separators —  Find all minimum size separating vertex sets.
 

-
minimum_spanning_tree_unweighted, igraph_minimum_spanning_tree_unweighted —  Calculates one minimum spanning tree of an unweighted graph.
+
minimum_spanning_tree, igraph_minimum_spanning_tree —  Calculates a minimum spanning tree of a graph.
 

-
modularity, igraph_modularity —  Calculates the modularity of a graph with respect to some clusters or vertex types.
+
modularity, igraph_modularity —  Calculates the modularity of a graph with respect to some clusters or vertex types.
 

-
modularity_matrix, igraph_modularity_matrix —  Calculates the modularity matrix.
+
modularity_matrix, igraph_modularity_matrix —  Calculates the modularity matrix.
 

-
moran_process, igraph_moran_process —  The Moran process in a network setting.
+
moran_process, igraph_moran_process —  The Moran process in a network setting.
 

-
motifs_handler_t, igraph_motifs_handler_t —  Callback type for igraph_motifs_randesu_callback.
+
motifs_handler_t, igraph_motifs_handler_t —  Callback type for igraph_motifs_randesu_callback.
 

-
motifs_randesu, igraph_motifs_randesu —  Count the number of motifs in a graph.
+
motifs_randesu, igraph_motifs_randesu —  Count the number of motifs in a graph.
 

-
motifs_randesu_callback, igraph_motifs_randesu_callback —  Finds motifs in a graph and calls a function for each of them.
+
motifs_randesu_callback, igraph_motifs_randesu_callback —  Finds motifs in a graph and calls a function for each of them.
 

-
motifs_randesu_estimate, igraph_motifs_randesu_estimate —  Estimate the total number of motifs in a graph.
+
motifs_randesu_estimate, igraph_motifs_randesu_estimate —  Estimate the total number of motifs in a graph.
 

-
motifs_randesu_no, igraph_motifs_randesu_no —  Count the total number of motifs in a graph.
+
motifs_randesu_no, igraph_motifs_randesu_no —  Count the total number of motifs in a graph.
 

 

 

 

 
N

 

-
neighborhood, igraph_neighborhood —  Calculate the neighborhood of vertices.
+
neighborhood, igraph_neighborhood —  Calculate the neighborhood of vertices.
 

-
neighborhood_graphs, igraph_neighborhood_graphs —  Create graphs from the neighborhood(s) of some vertex/vertices.
+
neighborhood_graphs, igraph_neighborhood_graphs —  Create graphs from the neighborhood(s) of some vertex/vertices.
 

-
neighborhood_size, igraph_neighborhood_size —  Calculates the size of the neighborhood of a given vertex.
+
neighborhood_size, igraph_neighborhood_size —  Calculates the size of the neighborhood of a given vertex.
 

 
neighbors, igraph_neighbors —  Adjacent vertices to a vertex.
 

@@ -1594,580 +1578,566 @@ 
O

 

 
P

 

-
pagerank, igraph_pagerank —  Calculates the Google PageRank for the specified vertices.
+
pagerank, igraph_pagerank —  Calculates the Google PageRank for the specified vertices.
 

-
pagerank_algo_t, igraph_pagerank_algo_t —  PageRank algorithm implementation.
+
pagerank_algo_t, igraph_pagerank_algo_t —  PageRank algorithm implementation.
 

-
path_length_hist, igraph_path_length_hist — Create a histogram of all shortest path lengths.
+
path_length_hist, igraph_path_length_hist — Create a histogram of all shortest path lengths.
 

-
permute_vertices, igraph_permute_vertices —  Permute the vertices.
+
permute_vertices, igraph_permute_vertices —  Permute the vertices.
 

-
personalized_pagerank, igraph_personalized_pagerank —  Calculates the personalized Google PageRank for the specified vertices.
+
personalized_pagerank, igraph_personalized_pagerank —  Calculates the personalized Google PageRank for the specified vertices.
 

-
personalized_pagerank_vs, igraph_personalized_pagerank_vs —  Calculates the personalized Google PageRank for the specified vertices.
+
personalized_pagerank_vs, igraph_personalized_pagerank_vs —  Calculates the personalized Google PageRank for the specified vertices.
 

-
plfit_result_calculate_p_value, igraph_plfit_result_calculate_p_value —  Calculates the p-value of a fitted power-law model.
+
plfit_result_calculate_p_value, igraph_plfit_result_calculate_p_value —  Calculates the p-value of a fitted power-law model.
 

-
plfit_result_t, igraph_plfit_result_t —  Result of fitting a power-law distribution to a vector.
+
plfit_result_t, igraph_plfit_result_t —  Result of fitting a power-law distribution to a vector.
 

-
power_law_fit, igraph_power_law_fit —  Fits a power-law distribution to a vector of numbers.
+
power_law_fit, igraph_power_law_fit —  Fits a power-law distribution to a vector of numbers.
 

-
preference_game, igraph_preference_game —  Generates a graph with vertex types and connection preferences.
+
preference_game, igraph_preference_game —  Generates a graph with vertex types and connection preferences.
 

-
PROGRESS, IGRAPH_PROGRESS —  Report the progress of a calculation from an igraph function (macro variant).
+
PROGRESS, IGRAPH_PROGRESS —  Report the progress of a calculation from an igraph function (macro variant).
 

-
progress, igraph_progress —  Report the progress of a calculation from an igraph function.
+
progress, igraph_progress —  Report the progress of a calculation from an igraph function.
 

-
PROGRESSF, IGRAPH_PROGRESSF —  Report the progress of a calculation from an igraph function, printf-like (macro variant).
+
PROGRESSF, IGRAPH_PROGRESSF —  Report the progress of a calculation from an igraph function, printf-like (macro variant).
 

-
progressf, igraph_progressf —  Report the progress of a calculation from an igraph function, printf-like.
+
progressf, igraph_progressf —  Report the progress of a calculation from an igraph function, printf-like.
 

-
progress_handler_stderr, igraph_progress_handler_stderr —  A simple predefined progress handler.
+
progress_handler_stderr, igraph_progress_handler_stderr —  A simple predefined progress handler.
 

-
progress_handler_t, igraph_progress_handler_t —  Type of progress handler functions
+
progress_handler_t, igraph_progress_handler_t —  Type of progress handler functions
 

-
pseudo_diameter, igraph_pseudo_diameter —  Approximation and lower bound of diameter.
+
pseudo_diameter, igraph_pseudo_diameter —  Approximation and lower bound of diameter.
 

-
pseudo_diameter_dijkstra, igraph_pseudo_diameter_dijkstra —  Approximation and lower bound of the diameter of a weighted graph.
+
pseudo_diameter_dijkstra, igraph_pseudo_diameter_dijkstra —  Approximation and lower bound of the diameter of a weighted graph.
 

-
psumtree_destroy, igraph_psumtree_destroy —  Destroys a partial prefix sum tree.
+
psumtree_destroy, igraph_psumtree_destroy —  Destroys a partial prefix sum tree.
 

-
psumtree_get, igraph_psumtree_get —  Retrieves the value corresponding to an item in the tree.
+
psumtree_get, igraph_psumtree_get —  Retrieves the value corresponding to an item in the tree.
 

-
psumtree_init, igraph_psumtree_init —  Initializes a partial prefix sum tree.
+
psumtree_init, igraph_psumtree_init —  Initializes a partial prefix sum tree.
 

-
psumtree_reset, igraph_psumtree_reset —  Resets all the values in the tree to zero.
+
psumtree_reset, igraph_psumtree_reset —  Resets all the values in the tree to zero.
 

-
psumtree_search, igraph_psumtree_search —  Finds an item in the tree, given a value.
+
psumtree_search, igraph_psumtree_search —  Finds an item in the tree, given a value.
 

-
psumtree_size, igraph_psumtree_size —  Returns the size of the tree.
+
psumtree_size, igraph_psumtree_size —  Returns the size of the tree.
 

-
psumtree_sum, igraph_psumtree_sum —  Returns the sum of the values of the leaves in the tree.
+
psumtree_sum, igraph_psumtree_sum —  Returns the sum of the values of the leaves in the tree.
 

-
psumtree_update, igraph_psumtree_update —  Updates the value associated to an item in the tree.
+
psumtree_update, igraph_psumtree_update —  Updates the value associated to an item in the tree.
 

 

 

 

 
R

 

-
radius, igraph_radius —  Radius of a graph.
-

-
radius_dijkstra, igraph_radius_dijkstra —  Radius of a graph, using weighted edges.
-

-
random_edge_walk, igraph_random_edge_walk —  Performs a random walk on a graph and returns the traversed edges.
+
radius, igraph_radius —  Radius of a graph.
 

-
random_sample, igraph_random_sample —  Generates an increasing random sequence of integers.
+
radius_dijkstra, igraph_radius_dijkstra —  Radius of a graph, using weighted edges.
 

-
random_spanning_tree, igraph_random_spanning_tree —  Uniformly samples the spanning trees of a graph.
+
random_sample, igraph_random_sample —  Generates an increasing random sequence of integers.
 

-
random_walk, igraph_random_walk —  Performs a random walk on a graph.
+
random_spanning_tree, igraph_random_spanning_tree —  Uniformly samples the spanning trees of a graph.
 

-
reachability, igraph_reachability —  Calculates which vertices are reachable from each vertex in the graph.
+
random_walk, igraph_random_walk —  Performs a random walk on a graph.
 

-
read_graph_dimacs, igraph_read_graph_dimacs —  Read a graph in DIMACS format (deprecated alias).
+
reachability, igraph_reachability —  Calculates which vertices are reachable from each vertex in the graph.
 

-
read_graph_dimacs_flow, igraph_read_graph_dimacs_flow —  Read a graph in DIMACS format.
+
read_graph_dimacs_flow, igraph_read_graph_dimacs_flow —  Read a graph in DIMACS format.
 

-
read_graph_dl, igraph_read_graph_dl —  Reads a file in the DL format of UCINET.
+
read_graph_dl, igraph_read_graph_dl —  Reads a file in the DL format of UCINET.
 

-
read_graph_edgelist, igraph_read_graph_edgelist —  Reads an edge list from a file and creates a graph.
+
read_graph_edgelist, igraph_read_graph_edgelist —  Reads an edge list from a file and creates a graph.
 

-
read_graph_gml, igraph_read_graph_gml —  Read a graph in GML format.
+
read_graph_gml, igraph_read_graph_gml —  Read a graph in GML format.
 

-
read_graph_graphdb, igraph_read_graph_graphdb —  Read a graph in the binary graph database format.
+
read_graph_graphdb, igraph_read_graph_graphdb —  Read a graph in the binary graph database format.
 

-
read_graph_graphml, igraph_read_graph_graphml —  Reads a graph from a GraphML file.
+
read_graph_graphml, igraph_read_graph_graphml —  Reads a graph from a GraphML file.
 

-
read_graph_lgl, igraph_read_graph_lgl —  Reads a graph from an .lgl file.
+
read_graph_lgl, igraph_read_graph_lgl —  Reads a graph from an .lgl file.
 

-
read_graph_ncol, igraph_read_graph_ncol —  Reads an .ncol file used by LGL.
+
read_graph_ncol, igraph_read_graph_ncol —  Reads an .ncol file used by LGL.
 

-
read_graph_pajek, igraph_read_graph_pajek —  Reads a file in Pajek format.
+
read_graph_pajek, igraph_read_graph_pajek —  Reads a file in Pajek format.
 

-
realize_bipartite_degree_sequence, igraph_realize_bipartite_degree_sequence —  Generates a bipartite graph with the given bidegree sequence.
+
realize_bipartite_degree_sequence, igraph_realize_bipartite_degree_sequence —  Generates a bipartite graph with the given bidegree sequence.
 

-
realize_degree_sequence, igraph_realize_degree_sequence —  Generates a graph with the given degree sequence.
+
realize_degree_sequence, igraph_realize_degree_sequence —  Generates a graph with the given degree sequence.
 

 
realloc, igraph_realloc —  Reallocate memory that can be safely deallocated by igraph functions.
 

-
recent_degree_aging_game, igraph_recent_degree_aging_game —  Preferential attachment based on the number of edges gained recently, with aging of vertices.
+
recent_degree_aging_game, igraph_recent_degree_aging_game —  Preferential attachment based on the number of edges gained recently, with aging of vertices.
 

-
recent_degree_game, igraph_recent_degree_game —  Stochastic graph generator based on the number of incident edges a node has gained recently.
+
recent_degree_game, igraph_recent_degree_game —  Stochastic graph generator based on the number of incident edges a node has gained recently.
 

-
reciprocity, igraph_reciprocity —  Calculates the reciprocity of a directed graph.
+
reciprocity, igraph_reciprocity —  Calculates the reciprocity of a directed graph.
 

-
regular_tree, igraph_regular_tree —  Creates a regular tree.
+
regular_tree, igraph_regular_tree —  Creates a regular tree.
 

-
reindex_membership, igraph_reindex_membership —  Makes the IDs in a membership vector contiguous.
+
reindex_membership, igraph_reindex_membership —  Makes the IDs in a membership vector contiguous.
 

-
reverse_edges, igraph_reverse_edges —  Reverses some edges of a directed graph.
+
reverse_edges, igraph_reverse_edges —  Reverses some edges of a directed graph.
 

-
rewire, igraph_rewire —  Randomly rewires a graph while preserving its degree sequence.
+
rewire, igraph_rewire —  Randomly rewires a graph while preserving its degree sequence.
 

-
rewire_directed_edges, igraph_rewire_directed_edges —  Rewires the chosen endpoint of directed edges.
+
rewire_directed_edges, igraph_rewire_directed_edges —  Rewires the chosen endpoint of directed edges.
 

-
rewire_edges, igraph_rewire_edges —  Rewires the edges of a graph with constant probability.
+
rewire_edges, igraph_rewire_edges —  Rewires the edges of a graph with constant probability.
 

-
ring, igraph_ring —  Creates a cycle graph or a path graph.
+
ring, igraph_ring —  Creates a cycle graph or a path graph.
 

-
rngtype_glibc2, igraph_rngtype_glibc2 —  The random number generator introduced in GNU libc 2.
+
rngtype_glibc2, igraph_rngtype_glibc2 —  The random number generator introduced in GNU libc 2.
 

-
rngtype_mt19937, igraph_rngtype_mt19937 —  The MT19937 random number generator.
+
rngtype_mt19937, igraph_rngtype_mt19937 —  The MT19937 random number generator.
 

-
rngtype_pcg32, igraph_rngtype_pcg32 —  The PCG random number generator (32-bit version).
+
rngtype_pcg32, igraph_rngtype_pcg32 —  The PCG random number generator (32-bit version).
 

-
rngtype_pcg64, igraph_rngtype_pcg64 —  The PCG random number generator (64-bit version).
+
rngtype_pcg64, igraph_rngtype_pcg64 —  The PCG random number generator (64-bit version).
 

-
rng_bits, igraph_rng_bits —  The number of random bits that a random number generator can produces in a single round.
+
rng_bits, igraph_rng_bits —  The number of random bits that a random number generator can produces in a single round.
 

-
rng_default, igraph_rng_default —  Query the default random number generator.
+
rng_default, igraph_rng_default —  Query the default random number generator.
 

-
rng_destroy, igraph_rng_destroy —  Deallocates memory associated with a random number generator.
+
rng_destroy, igraph_rng_destroy —  Deallocates memory associated with a random number generator.
 

-
rng_get_binom, igraph_rng_get_binom —  Samples from a binomial distribution.
+
rng_get_binom, igraph_rng_get_binom —  Samples from a binomial distribution.
 

-
rng_get_exp, igraph_rng_get_exp —  Samples from an exponential distribution.
+
rng_get_exp, igraph_rng_get_exp —  Samples from an exponential distribution.
 

-
rng_get_gamma, igraph_rng_get_gamma —  Samples from a gamma distribution.
+
rng_get_gamma, igraph_rng_get_gamma —  Samples from a gamma distribution.
 

-
rng_get_geom, igraph_rng_get_geom —  Samples from a geometric distribution.
+
rng_get_geom, igraph_rng_get_geom —  Samples from a geometric distribution.
 

-
rng_get_integer, igraph_rng_get_integer —  Generate an integer random number from an interval.
+
rng_get_integer, igraph_rng_get_integer —  Generate an integer random number from an interval.
 

-
rng_get_normal, igraph_rng_get_normal —  Samples from a normal distribution.
+
rng_get_normal, igraph_rng_get_normal —  Samples from a normal distribution.
 

-
rng_get_pois, igraph_rng_get_pois —  Samples from a Poisson distribution.
+
rng_get_pois, igraph_rng_get_pois —  Samples from a Poisson distribution.
 

-
rng_get_unif, igraph_rng_get_unif —  Samples real numbers from a given interval.
+
rng_get_unif, igraph_rng_get_unif —  Samples real numbers from a given interval.
 

-
rng_get_unif01, igraph_rng_get_unif01 —  Samples uniformly from the unit interval.
+
rng_get_unif01, igraph_rng_get_unif01 —  Samples uniformly from the unit interval.
 

-
rng_init, igraph_rng_init —  Initializes a random number generator.
+
rng_init, igraph_rng_init —  Initializes a random number generator.
 

-
rng_max, igraph_rng_max —  The maximum possible integer for a random number generator.
+
rng_max, igraph_rng_max —  The maximum possible integer for a random number generator.
 

-
rng_name, igraph_rng_name —  The type of a random number generator.
+
rng_name, igraph_rng_name —  The type of a random number generator.
 

-
rng_seed, igraph_rng_seed —  Seeds a random number generator.
+
rng_seed, igraph_rng_seed —  Seeds a random number generator.
 

-
rng_set_default, igraph_rng_set_default —  Set the default igraph random number generator.
+
rng_set_default, igraph_rng_set_default —  Set the default igraph random number generator.
 

-
roots_for_tree_layout, igraph_roots_for_tree_layout —  Roots suitable for a nice tree layout.
+
roots_for_tree_layout, igraph_roots_for_tree_layout —  Roots suitable for a nice tree layout.
 

-
roulette_wheel_imitation, igraph_roulette_wheel_imitation —  Adopt a strategy via roulette wheel selection.
+
roulette_wheel_imitation, igraph_roulette_wheel_imitation —  Adopt a strategy via roulette wheel selection.
 

-
running_mean, igraph_running_mean —  Calculates the running mean of a vector.
+
running_mean, igraph_running_mean —  Calculates the running mean of a vector.
 

 

 

 

 
S

 

-
sample_dirichlet, igraph_sample_dirichlet —  Sample points from a Dirichlet distribution.
+
sample_dirichlet, igraph_sample_dirichlet —  Sample points from a Dirichlet distribution.
 

-
sample_sphere_surface, igraph_sample_sphere_surface —  Sample points uniformly from the surface of a sphere.
+
sample_sphere_surface, igraph_sample_sphere_surface —  Sample points uniformly from the surface of a sphere.
 

-
sample_sphere_volume, igraph_sample_sphere_volume —  Sample points uniformly from the volume of a sphere.
+
sample_sphere_volume, igraph_sample_sphere_volume —  Sample points uniformly from the volume of a sphere.
 

-
sbm_game, igraph_sbm_game —  Sample from a stochastic block model.
+
sbm_game, igraph_sbm_game —  Sample from a stochastic block model.
 

-
SETEAB, SETEAB — Set a boolean edge attribute
+
SETEAB, SETEAB — Set a boolean edge attribute
 

-
SETEABV, SETEABV — Set a boolean edge attribute for all edges
+
SETEABV, SETEABV — Set a boolean edge attribute for all edges
 

-
SETEAN, SETEAN — Set a numeric edge attribute
+
SETEAN, SETEAN — Set a numeric edge attribute
 

-
SETEANV, SETEANV — Set a numeric edge attribute for all edges
+
SETEANV, SETEANV — Set a numeric edge attribute for all edges
 

-
SETEAS, SETEAS — Set a string edge attribute
+
SETEAS, SETEAS — Set a string edge attribute
 

-
SETEASV, SETEASV — Set a string edge attribute for all edges
+
SETEASV, SETEASV — Set a string edge attribute for all edges
 

-
SETGAB, SETGAB — Set a boolean graph attribute
+
SETGAB, SETGAB — Set a boolean graph attribute
 

-
SETGAN, SETGAN — Set a numeric graph attribute
+
SETGAN, SETGAN — Set a numeric graph attribute
 

-
SETGAS, SETGAS — Set a string graph attribute
+
SETGAS, SETGAS — Set a string graph attribute
 

-
SETVAB, SETVAB — Set a boolean vertex attribute
+
SETVAB, SETVAB — Set a boolean vertex attribute
 

-
SETVABV, SETVABV — Set a boolean vertex attribute for all vertices
+
SETVABV, SETVABV — Set a boolean vertex attribute for all vertices
 

-
SETVAN, SETVAN — Set a numeric vertex attribute
+
SETVAN, SETVAN — Set a numeric vertex attribute
 

-
SETVANV, SETVANV — Set a numeric vertex attribute for all vertices
+
SETVANV, SETVANV — Set a numeric vertex attribute for all vertices
 

-
SETVAS, SETVAS — Set a string vertex attribute
+
SETVAS, SETVAS — Set a string vertex attribute
 

-
SETVASV, SETVASV — Set a string vertex attribute for all vertices
+
SETVASV, SETVASV — Set a string vertex attribute for all vertices
 

-
set_attribute_table, igraph_set_attribute_table —  Attach an attribute table.
+
set_attribute_table, igraph_set_attribute_table —  Attach an attribute table.
 

 
set_error_handler, igraph_set_error_handler —  Sets a new error handler.
 

 
set_fatal_handler, igraph_set_fatal_handler —  Installs a fatal error handler.
 

-
set_progress_handler, igraph_set_progress_handler —  Install a progress handler, or remove the current handler.
+
set_progress_handler, igraph_set_progress_handler —  Install a progress handler, or remove the current handler.
 

-
set_status_handler, igraph_set_status_handler — Install of uninstall a status handler function.
+
set_status_handler, igraph_set_status_handler — Install of uninstall a status handler function.
 

 
set_warning_handler, igraph_set_warning_handler —  Installs a warning handler.
 

-
similarity_dice, igraph_similarity_dice —  Dice similarity coefficient.
+
similarity_dice, igraph_similarity_dice —  Dice similarity coefficient.
 

-
similarity_dice_es, igraph_similarity_dice_es —  Dice similarity coefficient for a given edge selector.
+
similarity_dice_es, igraph_similarity_dice_es —  Dice similarity coefficient for a given edge selector.
 

-
similarity_dice_pairs, igraph_similarity_dice_pairs —  Dice similarity coefficient for given vertex pairs.
+
similarity_dice_pairs, igraph_similarity_dice_pairs —  Dice similarity coefficient for given vertex pairs.
 

-
similarity_inverse_log_weighted, igraph_similarity_inverse_log_weighted —  Vertex similarity based on the inverse logarithm of vertex degrees.
+
similarity_inverse_log_weighted, igraph_similarity_inverse_log_weighted —  Vertex similarity based on the inverse logarithm of vertex degrees.
 

-
similarity_jaccard, igraph_similarity_jaccard —  Jaccard similarity coefficient for the given vertices.
+
similarity_jaccard, igraph_similarity_jaccard —  Jaccard similarity coefficient for the given vertices.
 

-
similarity_jaccard_es, igraph_similarity_jaccard_es —  Jaccard similarity coefficient for a given edge selector.
+
similarity_jaccard_es, igraph_similarity_jaccard_es —  Jaccard similarity coefficient for a given edge selector.
 

-
similarity_jaccard_pairs, igraph_similarity_jaccard_pairs —  Jaccard similarity coefficient for given vertex pairs.
+
similarity_jaccard_pairs, igraph_similarity_jaccard_pairs —  Jaccard similarity coefficient for given vertex pairs.
 

-
simple_interconnected_islands_game, igraph_simple_interconnected_islands_game —  Generates a random graph made of several interconnected islands, each island being a random graph.
+
simple_interconnected_islands_game, igraph_simple_interconnected_islands_game —  Generates a random graph made of several interconnected islands, each island being a random graph.
 

-
simplify, igraph_simplify —  Removes loop and/or multiple edges from the graph.
+
simplify, igraph_simplify —  Removes loop and/or multiple edges from the graph.
 

-
simplify_and_colorize, igraph_simplify_and_colorize —  Simplify the graph and compute self-loop and edge multiplicities.
+
simplify_and_colorize, igraph_simplify_and_colorize —  Simplify the graph and compute self-loop and edge multiplicities.
 

-
sir, igraph_sir —  Performs a number of SIR epidemics model runs on a graph.
+
sir, igraph_sir —  Performs a number of SIR epidemics model runs on a graph.
 

-
sir_destroy, igraph_sir_destroy —  Deallocates memory associated with a SIR simulation run.
+
sir_destroy, igraph_sir_destroy —  Deallocates memory associated with a SIR simulation run.
 

-
sir_t, igraph_sir_t —  The result of one SIR model simulation.
+
sir_t, igraph_sir_t —  The result of one SIR model simulation.
 

-
small, igraph_small —  Shorthand to create a small graph, giving the edges as arguments.
+
small, igraph_small —  Shorthand to create a small graph, giving the edges as arguments.
 

-
spanner, igraph_spanner —  Calculates a spanner of a graph with a given stretch factor.
+
spanner, igraph_spanner —  Calculates a spanner of a graph with a given stretch factor.
 

-
sparsemat, igraph_sparsemat —  Creates an igraph graph from a sparse matrix.
+
sparsemat, igraph_sparsemat —  Creates an igraph graph from a sparse matrix.
 

-
sparsemat_add, igraph_sparsemat_add —  Sum of two sparse matrices.
+
sparsemat_add, igraph_sparsemat_add —  Sum of two sparse matrices.
 

-
sparsemat_add_cols, igraph_sparsemat_add_cols —  Adds columns to a sparse matrix.
+
sparsemat_add_cols, igraph_sparsemat_add_cols —  Adds columns to a sparse matrix.
 

-
sparsemat_add_rows, igraph_sparsemat_add_rows —  Adds rows to a sparse matrix.
+
sparsemat_add_rows, igraph_sparsemat_add_rows —  Adds rows to a sparse matrix.
 

-
sparsemat_arpack_rnsolve, igraph_sparsemat_arpack_rnsolve —  Eigenvalues and eigenvectors of a nonsymmetric sparse matrix via ARPACK.
+
sparsemat_arpack_rnsolve, igraph_sparsemat_arpack_rnsolve —  Eigenvalues and eigenvectors of a nonsymmetric sparse matrix via ARPACK.
 

-
sparsemat_arpack_rssolve, igraph_sparsemat_arpack_rssolve —  Eigenvalues and eigenvectors of a symmetric sparse matrix via ARPACK.
+
sparsemat_arpack_rssolve, igraph_sparsemat_arpack_rssolve —  Eigenvalues and eigenvectors of a symmetric sparse matrix via ARPACK.
 

-
sparsemat_as_matrix, igraph_sparsemat_as_matrix —  Converts a sparse matrix to a dense matrix.
+
sparsemat_as_matrix, igraph_sparsemat_as_matrix —  Converts a sparse matrix to a dense matrix.
 

-
sparsemat_cholsol, igraph_sparsemat_cholsol —  Solves a symmetric linear system via Cholesky decomposition.
+
sparsemat_cholsol, igraph_sparsemat_cholsol —  Solves a symmetric linear system via Cholesky decomposition.
 

-
sparsemat_colsums, igraph_sparsemat_colsums —  Column-wise sums.
+
sparsemat_colsums, igraph_sparsemat_colsums —  Column-wise sums.
 

-
sparsemat_compress, igraph_sparsemat_compress —  Converts a sparse matrix to column-compressed format.
+
sparsemat_compress, igraph_sparsemat_compress —  Converts a sparse matrix to column-compressed format.
 

-
sparsemat_copy, igraph_sparsemat_copy —  Copies a sparse matrix (deprecated alias).
+
sparsemat_count_nonzero, igraph_sparsemat_count_nonzero —  Counts nonzero elements of a sparse matrix.
 

-
sparsemat_count_nonzero, igraph_sparsemat_count_nonzero —  Counts nonzero elements of a sparse matrix.
+
sparsemat_count_nonzerotol, igraph_sparsemat_count_nonzerotol —  Counts nonzero elements of a sparse matrix, ignoring elements close to zero.
 

-
sparsemat_count_nonzerotol, igraph_sparsemat_count_nonzerotol —  Counts nonzero elements of a sparse matrix, ignoring elements close to zero.
+
sparsemat_destroy, igraph_sparsemat_destroy —  Deallocates memory used by a sparse matrix.
 

-
sparsemat_destroy, igraph_sparsemat_destroy —  Deallocates memory used by a sparse matrix.
+
sparsemat_droptol, igraph_sparsemat_droptol —  Drops the almost zero elements from a sparse matrix.
 

-
sparsemat_diag, igraph_sparsemat_diag —  Creates a sparse diagonal matrix (deprecated alias).
+
sparsemat_dropzeros, igraph_sparsemat_dropzeros —  Drops the zero elements from a sparse matrix.
 

-
sparsemat_droptol, igraph_sparsemat_droptol —  Drops the almost zero elements from a sparse matrix.
+
sparsemat_dupl, igraph_sparsemat_dupl —  Removes duplicate elements from a sparse matrix.
 

-
sparsemat_dropzeros, igraph_sparsemat_dropzeros —  Drops the zero elements from a sparse matrix.
+
sparsemat_entry, igraph_sparsemat_entry —  Adds an element to a sparse matrix.
 

-
sparsemat_dupl, igraph_sparsemat_dupl —  Removes duplicate elements from a sparse matrix.
+
sparsemat_fkeep, igraph_sparsemat_fkeep —  Filters the elements of a sparse matrix.
 

-
sparsemat_entry, igraph_sparsemat_entry —  Adds an element to a sparse matrix.
+
sparsemat_gaxpy, igraph_sparsemat_gaxpy —  Matrix-vector product, added to another vector.
 

-
sparsemat_eye, igraph_sparsemat_eye —  Creates a sparse identity matrix (deprecated alias).
+
sparsemat_get, igraph_sparsemat_get —  Return the value of a single element from a sparse matrix.
 

-
sparsemat_fkeep, igraph_sparsemat_fkeep —  Filters the elements of a sparse matrix.
+
sparsemat_getelements, igraph_sparsemat_getelements —  Returns all elements of a sparse matrix.
 

-
sparsemat_gaxpy, igraph_sparsemat_gaxpy —  Matrix-vector product, added to another vector.
+
sparsemat_getelements_sorted, igraph_sparsemat_getelements_sorted —  Returns all elements of a sparse matrix, sorted by row and column indices.
 

-
sparsemat_get, igraph_sparsemat_get —  Return the value of a single element from a sparse matrix.
+
sparsemat_index, igraph_sparsemat_index —  Extracts a submatrix or a single element.
 

-
sparsemat_getelements, igraph_sparsemat_getelements —  Returns all elements of a sparse matrix.
+
sparsemat_init, igraph_sparsemat_init —  Initializes a sparse matrix, in triplet format.
 

-
sparsemat_getelements_sorted, igraph_sparsemat_getelements_sorted —  Returns all elements of a sparse matrix, sorted by row and column indices.
+
sparsemat_init_copy, igraph_sparsemat_init_copy —  Copies a sparse matrix.
 

-
sparsemat_index, igraph_sparsemat_index —  Extracts a submatrix or a single element.
+
sparsemat_init_diag, igraph_sparsemat_init_diag —  Creates a sparse diagonal matrix.
 

-
sparsemat_init, igraph_sparsemat_init —  Initializes a sparse matrix, in triplet format.
+
sparsemat_init_eye, igraph_sparsemat_init_eye —  Creates a sparse identity matrix.
 

-
sparsemat_init_copy, igraph_sparsemat_init_copy —  Copies a sparse matrix.
+
sparsemat_is_cc, igraph_sparsemat_is_cc —  Is this sparse matrix in column-compressed format?
 

-
sparsemat_init_diag, igraph_sparsemat_init_diag —  Creates a sparse diagonal matrix.
+
sparsemat_is_symmetric, igraph_sparsemat_is_symmetric —  Returns whether a sparse matrix is symmetric.
 

-
sparsemat_init_eye, igraph_sparsemat_init_eye —  Creates a sparse identity matrix.
+
sparsemat_is_triplet, igraph_sparsemat_is_triplet —  Is this sparse matrix in triplet format?
 

-
sparsemat_is_cc, igraph_sparsemat_is_cc —  Is this sparse matrix in column-compressed format?
+
sparsemat_iterator_col, igraph_sparsemat_iterator_col —  Return the column of the iterator.
 

-
sparsemat_is_symmetric, igraph_sparsemat_is_symmetric —  Returns whether a sparse matrix is symmetric.
+
sparsemat_iterator_end, igraph_sparsemat_iterator_end —  Query if the iterator is past the last element.
 

-
sparsemat_is_triplet, igraph_sparsemat_is_triplet —  Is this sparse matrix in triplet format?
+
sparsemat_iterator_get, igraph_sparsemat_iterator_get —  Return the element at the current iterator position.
 

-
sparsemat_iterator_col, igraph_sparsemat_iterator_col —  Return the column of the iterator.
+
sparsemat_iterator_idx, igraph_sparsemat_iterator_idx —  Returns the element vector index of a sparse matrix iterator.
 

-
sparsemat_iterator_end, igraph_sparsemat_iterator_end —  Query if the iterator is past the last element.
+
sparsemat_iterator_init, igraph_sparsemat_iterator_init —  Initialize a sparse matrix iterator.
 

-
sparsemat_iterator_get, igraph_sparsemat_iterator_get —  Return the element at the current iterator position.
+
sparsemat_iterator_next, igraph_sparsemat_iterator_next —  Let a sparse matrix iterator go to the next element.
 

-
sparsemat_iterator_idx, igraph_sparsemat_iterator_idx —  Returns the element vector index of a sparse matrix iterator.
+
sparsemat_iterator_reset, igraph_sparsemat_iterator_reset —  Reset a sparse matrix iterator to the first element.
 

-
sparsemat_iterator_init, igraph_sparsemat_iterator_init —  Initialize a sparse matrix iterator.
+
sparsemat_iterator_row, igraph_sparsemat_iterator_row —  Return the row of the iterator.
 

-
sparsemat_iterator_next, igraph_sparsemat_iterator_next —  Let a sparse matrix iterator go to the next element.
+
sparsemat_lsolve, igraph_sparsemat_lsolve —  Solves a lower-triangular linear system.
 

-
sparsemat_iterator_reset, igraph_sparsemat_iterator_reset —  Reset a sparse matrix iterator to the first element.
+
sparsemat_ltsolve, igraph_sparsemat_ltsolve —  Solves an upper-triangular linear system.
 

-
sparsemat_iterator_row, igraph_sparsemat_iterator_row —  Return the row of the iterator.
+
sparsemat_lu, igraph_sparsemat_lu —  LU decomposition of a sparse matrix.
 

-
sparsemat_lsolve, igraph_sparsemat_lsolve —  Solves a lower-triangular linear system.
+
sparsemat_luresol, igraph_sparsemat_luresol —  Solves a linear system using a precomputed LU decomposition.
 

-
sparsemat_ltsolve, igraph_sparsemat_ltsolve —  Solves an upper-triangular linear system.
+
sparsemat_lusol, igraph_sparsemat_lusol —  Solves a linear system via LU decomposition.
 

-
sparsemat_lu, igraph_sparsemat_lu —  LU decomposition of a sparse matrix.
+
sparsemat_max, igraph_sparsemat_max —  Maximum of a sparse matrix.
 

-
sparsemat_luresol, igraph_sparsemat_luresol —  Solves a linear system using a precomputed LU decomposition.
+
sparsemat_min, igraph_sparsemat_min —  Minimum of a sparse matrix.
 

-
sparsemat_lusol, igraph_sparsemat_lusol —  Solves a linear system via LU decomposition.
+
sparsemat_minmax, igraph_sparsemat_minmax —  Minimum and maximum of a sparse matrix.
 

-
sparsemat_max, igraph_sparsemat_max —  Maximum of a sparse matrix.
+
sparsemat_multiply, igraph_sparsemat_multiply —  Matrix multiplication.
 

-
sparsemat_min, igraph_sparsemat_min —  Minimum of a sparse matrix.
+
sparsemat_ncol, igraph_sparsemat_ncol —  Number of columns.
 

-
sparsemat_minmax, igraph_sparsemat_minmax —  Minimum and maximum of a sparse matrix.
+
sparsemat_nonzero_storage, igraph_sparsemat_nonzero_storage —  Returns number of stored entries of a sparse matrix.
 

-
sparsemat_multiply, igraph_sparsemat_multiply —  Matrix multiplication.
+
sparsemat_nrow, igraph_sparsemat_nrow —  Number of rows.
 

-
sparsemat_ncol, igraph_sparsemat_ncol —  Number of columns.
+
sparsemat_numeric_destroy, igraph_sparsemat_numeric_destroy —  Deallocates memory after a numeric decomposition.
 

-
sparsemat_nonzero_storage, igraph_sparsemat_nonzero_storage —  Returns number of stored entries of a sparse matrix.
+
sparsemat_permute, igraph_sparsemat_permute —  Permutes the rows and columns of a sparse matrix.
 

-
sparsemat_nrow, igraph_sparsemat_nrow —  Number of rows.
+
sparsemat_print, igraph_sparsemat_print —  Prints a sparse matrix to a file.
 

-
sparsemat_numeric_destroy, igraph_sparsemat_numeric_destroy —  Deallocates memory after a numeric decomposition.
+
sparsemat_qr, igraph_sparsemat_qr —  QR decomposition of a sparse matrix.
 

-
sparsemat_permute, igraph_sparsemat_permute —  Permutes the rows and columns of a sparse matrix.
+
sparsemat_qrresol, igraph_sparsemat_qrresol —  Solves a linear system using a precomputed QR decomposition.
 

-
sparsemat_print, igraph_sparsemat_print —  Prints a sparse matrix to a file.
+
sparsemat_realloc, igraph_sparsemat_realloc —  Allocates more (or less) memory for a sparse matrix.
 

-
sparsemat_qr, igraph_sparsemat_qr —  QR decomposition of a sparse matrix.
+
sparsemat_resize, igraph_sparsemat_resize —  Resizes a sparse matrix and clears all the elements.
 

-
sparsemat_qrresol, igraph_sparsemat_qrresol —  Solves a linear system using a precomputed QR decomposition.
+
sparsemat_rowsums, igraph_sparsemat_rowsums —  Row-wise sums.
 

-
sparsemat_realloc, igraph_sparsemat_realloc —  Allocates more (or less) memory for a sparse matrix.
+
sparsemat_scale, igraph_sparsemat_scale —  Scales a sparse matrix.
 

-
sparsemat_resize, igraph_sparsemat_resize —  Resizes a sparse matrix and clears all the elements.
+
sparsemat_sort, igraph_sparsemat_sort —  Sorts all elements of a sparse matrix by row and column indices.
 

-
sparsemat_rowsums, igraph_sparsemat_rowsums —  Row-wise sums.
+
sparsemat_symblu, igraph_sparsemat_symblu —  Symbolic LU decomposition.
 

-
sparsemat_scale, igraph_sparsemat_scale —  Scales a sparse matrix.
+
sparsemat_symbolic_destroy, igraph_sparsemat_symbolic_destroy —  Deallocates memory after a symbolic decomposition.
 

-
sparsemat_sort, igraph_sparsemat_sort —  Sorts all elements of a sparse matrix by row and column indices.
+
sparsemat_symbqr, igraph_sparsemat_symbqr —  Symbolic QR decomposition.
 

-
sparsemat_symblu, igraph_sparsemat_symblu —  Symbolic LU decomposition.
+
sparsemat_transpose, igraph_sparsemat_transpose —  Transposes a sparse matrix.
 

-
sparsemat_symbolic_destroy, igraph_sparsemat_symbolic_destroy —  Deallocates memory after a symbolic decomposition.
+
sparsemat_type, igraph_sparsemat_type —  Type of a sparse matrix (triplet or column-compressed).
 

-
sparsemat_symbqr, igraph_sparsemat_symbqr —  Symbolic QR decomposition.
+
sparsemat_usolve, igraph_sparsemat_usolve —  Solves an upper-triangular linear system.
 

-
sparsemat_transpose, igraph_sparsemat_transpose —  Transposes a sparse matrix.
+
sparsemat_utsolve, igraph_sparsemat_utsolve —  Solves a lower-triangular linear system.
 

-
sparsemat_type, igraph_sparsemat_type —  Type of a sparse matrix (triplet or column-compressed).
+
sparsemat_view, igraph_sparsemat_view —  Initialize a sparse matrix and set all parameters.
 

-
sparsemat_usolve, igraph_sparsemat_usolve —  Solves an upper-triangular linear system.
+
sparse_adjacency, igraph_sparse_adjacency —  Creates a graph from a sparse adjacency matrix.
 

-
sparsemat_utsolve, igraph_sparsemat_utsolve —  Solves a lower-triangular linear system.
+
sparse_weighted_adjacency, igraph_sparse_weighted_adjacency —  Creates a graph from a weighted sparse adjacency matrix.
 

-
sparsemat_view, igraph_sparsemat_view —  Initialize a sparse matrix and set all parameters.
+
split_join_distance, igraph_split_join_distance —  Calculates the split-join distance of two community structures.
 

-
sparse_adjacency, igraph_sparse_adjacency —  Creates a graph from a sparse adjacency matrix.
+
square_lattice, igraph_square_lattice —  Arbitrary dimensional square lattices.
 

-
sparse_weighted_adjacency, igraph_sparse_weighted_adjacency —  Creates a graph from a weighted sparse adjacency matrix.
+
stack_clear, igraph_stack_clear —  Removes all elements from a stack.
 

-
split_join_distance, igraph_split_join_distance —  Calculates the split-join distance of two community structures.
+
stack_destroy, igraph_stack_destroy —  Destroys a stack object.
 

-
square_lattice, igraph_square_lattice —  Arbitrary dimensional square lattices.
+
stack_empty, igraph_stack_empty —  Decides whether a stack object is empty.
 

-
stack_clear, igraph_stack_clear —  Removes all elements from a stack.
+
stack_init, igraph_stack_init —  Initializes a stack.
 

-
stack_destroy, igraph_stack_destroy —  Destroys a stack object.
+
stack_pop, igraph_stack_pop —  Removes and returns an element from the top of a stack.
 

-
stack_empty, igraph_stack_empty —  Decides whether a stack object is empty.
+
stack_push, igraph_stack_push —  Places an element on the top of a stack.
 

-
stack_init, igraph_stack_init —  Initializes a stack.
+
stack_reserve, igraph_stack_reserve —  Reserve memory.
 

-
stack_pop, igraph_stack_pop —  Removes and returns an element from the top of a stack.
+
stack_size, igraph_stack_size —  Returns the number of elements in a stack.
 

-
stack_push, igraph_stack_push —  Places an element on the top of a stack.
+
stack_top, igraph_stack_top —  Query top element.
 

-
stack_reserve, igraph_stack_reserve —  Reserve memory.
+
star, igraph_star —  Creates a star graph, every vertex connects only to the center.
 

-
stack_size, igraph_stack_size —  Returns the number of elements in a stack.
+
static_fitness_game, igraph_static_fitness_game —  Non-growing random graph with edge probabilities proportional to node fitness scores.
 

-
stack_top, igraph_stack_top —  Query top element.
+
static_power_law_game, igraph_static_power_law_game —  Generates a non-growing random graph with expected power-law degree distributions.
 

-
star, igraph_star —  Creates a star graph, every vertex connects only to the center.
+
STATUS, IGRAPH_STATUS — Report the status of an igraph function.
 

-
static_fitness_game, igraph_static_fitness_game —  Non-growing random graph with edge probabilities proportional to node fitness scores.
+
status, igraph_status —  Reports status from an igraph function.
 

-
static_power_law_game, igraph_static_power_law_game —  Generates a non-growing random graph with expected power-law degree distributions.
+
STATUSF, IGRAPH_STATUSF — Report the status from an igraph function
 

-
STATUS, IGRAPH_STATUS — Report the status of an igraph function.
+
statusf, igraph_statusf —  Report status, more flexible printf-like version.
 

-
status, igraph_status —  Reports status from an igraph function.
+
status_handler_stderr, igraph_status_handler_stderr — A simple predefined status handler function.
 

-
STATUSF, IGRAPH_STATUSF — Report the status from an igraph function
+
status_handler_t, igraph_status_handler_t — The type of the igraph status handler functions
 

-
statusf, igraph_statusf —  Report status, more flexible printf-like version.
+
stochastic_imitation, igraph_stochastic_imitation —  Adopt a strategy via stochastic imitation with uniform selection.
 

-
status_handler_stderr, igraph_status_handler_stderr — A simple predefined status handler function.
+
STR, STR —  Indexing string vectors.
 

-
status_handler_t, igraph_status_handler_t — The type of the igraph status handler functions
-

-
stochastic_imitation, igraph_stochastic_imitation —  Adopt a strategy via stochastic imitation with uniform selection.
-

-
STR, STR —  Indexing string vectors.
-

-
strength, igraph_strength —  Strength of the vertices, also called weighted vertex degree.
+
strength, igraph_strength —  Strength of the vertices, also called weighted vertex degree.
 

 
strerror, igraph_strerror —  Textual description of an error.
 

-
strvector_append, igraph_strvector_append —  Concatenates two string vectors.
-

-
strvector_capacity, igraph_strvector_capacity —  Returns the capacity of a string vector.
-

-
strvector_clear, igraph_strvector_clear —  Removes all elements from a string vector.
+
strvector_append, igraph_strvector_append —  Concatenates two string vectors.
 

-
strvector_destroy, igraph_strvector_destroy —  Frees the memory allocated for the string vector.
+
strvector_capacity, igraph_strvector_capacity —  Returns the capacity of a string vector.
 

-
strvector_get, igraph_strvector_get —  Retrieves an element of a string vector.
+
strvector_clear, igraph_strvector_clear —  Removes all elements from a string vector.
 

-
strvector_init, igraph_strvector_init —  Initializes a string vector.
+
strvector_destroy, igraph_strvector_destroy —  Frees the memory allocated for the string vector.
 

-
strvector_init_copy, igraph_strvector_init_copy —  Initialization by copying.
+
strvector_get, igraph_strvector_get —  Retrieves an element of a string vector.
 

-
strvector_merge, igraph_strvector_merge —  Moves the contents of a string vector to the end of another.
+
strvector_init, igraph_strvector_init —  Initializes a string vector.
 

-
strvector_push_back, igraph_strvector_push_back —  Adds an element to the back of a string vector.
+
strvector_init_copy, igraph_strvector_init_copy —  Initialization by copying.
 

-
strvector_push_back_len, igraph_strvector_push_back_len —  Adds a string of the given length to the back of a string vector.
+
strvector_merge, igraph_strvector_merge —  Moves the contents of a string vector to the end of another.
 

-
strvector_remove, igraph_strvector_remove —  Removes a single element from a string vector.
+
strvector_push_back, igraph_strvector_push_back —  Adds an element to the back of a string vector.
 

-
strvector_remove_section, igraph_strvector_remove_section —  Removes a section from a string vector.
+
strvector_push_back_len, igraph_strvector_push_back_len —  Adds a string of the given length to the back of a string vector.
 

-
strvector_reserve, igraph_strvector_reserve —  Reserves memory for a string vector.
+
strvector_remove, igraph_strvector_remove —  Removes a single element from a string vector.
 

-
strvector_resize, igraph_strvector_resize —  Resizes a string vector.
+
strvector_remove_section, igraph_strvector_remove_section —  Removes a section from a string vector.
 

-
strvector_resize_min, igraph_strvector_resize_min —  Deallocates the unused memory of a string vector.
+
strvector_reserve, igraph_strvector_reserve —  Reserves memory for a string vector.
 

-
strvector_set, igraph_strvector_set —  Sets an element of the string vector from a string.
+
strvector_resize, igraph_strvector_resize —  Resizes a string vector.
 

-
strvector_set_len, igraph_strvector_set_len —  Sets an element of the string vector given a buffer and its size.
+
strvector_resize_min, igraph_strvector_resize_min —  Deallocates the unused memory of a string vector.
 

-
strvector_size, igraph_strvector_size —  Returns the size of a string vector.
+
strvector_set, igraph_strvector_set —  Sets an element of the string vector from a string.
 

-
strvector_swap, igraph_strvector_swap —  Swaps all elements of two string vectors.
+
strvector_set_len, igraph_strvector_set_len —  Sets an element of the string vector given a buffer and its size.
 

-
strvector_update, igraph_strvector_update —  Updates a string vector from another one.
+
strvector_size, igraph_strvector_size —  Returns the size of a string vector.
 

-
st_edge_connectivity, igraph_st_edge_connectivity —  Edge connectivity of a pair of vertices.
+
strvector_swap, igraph_strvector_swap —  Swaps all elements of two string vectors.
 

-
st_mincut, igraph_st_mincut —  Minimum cut between a source and a target vertex.
+
strvector_update, igraph_strvector_update —  Updates a string vector from another one.
 

-
st_mincut_value, igraph_st_mincut_value —  The minimum s-t cut in a graph.
+
st_edge_connectivity, igraph_st_edge_connectivity —  Edge connectivity of a pair of vertices.
 

-
st_vertex_connectivity, igraph_st_vertex_connectivity —  The vertex connectivity of a pair of vertices.
+
st_mincut, igraph_st_mincut —  Minimum cut between a source and a target vertex.
 

-
subcomponent, igraph_subcomponent —  The vertices reachable from a given vertex.
+
st_mincut_value, igraph_st_mincut_value —  The minimum s-t cut in a graph.
 

-
subgraph_edges, igraph_subgraph_edges —  Creates a subgraph with the specified edges and their endpoints.
+
st_vertex_connectivity, igraph_st_vertex_connectivity —  The vertex connectivity of a pair of vertices.
 

-
subgraph_from_edges, igraph_subgraph_from_edges —  Creates a subgraph with the specified edges and their endpoints.
+
subcomponent, igraph_subcomponent —  The vertices reachable from a given vertex.
 

-
subisomorphic, igraph_subisomorphic —  Decide subgraph isomorphism.
+
subgraph_from_edges, igraph_subgraph_from_edges —  Creates a subgraph with the specified edges and their endpoints.
 

-
subisomorphic_function_vf2, igraph_subisomorphic_function_vf2 —  Generic VF2 function for subgraph isomorphism problems (deprecated alias).
+
subisomorphic, igraph_subisomorphic —  Decide subgraph isomorphism.
 

-
subisomorphic_lad, igraph_subisomorphic_lad — Check subgraph isomorphism with the LAD algorithm
+
subisomorphic_lad, igraph_subisomorphic_lad — Check subgraph isomorphism with the LAD algorithm
 

-
subisomorphic_vf2, igraph_subisomorphic_vf2 — Decide subgraph isomorphism using VF2
+
subisomorphic_vf2, igraph_subisomorphic_vf2 — Decide subgraph isomorphism using VF2
 

-
symmetric_tree, igraph_symmetric_tree —  Creates a symmetric tree with the specified number of branches at each level.
+
symmetric_tree, igraph_symmetric_tree —  Creates a symmetric tree with the specified number of branches at each level.
 

 

 

 

 
T

 

-
THREAD_SAFE, IGRAPH_THREAD_SAFE — Specifies whether igraph was built in thread-safe mode.
+
THREAD_SAFE, IGRAPH_THREAD_SAFE — Specifies whether igraph was built in thread-safe mode.
 

 
TO, IGRAPH_TO —  The target vertex of an edge.
 

-
topological_sorting, igraph_topological_sorting —  Calculate a possible topological sorting of the graph.
+
topological_sorting, igraph_topological_sorting —  Calculate a possible topological sorting of the graph.
 

-
to_directed, igraph_to_directed —  Convert an undirected graph to a directed one.
+
to_directed, igraph_to_directed —  Convert an undirected graph to a directed one.
 

-
to_prufer, igraph_to_prufer —  Converts a tree to its Prüfer sequence.
+
to_prufer, igraph_to_prufer —  Converts a tree to its Prüfer sequence.
 

-
to_undirected, igraph_to_undirected —  Convert a directed graph to an undirected one.
+
to_undirected, igraph_to_undirected —  Convert a directed graph to an undirected one.
 

-
transitive_closure, igraph_transitive_closure —  Computes the transitive closure of a graph.
+
transitive_closure, igraph_transitive_closure —  Computes the transitive closure of a graph.
 

-
transitivity_avglocal_undirected, igraph_transitivity_avglocal_undirected —  Average local transitivity (clustering coefficient).
+
transitivity_avglocal_undirected, igraph_transitivity_avglocal_undirected —  Average local transitivity (clustering coefficient).
 

-
transitivity_barrat, igraph_transitivity_barrat —  Weighted local transitivity of some vertices, as defined by A. Barrat.
+
transitivity_barrat, igraph_transitivity_barrat —  Weighted local transitivity of some vertices, as defined by A. Barrat.
 

-
transitivity_local_undirected, igraph_transitivity_local_undirected —  The local transitivity (clustering coefficient) of some vertices.
+
transitivity_local_undirected, igraph_transitivity_local_undirected —  The local transitivity (clustering coefficient) of some vertices.
 

-
transitivity_undirected, igraph_transitivity_undirected —  Calculates the transitivity (clustering coefficient) of a graph.
+
transitivity_undirected, igraph_transitivity_undirected —  Calculates the transitivity (clustering coefficient) of a graph.
 

-
tree_from_parent_vector, igraph_tree_from_parent_vector —  Constructs a tree or forest from a vector encoding the parent of each vertex.
+
tree_from_parent_vector, igraph_tree_from_parent_vector —  Constructs a tree or forest from a vector encoding the parent of each vertex.
 

-
tree_game, igraph_tree_game —  Generates a random tree with the given number of nodes.
+
tree_game, igraph_tree_game —  Generates a random tree with the given number of nodes.
 

-
triad_census, igraph_triad_census —  Triad census, as defined by Davis and Leinhardt.
+
triad_census, igraph_triad_census —  Triad census, as defined by Davis and Leinhardt.
 

-
triangular_lattice, igraph_triangular_lattice —  A triangular lattice with the given shape.
+
triangular_lattice, igraph_triangular_lattice —  A triangular lattice with the given shape.
 

-
trussness, igraph_trussness —  Finding the "trussness" of the edges in a network.
+
trussness, igraph_trussness —  Finding the "trussness" of the edges in a network.
 

-
turan, igraph_turan —  Creates a Turán graph.
+
turan, igraph_turan —  Creates a Turán graph.
 

 

 

 

 
U

 

-
unfold_tree, igraph_unfold_tree —  Unfolding a graph into a tree, by possibly multiplicating its vertices.
+
unfold_tree, igraph_unfold_tree —  Unfolding a graph into a tree, by possibly multiplicating its vertices.
 

-
union, igraph_union —  Calculates the union of two graphs.
+
union, igraph_union —  Calculates the union of two graphs.
 

-
union_many, igraph_union_many —  Creates the union of many graphs.
+
union_many, igraph_union_many —  Creates the union of many graphs.
 

 

 

 

 
V

 

-
VAB, VAB — Query a boolean vertex attribute.
+
VAB, VAB — Query a boolean vertex attribute.
 

-
VABV, VABV — Query a boolean vertex attribute for all vertices.
+
VABV, VABV — Query a boolean vertex attribute for all vertices.
 

-
VAN, VAN — Query a numeric vertex attribute.
+
VAN, VAN — Query a numeric vertex attribute.
 

-
VANV, VANV — Query a numeric vertex attribute for all vertices.
+
VANV, VANV — Query a numeric vertex attribute for all vertices.
 

-
VAS, VAS — Query a string vertex attribute.
+
VAS, VAS — Query a string vertex attribute.
 

-
VASV, VASV — Query a string vertex attribute for all vertices.
+
VASV, VASV — Query a string vertex attribute for all vertices.
 

 
vcount, igraph_vcount —  The number of vertices in a graph.
 

@@ -2193,41 +2163,41 @@ 
V

 
 
vector_append, igraph_vector_append —  Append a vector to another one.
 

-
vector_binsearch, igraph_vector_binsearch —  Finds an element by binary searching a sorted vector.
+
vector_binsearch, igraph_vector_binsearch —  Finds an element by binary searching a sorted vector.
 

-
vector_binsearch2, igraph_vector_binsearch2 —  Binary search, without returning the index.
+
vector_binsearch2, igraph_vector_binsearch2 —  Binary search, without returning the index.
 

-
vector_binsearch_slice, igraph_vector_binsearch_slice —  Finds an element by binary searching a sorted slice of a vector.
+
vector_binsearch_slice, igraph_vector_binsearch_slice —  Finds an element by binary searching a sorted slice of a vector.
 

 
vector_capacity, igraph_vector_capacity —  Returns the allocated capacity of the vector.
 

-
vector_clear, igraph_vector_clear —  Removes all elements from a vector.
+
vector_clear, igraph_vector_clear —  Removes all elements from a vector.
 

 
vector_colex_cmp, igraph_vector_colex_cmp —  Colexicographical comparison of two vectors.
 

 
vector_colex_cmp_untyped, igraph_vector_colex_cmp_untyped —  Colexicographical comparison of two vectors.
 

-
vector_complex_all_almost_e, igraph_vector_complex_all_almost_e —  Are all elements almost equal?
+
vector_complex_all_almost_e, igraph_vector_complex_all_almost_e —  Are all elements almost equal?
 

-
vector_complex_create, igraph_vector_complex_create —  Creates a complex vector from a real and imaginary part.
+
vector_complex_create, igraph_vector_complex_create —  Creates a complex vector from a real and imaginary part.
 

-
vector_complex_create_polar, igraph_vector_complex_create_polar —  Creates a complex matrix from a magnitude and an angle.
+
vector_complex_create_polar, igraph_vector_complex_create_polar —  Creates a complex matrix from a magnitude and an angle.
 

-
vector_complex_imag, igraph_vector_complex_imag —  Gives the imaginary part of a complex vector.
+
vector_complex_imag, igraph_vector_complex_imag —  Gives the imaginary part of a complex vector.
 

-
vector_complex_real, igraph_vector_complex_real —  Gives the real part of a complex vector.
+
vector_complex_real, igraph_vector_complex_real —  Gives the real part of a complex vector.
 

-
vector_complex_realimag, igraph_vector_complex_realimag —  Gives the real and imaginary parts of a complex vector.
+
vector_complex_realimag, igraph_vector_complex_realimag —  Gives the real and imaginary parts of a complex vector.
 

-
vector_complex_zapsmall, igraph_vector_complex_zapsmall —  Replaces small elements of a complex vector by exact zeros.
+
vector_complex_zapsmall, igraph_vector_complex_zapsmall —  Replaces small elements of a complex vector by exact zeros.
 

-
vector_contains, igraph_vector_contains —  Linear search in a vector.
+
vector_contains, igraph_vector_contains —  Linear search in a vector.
 

 
vector_copy_to, igraph_vector_copy_to —  Copies the contents of a vector to a C array.
 

 
vector_destroy, igraph_vector_destroy —  Destroys a vector object.
 

-
vector_difference_sorted, igraph_vector_difference_sorted —  Set difference of two sorted vectors.
+
vector_difference_sorted, igraph_vector_difference_sorted —  Set difference of two sorted vectors.
 

 
vector_div, igraph_vector_div —  Divide a vector by another one.
 

@@ -2249,87 +2219,87 @@ 
V

 
 
vector_init_range, igraph_vector_init_range —  Initializes a vector with a range.
 

-
vector_insert, igraph_vector_insert —  Inserts a single element into a vector.
+
vector_insert, igraph_vector_insert —  Inserts a single element into a vector.
 

-
vector_intersection_size_sorted, igraph_vector_intersection_size_sorted —  Intersection size of two sorted vectors.
+
vector_intersection_size_sorted, igraph_vector_intersection_size_sorted —  Intersection size of two sorted vectors.
 

-
vector_intersect_sorted, igraph_vector_intersect_sorted —  Set intersection of two sorted vectors.
+
vector_intersect_sorted, igraph_vector_intersect_sorted —  Set intersection of two sorted vectors.
 

-
vector_isininterval, igraph_vector_isininterval —  Checks if all elements of a vector are in the given interval.
+
vector_isininterval, igraph_vector_isininterval —  Checks if all elements of a vector are in the given interval.
 

-
vector_is_all_finite, igraph_vector_is_all_finite —  Check if all elements are finite.
+
vector_is_all_finite, igraph_vector_is_all_finite —  Check if all elements are finite.
 

-
vector_is_any_nan, igraph_vector_is_any_nan —  Check if any element is NaN.
+
vector_is_any_nan, igraph_vector_is_any_nan —  Check if any element is NaN.
 

-
vector_is_nan, igraph_vector_is_nan —  Check for each element if it is NaN.
+
vector_is_nan, igraph_vector_is_nan —  Check for each element if it is NaN.
 

 
vector_lex_cmp, igraph_vector_lex_cmp —  Lexicographical comparison of two vectors (type-safe variant).
 

 
vector_lex_cmp_untyped, igraph_vector_lex_cmp_untyped —  Lexicographical comparison of two vectors (non-type-safe).
 

-
vector_list_capacity, igraph_vector_list_capacity —  Returns the allocated capacity of the list.
+
vector_list_capacity, igraph_vector_list_capacity —  Returns the allocated capacity of the list.
 

-
vector_list_clear, igraph_vector_list_clear —  Removes all elements from a list of vectors.
+
vector_list_clear, igraph_vector_list_clear —  Removes all elements from a list of vectors.
 

-
vector_list_destroy, igraph_vector_list_destroy —  Destroys a list of vectors object.
+
vector_list_destroy, igraph_vector_list_destroy —  Destroys a list of vectors object.
 

-
vector_list_discard, igraph_vector_list_discard —  Discard the item at the given index in the vector list.
+
vector_list_discard, igraph_vector_list_discard —  Discards the item at the given index in the vector list.
 

-
vector_list_discard_back, igraph_vector_list_discard_back —  Discard the last item in the vector list.
+
vector_list_discard_back, igraph_vector_list_discard_back —  Discards the last item in the vector list.
 

-
vector_list_discard_fast, igraph_vector_list_discard_fast —  Discard the item at the given index in the vector list and move the last item to its place.
+
vector_list_discard_fast, igraph_vector_list_discard_fast —  Discards the item at the given index in the vector list and moves the last item to its place.
 

-
vector_list_empty, igraph_vector_list_empty —  Decides whether the size of the list is zero.
+
vector_list_empty, igraph_vector_list_empty —  Decides whether the size of the list is zero.
 

-
vector_list_get_ptr, igraph_vector_list_get_ptr —  Retrieve the address of a vector in the vector list.
+
vector_list_get_ptr, igraph_vector_list_get_ptr —  The address of a vector in the vector list.
 

-
vector_list_init, igraph_vector_list_init —  Initializes a list of vectors (constructor).
+
vector_list_init, igraph_vector_list_init —  Initializes a list of vectors (constructor).
 

-
vector_list_init_copy, igraph_vector_list_init_copy —  Initializes a list of vectors from another list of vectors (constructor).
+
vector_list_init_copy, igraph_vector_list_init_copy —  Initializes a list of vectors from another list of vectors (constructor).
 

-
vector_list_insert, igraph_vector_list_insert —  Insert an existing vector into the list, transferring ownership.
+
vector_list_insert, igraph_vector_list_insert —  Inserts an existing vector into the list, transferring ownership.
 

-
vector_list_insert_copy, igraph_vector_list_insert_copy —  Insert the copy of a vector to the list.
+
vector_list_insert_copy, igraph_vector_list_insert_copy —  Inserts the copy of a vector to the list.
 

-
vector_list_insert_new, igraph_vector_list_insert_new —  Insert a new vector into the list.
+
vector_list_insert_new, igraph_vector_list_insert_new —  Inserts a new vector into the list.
 

-
vector_list_permute, igraph_vector_list_permute —  Permutes the elements of a list in place according to an index vector.
+
vector_list_permute, igraph_vector_list_permute —  Permutes the elements of a list in place according to an index vector.
 

-
vector_list_pop_back, igraph_vector_list_pop_back —  Remove the last item from the vector list and transfer ownership to the caller.
+
vector_list_pop_back, igraph_vector_list_pop_back —  Removes the last item from the vector list and transfer ownership to the caller.
 

-
vector_list_push_back, igraph_vector_list_push_back —  Append an existing vector to the list, transferring ownership.
+
vector_list_push_back, igraph_vector_list_push_back —  Appends an existing vector to the list, transferring ownership.
 

-
vector_list_push_back_copy, igraph_vector_list_push_back_copy —  Append the copy of a vector to the list.
+
vector_list_push_back_copy, igraph_vector_list_push_back_copy —  Appends the copy of a vector to the list.
 

-
vector_list_push_back_new, igraph_vector_list_push_back_new —  Append a new vector to the list.
+
vector_list_push_back_new, igraph_vector_list_push_back_new —  Appends a new vector to the list.
 

-
vector_list_remove, igraph_vector_list_remove —  Remove the item at the given index from the vector list and transfer ownership to the caller.
+
vector_list_remove, igraph_vector_list_remove —  Removes the item at the given index from the vector list and transfer ownership to the caller.
 

-
vector_list_remove_fast, igraph_vector_list_remove_fast —  Remove the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.
+
vector_list_remove_fast, igraph_vector_list_remove_fast —  Removes the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.
 

-
vector_list_replace, igraph_vector_list_replace —  Replaces the vector at the given index in the list with another one.
+
vector_list_replace, igraph_vector_list_replace —  Replaces the vector at the given index in the list with another one.
 

-
vector_list_reserve, igraph_vector_list_reserve —  Reserves memory for a list.
+
vector_list_reserve, igraph_vector_list_reserve —  Reserves memory for a list.
 

-
vector_list_resize, igraph_vector_list_resize —  Resize the list of vectors.
+
vector_list_resize, igraph_vector_list_resize —  Resizes the list of vectors.
 

-
vector_list_set, igraph_vector_list_set —  Sets the vector at the given index in the list.
+
vector_list_set, igraph_vector_list_set —  Sets the vector at the given index in the list.
 

-
vector_list_size, igraph_vector_list_size —  Returns the size (=length) of the vector.
+
vector_list_size, igraph_vector_list_size —  The size of the vector list.
 

-
vector_list_sort, igraph_vector_list_sort —  Sorts the elements of the list into ascending order.
+
vector_list_sort, igraph_vector_list_sort —  Sorts the elements of the list into ascending order.
 

-
vector_list_sort_ind, igraph_vector_list_sort_ind —  Returns a permutation of indices that sorts the list.
+
vector_list_sort_ind, igraph_vector_list_sort_ind —  Returns a permutation of indices that sorts the list.
 

-
vector_list_swap, igraph_vector_list_swap —  Swaps all elements of two vector lists.
+
vector_list_swap, igraph_vector_list_swap —  Swaps all elements of two vector lists.
 

-
vector_list_swap_elements, igraph_vector_list_swap_elements —  Swap two elements in a vector list.
+
vector_list_swap_elements, igraph_vector_list_swap_elements —  Swap two elements in a vector list.
 

-
vector_list_tail_ptr, igraph_vector_list_tail_ptr —  Retrieve the address of the last vector in the vector list.
+
vector_list_tail_ptr, igraph_vector_list_tail_ptr —  The address of the last vector in the vector list.
 

 
vector_max, igraph_vector_max —  Largest element of a vector.
 

-
vector_maxdifference, igraph_vector_maxdifference —  The maximum absolute difference of m1 and m2.
+
vector_maxdifference, igraph_vector_maxdifference —  The maximum absolute difference of m1 and m2.
 

 
vector_min, igraph_vector_min —  Smallest element of a vector.
 

@@ -2341,79 +2311,85 @@ 
V

 
 
vector_permute, igraph_vector_permute —  Permutes the elements of a vector in place according to an index vector.
 

-
vector_pop_back, igraph_vector_pop_back —  Removes and returns the last element of a vector.
+
vector_pop_back, igraph_vector_pop_back —  Removes and returns the last element of a vector.
 

-
vector_prod, igraph_vector_prod —  Calculates the product of the elements in the vector.
+
vector_prod, igraph_vector_prod —  Calculates the product of the elements in the vector.
 

-
vector_ptr_clear, igraph_vector_ptr_clear —  Removes all elements from a pointer vector.
+
vector_ptr_capacity, igraph_vector_ptr_capacity —  Returns the allocated capacity of the pointer vector.
 

-
vector_ptr_destroy, igraph_vector_ptr_destroy —  Destroys a pointer vector.
+
vector_ptr_clear, igraph_vector_ptr_clear —  Removes all elements from a pointer vector.
 

-
vector_ptr_destroy_all, igraph_vector_ptr_destroy_all —  Frees all the elements and destroys the pointer vector.
+
vector_ptr_destroy, igraph_vector_ptr_destroy —  Destroys a pointer vector.
 

-
vector_ptr_free_all, igraph_vector_ptr_free_all —  Frees all the elements of a pointer vector.
+
vector_ptr_destroy_all, igraph_vector_ptr_destroy_all —  Frees all the elements and destroys the pointer vector.
 

-
vector_ptr_get, igraph_vector_ptr_get —  Access an element of a pointer vector.
+
vector_ptr_free_all, igraph_vector_ptr_free_all —  Frees all the elements of a pointer vector.
 

-
vector_ptr_get_item_destructor, igraph_vector_ptr_get_item_destructor —  Gets the current item destructor for this pointer vector.
+
vector_ptr_get, igraph_vector_ptr_get —  Access an element of a pointer vector.
 

-
vector_ptr_init, igraph_vector_ptr_init —  Initialize a pointer vector (constructor).
+
vector_ptr_get_item_destructor, igraph_vector_ptr_get_item_destructor —  Gets the current item destructor for this pointer vector.
 

-
vector_ptr_init_copy, igraph_vector_ptr_init_copy —  Initializes a pointer vector from another one (constructor).
+
vector_ptr_init, igraph_vector_ptr_init —  Initialize a pointer vector (constructor).
 

-
vector_ptr_insert, igraph_vector_ptr_insert —  Inserts a single element into a pointer vector.
+
vector_ptr_init_copy, igraph_vector_ptr_init_copy —  Initializes a pointer vector from another one (constructor).
 

-
vector_ptr_permute, igraph_vector_ptr_permute —  Permutes the elements of a pointer vector in place according to an index vector.
+
vector_ptr_insert, igraph_vector_ptr_insert —  Inserts a single element into a pointer vector.
 

-
vector_ptr_pop_back, igraph_vector_ptr_pop_back —  Removes and returns the last element of a pointer vector.
+
vector_ptr_permute, igraph_vector_ptr_permute —  Permutes the elements of a pointer vector in place according to an index vector.
 

-
vector_ptr_push_back, igraph_vector_ptr_push_back —  Appends an element to the back of a pointer vector.
+
vector_ptr_pop_back, igraph_vector_ptr_pop_back —  Removes and returns the last element of a pointer vector.
 

-
vector_ptr_resize, igraph_vector_ptr_resize —  Resizes a pointer vector.
+
vector_ptr_push_back, igraph_vector_ptr_push_back —  Appends an element to the back of a pointer vector.
 

-
vector_ptr_set, igraph_vector_ptr_set —  Assign to an element of a pointer vector.
+
vector_ptr_reserve, igraph_vector_ptr_reserve —  Reserves memory for a pointer vector for later use.
 

-
vector_ptr_set_item_destructor, igraph_vector_ptr_set_item_destructor —  Sets the item destructor for this pointer vector.
+
vector_ptr_resize, igraph_vector_ptr_resize —  Resizes a pointer vector.
 

-
VECTOR_PTR_SET_ITEM_DESTRUCTOR, IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR —  Sets the item destructor for this pointer vector (macro version).
+
vector_ptr_resize_min, igraph_vector_ptr_resize_min —  Deallocate the unused memory of a pointer vector.
 

-
vector_ptr_size, igraph_vector_ptr_size —  Gives the number of elements in the pointer vector.
+
vector_ptr_set, igraph_vector_ptr_set —  Assign to an element of a pointer vector.
 

-
vector_ptr_sort, igraph_vector_ptr_sort —  Sorts the pointer vector based on an external comparison function.
+
vector_ptr_set_item_destructor, igraph_vector_ptr_set_item_destructor —  Sets the item destructor for this pointer vector.
 

-
vector_ptr_sort_ind, igraph_vector_ptr_sort_ind —  Returns a permutation of indices that sorts a vector of pointers.
+
VECTOR_PTR_SET_ITEM_DESTRUCTOR, IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR —  Sets the item destructor for this pointer vector (macro version).
 

-
vector_push_back, igraph_vector_push_back —  Appends one element to a vector.
+
vector_ptr_size, igraph_vector_ptr_size —  Gives the number of elements in the pointer vector.
 

-
vector_qsort_ind, igraph_vector_qsort_ind —  Returns a permutation of indices that sorts a vector.
+
vector_ptr_sort, igraph_vector_ptr_sort —  Sorts the pointer vector based on an external comparison function.
+

+
vector_ptr_sort_ind, igraph_vector_ptr_sort_ind —  Returns a permutation of indices that sorts a vector of pointers.
+

+
vector_push_back, igraph_vector_push_back —  Appends one element to a vector.
+

+
vector_qsort_ind, igraph_vector_qsort_ind —  Returns a permutation of indices that sorts a vector.
 

 
vector_range, igraph_vector_range —  Updates a vector to store a range.
 

-
vector_remove, igraph_vector_remove —  Removes a single element from a vector.
+
vector_remove, igraph_vector_remove —  Removes a single element from a vector.
 

-
vector_remove_section, igraph_vector_remove_section —  Deletes a section from a vector.
+
vector_remove_section, igraph_vector_remove_section —  Deletes a section from a vector.
 

-
vector_reserve, igraph_vector_reserve —  Reserves memory for a vector.
+
vector_reserve, igraph_vector_reserve —  Reserves memory for a vector.
 

-
vector_resize, igraph_vector_resize —  Resize the vector.
+
vector_resize, igraph_vector_resize —  Resize the vector.
 

-
vector_resize_min, igraph_vector_resize_min —  Deallocate the unused memory of a vector.
+
vector_resize_min, igraph_vector_resize_min —  Deallocate the unused memory of a vector.
 

 
vector_reverse, igraph_vector_reverse —  Reverse the elements of a vector.
 

-
vector_reverse_sort, igraph_vector_reverse_sort —  Sorts the elements of the vector into descending order.
+
vector_reverse_sort, igraph_vector_reverse_sort —  Sorts the elements of the vector into descending order.
 

 
vector_scale, igraph_vector_scale —  Multiplies all elements of a vector by a constant.
 

-
vector_search, igraph_vector_search —  Searches in a vector from a given position.
+
vector_search, igraph_vector_search —  Searches in a vector from a given position.
 

 
vector_set, igraph_vector_set —  Assignment to an element of a vector.
 

 
vector_shuffle, igraph_vector_shuffle —  Shuffles a vector in-place using the Fisher-Yates method.
 

-
vector_size, igraph_vector_size —  Returns the size (=length) of the vector.
+
vector_size, igraph_vector_size —  The size of the vector.
 

-
vector_sort, igraph_vector_sort —  Sorts the elements of the vector into ascending order.
+
vector_sort, igraph_vector_sort —  Sorts the elements of the vector into ascending order.
 

 
vector_sub, igraph_vector_sub —  Subtract a vector from another one.
 

@@ -2437,69 +2413,69 @@ 
V

 
 
vector_zapsmall, igraph_vector_zapsmall —  Replaces small elements of a vector by exact zeros.
 

-
version, igraph_version —  The version of the igraph C library.
+
version, igraph_version —  The version of the igraph C library.
 

-
vertex_coloring_greedy, igraph_vertex_coloring_greedy —  Computes a vertex coloring using a greedy algorithm.
+
vertex_coloring_greedy, igraph_vertex_coloring_greedy —  Computes a vertex coloring using a greedy algorithm.
 

-
vertex_connectivity, igraph_vertex_connectivity —  The vertex connectivity of a graph.
+
vertex_connectivity, igraph_vertex_connectivity —  The vertex connectivity of a graph.
 

-
vertex_disjoint_paths, igraph_vertex_disjoint_paths —  Maximum number of vertex-disjoint paths between two vertices.
+
vertex_disjoint_paths, igraph_vertex_disjoint_paths —  Maximum number of vertex-disjoint paths between two vertices.
 

-
vertex_path_from_edge_path, igraph_vertex_path_from_edge_path —  Converts a path of edge IDs to the traversed vertex IDs.
+
vertex_path_from_edge_path, igraph_vertex_path_from_edge_path —  Converts a path of edge IDs to the traversed vertex IDs.
 

-
vit_create, igraph_vit_create —  Creates a vertex iterator from a vertex selector.
+
vit_create, igraph_vit_create —  Creates a vertex iterator from a vertex selector.
 

-
vit_destroy, igraph_vit_destroy —  Destroys a vertex iterator.
+
vit_destroy, igraph_vit_destroy —  Destroys a vertex iterator.
 

-
VIT_END, IGRAPH_VIT_END —  Are we at the end?
+
VIT_END, IGRAPH_VIT_END —  Are we at the end?
 

-
VIT_GET, IGRAPH_VIT_GET —  Query the current position.
+
VIT_GET, IGRAPH_VIT_GET —  Query the current position.
 

-
VIT_NEXT, IGRAPH_VIT_NEXT —  Next vertex.
+
VIT_NEXT, IGRAPH_VIT_NEXT —  Next vertex.
 

-
VIT_RESET, IGRAPH_VIT_RESET —  Reset a vertex iterator.
+
VIT_RESET, IGRAPH_VIT_RESET —  Reset a vertex iterator.
 

-
VIT_SIZE, IGRAPH_VIT_SIZE —  Size of a vertex iterator.
+
VIT_SIZE, IGRAPH_VIT_SIZE —  Size of a vertex iterator.
 

-
voronoi, igraph_voronoi —  Voronoi partitioning of a graph.
+
voronoi, igraph_voronoi —  Voronoi partitioning of a graph.
 

-
vss_1, igraph_vss_1 —  Vertex set with a single vertex (immediate version).
+
vss_1, igraph_vss_1 —  Vertex set with a single vertex (immediate version).
 

-
vss_all, igraph_vss_all —  All vertices of a graph (immediate version).
+
vss_all, igraph_vss_all —  All vertices of a graph (immediate version).
 

-
vss_none, igraph_vss_none —  Empty vertex set (immediate version).
+
vss_none, igraph_vss_none —  Empty vertex set (immediate version).
 

-
vss_range, igraph_vss_range —  An interval of vertices (immediate version).
+
vss_range, igraph_vss_range —  An interval of vertices (immediate version).
 

-
vss_vector, igraph_vss_vector —  Vertex set based on a vector (immediate version).
+
vss_vector, igraph_vss_vector —  Vertex set based on a vector (immediate version).
 

-
vs_1, igraph_vs_1 —  Vertex set with a single vertex.
+
vs_1, igraph_vs_1 —  Vertex set with a single vertex.
 

-
vs_adj, igraph_vs_adj —  Adjacent vertices of a vertex.
+
vs_adj, igraph_vs_adj —  Adjacent vertices of a vertex.
 

-
vs_all, igraph_vs_all —  Vertex set, all vertices of a graph.
+
vs_all, igraph_vs_all —  Vertex set, all vertices of a graph.
 

-
vs_copy, igraph_vs_copy —  Creates a copy of a vertex selector.
+
vs_copy, igraph_vs_copy —  Creates a copy of a vertex selector.
 

-
vs_destroy, igraph_vs_destroy —  Destroy a vertex set.
+
vs_destroy, igraph_vs_destroy —  Destroy a vertex set.
 

-
vs_is_all, igraph_vs_is_all —  Check whether all vertices are included.
+
vs_is_all, igraph_vs_is_all —  Check whether all vertices are included.
 

-
vs_nonadj, igraph_vs_nonadj —  Non-adjacent vertices of a vertex.
+
vs_nonadj, igraph_vs_nonadj —  Non-adjacent vertices of a vertex.
 

-
vs_none, igraph_vs_none —  Empty vertex set.
+
vs_none, igraph_vs_none —  Empty vertex set.
 

-
vs_range, igraph_vs_range —  Vertex set, an interval of vertices.
+
vs_range, igraph_vs_range —  Vertex set, an interval of vertices.
 

-
vs_size, igraph_vs_size —  Returns the size of the vertex selector.
+
vs_size, igraph_vs_size —  Returns the size of the vertex selector.
 

-
vs_type, igraph_vs_type —  Returns the type of the vertex selector.
+
vs_type, igraph_vs_type —  Returns the type of the vertex selector.
 

-
vs_vector, igraph_vs_vector —  Vertex set based on a vector.
+
vs_vector, igraph_vs_vector —  Vertex set based on a vector.
 

-
vs_vector_copy, igraph_vs_vector_copy —  Vertex set based on a vector, with copying.
+
vs_vector_copy, igraph_vs_vector_copy —  Vertex set based on a vector, with copying.
 

-
vs_vector_small, igraph_vs_vector_small —  Create a vertex set by giving its elements.
+
vs_vector_small, igraph_vs_vector_small —  Create a vertex set by giving its elements.
 

 

 

@@ -2520,41 +2496,39 @@ 
W

 
 
warning_handler_t, igraph_warning_handler_t —  The type of igraph warning handler functions.
 

-
watts_strogatz_game, igraph_watts_strogatz_game —  The Watts-Strogatz small-world model.
-

-
weighted_adjacency, igraph_weighted_adjacency —  Creates a graph from a weighted adjacency matrix.
+
watts_strogatz_game, igraph_watts_strogatz_game —  The Watts-Strogatz small-world model.
 

-
weighted_biadjacency, igraph_weighted_biadjacency —  Creates a bipartite graph from a weighted bipartite adjacency matrix.
+
weighted_adjacency, igraph_weighted_adjacency —  Creates a graph from a weighted adjacency matrix.
 

-
weighted_cliques, igraph_weighted_cliques —  Finds all cliques in a given weight range in a vertex weighted graph.
+
weighted_biadjacency, igraph_weighted_biadjacency —  Creates a bipartite graph from a weighted bipartite adjacency matrix.
 

-
weighted_clique_number, igraph_weighted_clique_number —  Finds the weight of the largest weight clique in the graph.
+
weighted_cliques, igraph_weighted_cliques —  Finds all cliques in a given weight range in a vertex weighted graph.
 

-
wheel, igraph_wheel —  Creates a wheel graph, a union of a star and a cycle graph.
+
weighted_clique_number, igraph_weighted_clique_number —  Finds the weight of the largest weight clique in the graph.
 

-
widest_path_widths_dijkstra, igraph_widest_path_widths_dijkstra —  Widths of widest paths between vertices.
+
wheel, igraph_wheel —  Creates a wheel graph, a union of a star and a cycle graph.
 

-
widest_path_widths_floyd_warshall, igraph_widest_path_widths_floyd_warshall —  Widths of widest paths between vertices.
+
widest_path_widths_dijkstra, igraph_widest_path_widths_dijkstra —  Widths of widest paths between vertices.
 

-
write_graph_dimacs, igraph_write_graph_dimacs —  Write a graph in DIMACS format (deprecated alias).
+
widest_path_widths_floyd_warshall, igraph_widest_path_widths_floyd_warshall —  Widths of widest paths between vertices.
 

-
write_graph_dimacs_flow, igraph_write_graph_dimacs_flow —  Write a graph in DIMACS format.
+
write_graph_dimacs_flow, igraph_write_graph_dimacs_flow —  Write a graph in DIMACS format.
 

-
write_graph_dot, igraph_write_graph_dot —  Write the graph to a stream in DOT format.
+
write_graph_dot, igraph_write_graph_dot —  Write the graph to a stream in DOT format.
 

-
write_graph_edgelist, igraph_write_graph_edgelist —  Writes the edge list of a graph to a file.
+
write_graph_edgelist, igraph_write_graph_edgelist —  Writes the edge list of a graph to a file.
 

-
write_graph_gml, igraph_write_graph_gml —  Write the graph to a stream in GML format.
+
write_graph_gml, igraph_write_graph_gml —  Write the graph to a stream in GML format.
 

-
write_graph_graphml, igraph_write_graph_graphml —  Writes the graph to a file in GraphML format.
+
write_graph_graphml, igraph_write_graph_graphml —  Writes the graph to a file in GraphML format.
 

-
write_graph_leda, igraph_write_graph_leda —  Write a graph in LEDA native graph format.
+
write_graph_leda, igraph_write_graph_leda —  Write a graph in LEDA native graph format.
 

-
write_graph_lgl, igraph_write_graph_lgl —  Writes the graph to a file in .lgl format.
+
write_graph_lgl, igraph_write_graph_lgl —  Writes the graph to a file in .lgl format.
 

-
write_graph_ncol, igraph_write_graph_ncol —  Writes the graph to a file in .ncol format.
+
write_graph_ncol, igraph_write_graph_ncol —  Writes the graph to a file in .ncol format.
 

-
write_graph_pajek, igraph_write_graph_pajek —  Writes a graph to a file in Pajek format.
+
write_graph_pajek, igraph_write_graph_pajek —  Writes a graph to a file in Pajek format.
 

 

 

diff --git a/docs/c/html/master/igraph-Basic.html b/docs/c/html/master/igraph-Basic.html
index 53415cc0d..480a17a73 100644
--- a/docs/c/html/master/igraph-Basic.html
+++ b/docs/c/html/master/igraph-Basic.html
@@ -350,7 +350,7 @@ 
igraph Reference Manual

 in the above description should be distinguished from the mathematical
 definition of the empty or null graph. Strictly speaking, the empty or null
 graph in graph theory is the graph with no vertices and no edges. However
-by "empty graph" as used in igraph we mean a graph having zero or more
+by "empty graph" as used in igraph we mean a graph having zero or more
 vertices, but no edges.
 

 
Arguments: 
diff --git a/docs/c/html/master/igraph-Community.html b/docs/c/html/master/igraph-Community.html
index c7f7fbf4a..91571fcf4 100644
--- a/docs/c/html/master/igraph-Community.html
+++ b/docs/c/html/master/igraph-Community.html
@@ -161,6 +161,23 @@ 
igraph Reference Manual

 
9. The InfoMAP algorithm

 
10. Voronoi communities

 

+

+Community detection is concerned with clustering the vertices of networks
+into tightly connected subgraphs called "communities". The following
+references provide a good introduction to the topic of community detection:
+

+

+S. Fortunato:
+"Community Detection in Graphs".
+Physics Reports 486, no. 3–5 (2010): 75–174.
+https://doi.org/16/j.physrep.2009.11.002.
+

+

+S. Fortunato and D. Hric:
+"Community Detection in Networks: A User Guide".
+Physics Reports 659 (2016): 1–44.
+https://doi.org/10.1016/j.physrep.2016.09.002.
+

 

 

 1. Common functions related to community structure

@@ -176,7 +193,7 @@ 
igraph Reference Manual

 

 

 1.1. igraph_modularity —  Calculates the modularity of a graph with respect to some clusters or vertex types.

-

+

 

 
 igraph_error_t igraph_modularity(const igraph_t *graph,
@@ -358,7 +375,7 @@ 
igraph Reference Manual

 

 

 1.2. igraph_modularity_matrix —  Calculates the modularity matrix.

-

+

 

 
 igraph_error_t igraph_modularity_matrix(const igraph_t *graph,
@@ -474,7 +491,7 @@ 
igraph Reference Manual

 

 

 1.3. igraph_community_optimal_modularity —  Calculate the community structure with the highest modularity value.

-

+

 

 
 igraph_error_t igraph_community_optimal_modularity(const igraph_t *graph,
@@ -588,7 +605,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.1.  File examples/simple/igraph_community_optimal_modularity.c

+
Example 24.1.  File examples/simple/igraph_community_optimal_modularity.c

 

 
#include <igraph.h>
 
@@ -689,7 +706,7 @@ 
igraph Reference Manual

 

 

 1.4. igraph_community_to_membership —  Creates a membership vector from a community structure dendrogram.

-

+

 

 
 igraph_error_t igraph_community_to_membership(const igraph_matrix_int_t *merges,
@@ -804,7 +821,7 @@ 
igraph Reference Manual

 

 

 1.5. igraph_reindex_membership —  Makes the IDs in a membership vector contiguous.

-

+

 

 
 igraph_error_t igraph_reindex_membership(igraph_vector_int_t *membership,
@@ -869,7 +886,7 @@ 
igraph Reference Manual

 

 

 1.6. igraph_compare_communities —  Compares community structures using various metrics.

-

+

 

 
 igraph_error_t igraph_compare_communities(const igraph_vector_int_t *comm1,
@@ -898,7 +915,7 @@ 
igraph Reference Manual

 
 

 

-H(C) = - \sum_i p_i log p_i
+H(C) = - sum_i p_i log p_i
 
 

 

@@ -908,7 +925,7 @@ 
igraph Reference Manual

 
 

 

-H(C_1, C_2) = - \sum_ii p_ij log p_ij
+H(C_1, C_2) = - sum_ii p_ij log p_ij
 
 

 

@@ -1085,7 +1102,7 @@ 
igraph Reference Manual

 

 

 1.7. igraph_split_join_distance —  Calculates the split-join distance of two community structures.

-

+

 

 
 igraph_error_t igraph_split_join_distance(const igraph_vector_int_t *comm1,
@@ -1221,7 +1238,7 @@ 
igraph Reference Manual

 

 

 2.1. igraph_community_spinglass —  Community detection based on statistical mechanics.

-

+

 

 
 igraph_error_t igraph_community_spinglass(const igraph_t *graph,
@@ -1288,9 +1305,8 @@ 
igraph Reference Manual

 

   Pointer to a real number, if not NULL then the
     modularity score of the solution will be stored here. This is the
-    gereralized modularity that simplifies to the one defined in
-    M. E. J. Newman and M. Girvan, Phys. Rev. E 69, 026113 (2004),
-    if the gamma parameter is one.
+    gereralized modularity, taking into account the resolution parameter
+    gamma. See igraph_modularity() for details.
 

 
 
@@ -1425,7 +1441,7 @@ 
igraph Reference Manual

 
 

 

-  igraph_community_spinglass_single() for calculating the community
+  igraph_community_spinglass_single() for calculating the community
 of a single vertex.
   

 
@@ -1440,7 +1456,7 @@ 
igraph Reference Manual

 

 

 2.2. igraph_community_spinglass_single —  Community of a single node based on statistical mechanics.

-

+

 

 
 igraph_error_t igraph_community_spinglass_single(const igraph_t *graph,
@@ -1627,13 +1643,14 @@ 
igraph Reference Manual

 published in MEJ Newman: Finding community structure using the
 eigenvectors of matrices, Phys Rev E 74:036104 (2006).

 

-The heart of the method is the definition of the modularity matrix,
-B, which is B=A-P, A being the adjacency matrix of the (undirected)
-network, and P contains the probability that certain edges are
-present according to the “configuration model” In
-other words, a Pij element of P is the probability that there is an
-edge between vertices i and j in a random network in which the
-degrees of all vertices are the same as in the input graph.

+The heart of the method is the definition of the modularity matrix
+B = A - P, A being the adjacency matrix of the (undirected)
+network, and P contains the probability that certain edges are
+present according to the “configuration model”. In
+other words, a P_ij element of P is the probability that there is an
+edge between vertices i and j in a random network in which the
+degrees of all vertices are the same as in the input graph. See
+igraph_modularity_matrix() for more details.

 

 The leading eigenvector method works by calculating the eigenvector
 of the modularity matrix for the largest positive eigenvalue and
@@ -1655,7 +1672,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.2.  File examples/simple/igraph_community_leading_eigenvector.c

+
Example 24.2.  File examples/simple/igraph_community_leading_eigenvector.c

 

 
#include <igraph.h>
 
@@ -1733,7 +1750,7 @@ 
igraph Reference Manual

 

 

 3.1. igraph_community_leading_eigenvector —  Leading eigenvector community finding (proper version).

-

+

 

 
 igraph_error_t igraph_community_leading_eigenvector(
@@ -1798,11 +1815,11 @@ 
igraph Reference Manual

    community detection functions in igraph, the integers in this matrix
    represent community indices, not vertex indices. If at the end of
    the algorithm (after steps steps was done) there are “p”
-   communities, then these are numbered from zero to “p-1”.
+   communities, then these are numbered from zero to p-1.
    The first line of the matrix contains the first “merge”
    (which is in reality the last split) of two communities into
-   community “p”, the merge in the second line forms
-   community “p+1”, etc. The matrix should be
+   community p, the merge in the second line forms
+   community p+1, etc. The matrix should be
    initialized before calling and will be resized as needed.
    This argument is ignored if it is NULL.
 

@@ -1996,7 +2013,7 @@ 
igraph Reference Manual

 

 

 3.2. igraph_community_leading_eigenvector_callback_t — Callback for the leading eigenvector community finding method.

-
+
 typedef igraph_error_t igraph_community_leading_eigenvector_callback_t(
     const igraph_vector_int_t *membership,
     igraph_integer_t comm,
@@ -2094,7 +2111,7 @@ 
igraph Reference Manual

 

 

 3.3. igraph_le_community_to_membership —  Vertex membership from the leading eigenvector community structure.

-

+

 

 
 igraph_error_t igraph_le_community_to_membership(const igraph_matrix_int_t *merges,
@@ -2182,7 +2199,7 @@ 
igraph Reference Manual

 

 

 4.1. igraph_community_walktrap —  Community finding using a random walk based similarity measure.

-

+

 

 
 igraph_error_t igraph_community_walktrap(const igraph_t *graph,
@@ -2259,8 +2276,9 @@ 
igraph Reference Manual

     cluster is created from two other clusters and its id will be
     one larger than the largest cluster id so far. This means that
     before the first merge we have n clusters (the number of
-    vertices in the graph) numbered from zero to n-1. The first
-    merge creates cluster n, the second cluster n+1, etc.
+    vertices in the graph) numbered from zero to n - 1.
+    The first merge creates cluster n, the second cluster
+    n + 1, etc.
 

 
 
@@ -2320,7 +2338,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.3.  File examples/simple/walktrap.c

+
Example 24.3.  File examples/simple/walktrap.c

 

 
#include <igraph.h>
 
@@ -2378,7 +2396,7 @@ 
igraph Reference Manual

 

 

 5.1. igraph_community_edge_betweenness —  Community finding based on edge betweenness.

-

+

 

 
 igraph_error_t igraph_community_edge_betweenness(const igraph_t *graph,
@@ -2398,10 +2416,7 @@ 
igraph Reference Manual

 
 
 Community structure detection based on the betweenness of the edges
-in the network. The algorithm was invented by M. Girvan and
-M. Newman, see: M. Girvan and M. E. J. Newman: Community structure in
-social and biological networks, Proc. Nat. Acad. Sci. USA 99, 7821-7826
-(2002). https://doi.org/10.1073/pnas.122653799
+in the network, known as the Grivan-Newman algorithm.
 
 

 

@@ -2421,6 +2436,17 @@ 
igraph Reference Manual

 of betweenness and modularity are used, however, only splits into
 weakly connected components are detected.
 
+

+

+Reference:
+
+

+

+M. Girvan and M. E. J. Newman:
+Community structure in social and biological networks.
+Proc. Nat. Acad. Sci. USA 99, 7821-7826 (2002).
+https://doi.org/10.1073/pnas.122653799
+
 

 
Arguments: 
 

@@ -2548,7 +2574,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.4.  File examples/simple/igraph_community_edge_betweenness.c

+
Example 24.4.  File examples/simple/igraph_community_edge_betweenness.c

 

 
#include <igraph.h>
 
@@ -2601,7 +2627,7 @@ 
igraph Reference Manual

 

 

 5.2. igraph_community_eb_get_merges —  Calculating the merges, i.e. the dendrogram for an edge betweenness community structure.

-

+

 

 
 igraph_error_t igraph_community_eb_get_merges(const igraph_t *graph,
@@ -2681,7 +2707,7 @@ 
igraph Reference Manual

    the number of vertices in the graph. So if the first line
    contains a and b that means that components a and b
    are merged into component n, the second line creates
-   component n+1, etc. The matrix will be resized as needed.
+   component n + 1, etc. The matrix will be resized as needed.
 

 
 
@@ -2755,13 +2781,13 @@ 
igraph Reference Manual

 6. Community structure based on the optimization of modularity

 

 
6.1. igraph_community_fastgreedy —  Finding community structure by greedy optimization of modularity.

-
6.2. igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity.

+
6.2. igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity (Louvain).

 
6.3. igraph_community_leiden —  Finding community structure using the Leiden algorithm.

 

 

 

 6.1. igraph_community_fastgreedy —  Finding community structure by greedy optimization of modularity.

-

+

 

 
 igraph_error_t igraph_community_fastgreedy(const igraph_t *graph,
@@ -2888,7 +2914,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.5.  File examples/simple/igraph_community_fastgreedy.c

+
Example 24.5.  File examples/simple/igraph_community_fastgreedy.c

 

 
#include <igraph.h>
 
@@ -2922,8 +2948,8 @@ 
igraph Reference Manual

 

 

 

-6.2. igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity.

-

+6.2. igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity (Louvain).

+

 

 
 igraph_error_t igraph_community_multilevel(const igraph_t *graph,
@@ -2940,14 +2966,8 @@ 
igraph Reference Manual

 
 
 
-This function implements the multi-level modularity optimization
-algorithm for finding community structure, see
-Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008). Fast
-unfolding of communities in large networks. Journal of Statistical Mechanics:
-Theory and Experiment, 10008(10), 6.
-https://doi.org/10.1088/1742-5468/2008/10/P10008 for the details (preprint:
-http://arxiv.org/abs/0803.0476). The algorithm is sometimes known as the
-"Louvain" algorithm.
+This function implements a multi-level modularity optimization algorithm
+for finding community structure, sometimes known as the Louvain algorithm.
 
 

 

@@ -2962,17 +2982,28 @@ 
igraph Reference Manual

 
 

 

-The resolution parameter gamma allows finding communities at different
+The resolution parameter γ allows finding communities at different
 resolutions. Higher values of the resolution parameter typically result in
 more, smaller communities. Lower values typically result in fewer, larger
 communities. The original definition of modularity is retrieved when setting
-gamma=1. Note that the returned modularity value is calculated using
+γ=1. Note that the returned modularity value is calculated using
 the indicated resolution parameter. See igraph_modularity() for more details.
 
 

 

 The original version of this function was contributed by Tom Gregorovic.
 
+

+

+Reference:
+
+

+

+Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E.:
+Fast unfolding of communities in large networks.
+Journal of Statistical Mechanics: Theory and Experiment, 10008(10), 6 (2008).
+https://doi.org/10.1088/1742-5468/2008/10/P10008
+
 

 
Arguments: 
 

@@ -3052,7 +3083,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.6.  File examples/simple/igraph_community_multilevel.c

+
Example 24.6.  File examples/simple/igraph_community_multilevel.c

 

 
#include <igraph.h>
 
@@ -3107,11 +3138,11 @@ 
igraph Reference Manual

                  10, 11, 10, 12, 10, 13, 10, 14,
                  11, 13,
                  -1);
-    igraph_community_multilevel(&g, 0, 1, &membership, &memberships, &modularity);
+    igraph_community_multilevel(&g, 0, 1, &membership, &memberships, &modularity);
     show_results(&g, &membership, &memberships, &modularity, stdout);
 
     /* Higher resolution */
-    igraph_community_multilevel(&g, 0, 1.5, &membership, &memberships, &modularity);
+    igraph_community_multilevel(&g, 0, 1.5, &membership, &memberships, &modularity);
     show_results(&g, &membership, &memberships, &modularity, stdout);
 
     igraph_destroy(&g);
@@ -3131,7 +3162,7 @@ 
igraph Reference Manual

         igraph_vector_int_push_back(&edges, (i * 5 + 6) % 150);
     }
     igraph_create(&g, &edges, 150, 0);
-    igraph_community_multilevel(&g, 0, 1, &membership, &memberships, &modularity);
+    igraph_community_multilevel(&g, 0, 1, &membership, &memberships, &modularity);
     show_results(&g, &membership, &memberships, &modularity, stdout);
     igraph_destroy(&g);
 
@@ -3154,7 +3185,7 @@ 
igraph Reference Manual

 

 

 6.3. igraph_community_leiden —  Finding community structure using the Leiden algorithm.

-

+

 

 
 igraph_error_t igraph_community_leiden(const igraph_t *graph,
@@ -3171,16 +3202,14 @@ 
igraph Reference Manual

 
 
 This function implements the Leiden algorithm for finding community
-structure, see Traag, V. A., Waltman, L., & van Eck, N. J. (2019). From
-Louvain to Leiden: guaranteeing well-connected communities. Scientific
-reports, 9(1), 5233. http://dx.doi.org/10.1038/s41598-019-41695-z
+structure.
 
 

 

 It is similar to the multilevel algorithm, often called the Louvain
 algorithm, but it is faster and yields higher quality solutions. It can
 optimize both modularity and the Constant Potts Model, which does not suffer
-from the resolution-limit (see preprint http://arxiv.org/abs/1104.3083).
+from the resolution-limit (see Tragg, Van Dooren & Nesterov).
 
 

 

@@ -3215,18 +3244,37 @@ 
igraph Reference Manual

 
 

 

-1 / 2m sum_ij (A_ij - gamma n_i n_j)d(s_i, s_j)
+1 / 2m sum_ij (A_ij - γ n_i n_j) δ(s_i, s_j)
+
+

+

+where m is the total edge weight, A_ij is the weight of edge
+(i, j), γ is the so-called resolution parameter, n_i
+is the node weight of node i, s_i is the cluster of node
+i and δ(x, y) = 1 if and only if x = y and 0
+otherwise. By setting n_i = k_i, the degree of node i, and
+dividing γ by 2m, we effectively obtain an expression for
+modularity. Hence, the standard modularity will be optimized when you supply
+the degrees as node_weights and by supplying as a resolution parameter
+1/(2m), with m the number of edges.
+
+

+

+References:
+
+

+

+V. A. Traag, L. Waltman, N. J. van Eck:
+From Louvain to Leiden: guaranteeing well-connected communities.
+Scientific Reports, 9(1), 5233 (2019).
+http://dx.doi.org/10.1038/s41598-019-41695-z
 
 

 

-where m is the total edge weight, A_ij is the weight of edge (i, j), gamma is
-the so-called resolution parameter, n_i is the node weight of node i, s_i is
-the cluster of node i and d(x, y) = 1 if and only if x = y and 0 otherwise.
-By setting n_i = k_i, the degree of node i, and dividing gamma by 2m, you
-effectively obtain an expression for modularity. Hence, the standard
-modularity will be optimized when you supply the degrees as node_weights
-and by supplying as a resolution parameter 1.0/(2*m), with m the number of
-edges.
+V. A. Traag, P. Van Dooren, and Y. Nesterov:
+Narrow scope for resolution-limit-free community detection.
+Phys. Rev. E 84, 016114 (2011).
+https://doi.org/10.1103/PhysRevE.84.016114
 
 

 
Arguments: 
@@ -3337,7 +3385,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.7.  File examples/simple/igraph_community_leiden.c

+
Example 24.7.  File examples/simple/igraph_community_leiden.c

 

 
#include <igraph.h>
 
@@ -3415,7 +3463,7 @@ 
igraph Reference Manual

 

 

 7.1. igraph_community_fluid_communities —  Community detection based on fluids interacting on the graph.

-

+

 

 
 igraph_error_t igraph_community_fluid_communities(const igraph_t *graph,
@@ -3512,7 +3560,7 @@ 
igraph Reference Manual

 

 

 8.1. igraph_community_label_propagation —  Community detection based on label propagation.

-

+

 

 
 igraph_error_t igraph_community_label_propagation(const igraph_t *graph,
@@ -3679,7 +3727,7 @@ 
igraph Reference Manual

 

 

 

-
Example 24.8.  File examples/simple/igraph_community_label_propagation.c

+
Example 24.8.  File examples/simple/igraph_community_label_propagation.c

 

 
#include <igraph.h>
 #include <stdio.h>
@@ -3736,7 +3784,7 @@ 
igraph Reference Manual

 

 

 9.1. igraph_community_infomap —  Find community structure that minimizes the expected description length of a random walker trajectory.

-

+

 

 
 igraph_error_t igraph_community_infomap(const igraph_t * graph,
@@ -3890,7 +3938,7 @@ 
igraph Reference Manual

 

 

 10.1. igraph_community_voronoi —  Finds communities using Voronoi partitioning.

-

+

 

 
 igraph_error_t igraph_community_voronoi(
diff --git a/docs/c/html/master/igraph-Data-structures.html b/docs/c/html/master/igraph-Data-structures.html
index c82c92d1a..8a2b203ad 100644
--- a/docs/c/html/master/igraph-Data-structures.html
+++ b/docs/c/html/master/igraph-Data-structures.html
@@ -178,8 +178,9 @@ 
igraph Reference Manual

 

   Vector is currently defined for igraph_real_t,
   igraph_integer_t (int), char (char),
-  igraph_bool_t (bool) and igraph_complex_t
-  (complex). The default is igraph_real_t.
+  igraph_bool_t (bool), igraph_complex_t
+  (complex) and  and void * (ptr). The default is
+  igraph_real_t.
 

 
matrix

 

@@ -198,8 +199,8 @@ 
igraph Reference Manual

 
stack

 

   Stack is currently defined for igraph_real_t,
-  igraph_integer_t (int), char (char),
-  igraph_bool_t (bool) and void* (ptr).
+  igraph_integer_t (int), char (char) and
+  igraph_bool_t (bool).
   The default is igraph_real_t.
 

 
double-ended queue

@@ -385,7 +386,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_init(igraph_vector_t* v, igraph_integer_t size);
+igraph_error_t igraph_vector_init(igraph_vector_t *v, igraph_integer_t size);
 

 

 

@@ -600,7 +601,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_init_range(igraph_vector_t *v, igraph_real_t from, igraph_real_t to);
+igraph_error_t igraph_vector_init_range(igraph_vector_t *v, igraph_real_t start, igraph_real_t end);
 

 

 

@@ -672,7 +673,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_destroy(igraph_vector_t* v);
+void igraph_vector_destroy(igraph_vector_t *v);
 

 

 

@@ -724,7 +725,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_null(igraph_vector_t* v);
+void igraph_vector_null(igraph_vector_t *v);
 

 

 

@@ -768,7 +769,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_fill(igraph_vector_t* v, igraph_real_t e);
+void igraph_vector_fill(igraph_vector_t *v, igraph_real_t e);
 

 

 

@@ -813,7 +814,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_range(igraph_vector_t *v, igraph_real_t from, igraph_real_t to);
+igraph_error_t igraph_vector_range(igraph_vector_t *v, igraph_real_t start, igraph_real_t end);
 

 

 

@@ -917,7 +918,7 @@ 
igraph Reference Manual

 to access the first element of the vector, you can also use this in
 assignments, like:
 

-
 VECTOR(v)[10]=5; 

+
 VECTOR(v)[10] = 5; 

 

 
 Note that there are no range checks right now.
@@ -949,7 +950,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t igraph_vector_get(const igraph_vector_t* v, igraph_integer_t pos);
+igraph_real_t igraph_vector_get(const igraph_vector_t *v, igraph_integer_t pos);
 

 

 

@@ -1027,7 +1028,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t* igraph_vector_get_ptr(const igraph_vector_t* v, igraph_integer_t pos);
+igraph_real_t* igraph_vector_get_ptr(const igraph_vector_t *v, igraph_integer_t pos);
 

 

 

@@ -1105,7 +1106,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_set(igraph_vector_t* v, igraph_integer_t pos, igraph_real_t value);
+void igraph_vector_set(igraph_vector_t *v, igraph_integer_t pos, igraph_real_t value);
 

 

 

@@ -1821,10 +1822,10 @@ 
igraph Reference Manual

 
     igraph_vector_shuffle(&v);
     /* must have same length */
-    if (igraph_vector_size(&v) != n) {
+    if (igraph_vector_size(&v) != n) {
         return 3;
     }
-    if (igraph_vector_size(&u) != igraph_vector_size(&v)) {
+    if (igraph_vector_size(&u) != igraph_vector_size(&v)) {
         return 4;
     }
     /* must have same elements */
@@ -1858,7 +1859,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_permute(igraph_vector_t* v, const igraph_vector_int_t* index);
+igraph_error_t igraph_vector_permute(igraph_vector_t *v, const igraph_vector_int_t *index);
 

 

 

@@ -2388,7 +2389,7 @@ 
igraph Reference Manual

 

 
 igraph_bool_t igraph_vector_all_e(const igraph_vector_t *lhs,
-        const igraph_vector_t *rhs);
+                                  const igraph_vector_t *rhs);
 

 

 

@@ -2520,7 +2521,7 @@ 
igraph Reference Manual

 

 
 igraph_bool_t igraph_vector_all_l(const igraph_vector_t *lhs,
-        const igraph_vector_t *rhs);
+                                  const igraph_vector_t *rhs);
 

 

 

@@ -2583,7 +2584,7 @@ 
igraph Reference Manual

 

 
 igraph_bool_t igraph_vector_all_g(const igraph_vector_t *lhs,
-        const igraph_vector_t *rhs);
+                                  const igraph_vector_t *rhs);
 

 

 

@@ -2645,9 +2646,8 @@ 
igraph Reference Manual

 

 

 
-igraph_bool_t
-igraph_vector_all_le(const igraph_vector_t *lhs,
-                                const igraph_vector_t *rhs);
+igraph_bool_t igraph_vector_all_le(const igraph_vector_t *lhs,
+                                   const igraph_vector_t *rhs);
 

 

 

@@ -2708,9 +2708,8 @@ 
igraph Reference Manual

 

 

 
-igraph_bool_t
-igraph_vector_all_ge(const igraph_vector_t *lhs,
-                                const igraph_vector_t *rhs);
+igraph_bool_t igraph_vector_all_ge(const igraph_vector_t *lhs,
+                                   const igraph_vector_t *rhs);
 

 

 

@@ -3313,7 +3312,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t igraph_vector_min(const igraph_vector_t* v);
+igraph_real_t igraph_vector_min(const igraph_vector_t *v);
 

 

 

@@ -3366,7 +3365,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t igraph_vector_max(const igraph_vector_t* v);
+igraph_real_t igraph_vector_max(const igraph_vector_t *v);
 

 

 

@@ -3474,7 +3473,7 @@ 
igraph Reference Manual

 

 

 
-igraph_integer_t igraph_vector_which_max(const igraph_vector_t* v);
+igraph_integer_t igraph_vector_which_max(const igraph_vector_t *v);
 

 

 

@@ -3531,7 +3530,7 @@ 
igraph Reference Manual

 

 
 void igraph_vector_minmax(const igraph_vector_t *v,
-                                    igraph_real_t *min, igraph_real_t *max);
+                          igraph_real_t *min, igraph_real_t *max);
 

 

 

@@ -3643,7 +3642,7 @@ 
igraph Reference Manual

 2.11. Vector properties

 

 
2.11.1. igraph_vector_empty —  Decides whether the size of the vector is zero.

-
2.11.2. igraph_vector_size —  Returns the size (=length) of the vector.

+
2.11.2. igraph_vector_size —  The size of the vector.

 
2.11.3. igraph_vector_capacity —  Returns the allocated capacity of the vector.

 
2.11.4. igraph_vector_sum —  Calculates the sum of the elements in the vector.

 
2.11.5. igraph_vector_prod —  Calculates the product of the elements in the vector.

@@ -3659,7 +3658,7 @@ 
igraph Reference Manual

 

 

 
-igraph_bool_t igraph_vector_empty(const igraph_vector_t* v);
+igraph_bool_t igraph_vector_empty(const igraph_vector_t *v);
 

 

 

@@ -3706,11 +3705,11 @@ 
igraph Reference Manual

 

 

 

-2.11.2. igraph_vector_size —  Returns the size (=length) of the vector.

+2.11.2. igraph_vector_size —  The size of the vector.

 

 

 
-igraph_integer_t igraph_vector_size(const igraph_vector_t* v);
+igraph_integer_t igraph_vector_size(const igraph_vector_t *v);
 

 

 

@@ -3719,6 +3718,8 @@ 
igraph Reference Manual

 
 
 
+Returns the number of elements stored in the vector.
+
 

 
Arguments: 
 

@@ -3761,7 +3762,7 @@ 
igraph Reference Manual

 

 

 
-igraph_integer_t igraph_vector_capacity(const igraph_vector_t*v);
+igraph_integer_t igraph_vector_capacity(const igraph_vector_t *v);
 

 

 

@@ -3771,7 +3772,7 @@ 
igraph Reference Manual

 
 
 Note that this might be different from the size of the vector (as
-queried by igraph_vector_size()), and specifies how many elements
+queried by igraph_vector_size()), and specifies how many elements
 the vector can hold, without reallocation.
 
 

@@ -3817,7 +3818,7 @@ 
igraph Reference Manual

 
 

 

-  igraph_vector_size().
+  igraph_vector_size().
   

 
 

@@ -3842,9 +3843,8 @@ 
igraph Reference Manual

 
 
 
-

-

-For the empty vector 0.0 is returned.
+For the empty vector 0 is returned.
+
 

 
Arguments: 
 

@@ -4684,7 +4684,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_reserve(igraph_vector_t* v, igraph_integer_t capacity);
+igraph_error_t igraph_vector_reserve(igraph_vector_t *v, igraph_integer_t capacity);
 

 

 

@@ -4851,7 +4851,7 @@ 
igraph Reference Manual

 

 

 
-void igraph_vector_resize_min(igraph_vector_t*v);
+void igraph_vector_resize_min(igraph_vector_t *v);
 

 

 

@@ -4861,7 +4861,7 @@ 
igraph Reference Manual

 
 
 This function attempts to deallocate the unused reserved storage
-of a vector. If it succeeds, igraph_vector_size() and
+of a vector. If it succeeds, igraph_vector_size() and
 igraph_vector_capacity() will be the same. The data in the
 vector is always preserved, even if deallocation is not successful.
 
@@ -4908,7 +4908,7 @@ 
igraph Reference Manual

 

 

 
-igraph_error_t igraph_vector_push_back(igraph_vector_t* v, igraph_real_t e);
+igraph_error_t igraph_vector_push_back(igraph_vector_t *v, igraph_real_t e);
 

 

 

@@ -4917,10 +4917,9 @@ 
igraph Reference Manual

 
 
 
-

-

 This function resizes the vector to be one element longer and
 sets the very last element in the vector to e.
+
 

 
Arguments: 
 

@@ -4981,7 +4980,7 @@ 
igraph Reference Manual

 

 

 
-igraph_real_t igraph_vector_pop_back(igraph_vector_t* v);
+igraph_real_t igraph_vector_pop_back(igraph_vector_t *v);
 

 

 

@@ -7236,7 +7235,7 @@ 
Warning

 

 

 
-igraph_real_t igraph_vector_e(const igraph_vector_t* v, igraph_integer_t pos);
+igraph_real_t igraph_vector_e(const igraph_vector_t *v, igraph_integer_t pos);
 

 

 

@@ -7261,7 +7260,7 @@ 
Warning

 

 

 
-igraph_real_t* igraph_vector_e_ptr(const igraph_vector_t* v, igraph_integer_t pos);
+igraph_real_t* igraph_vector_e_ptr(const igraph_vector_t *v, igraph_integer_t pos);
 

 

 

@@ -21470,7 +21469,7 @@ 
Warning

 items become invalid at once.

 
Speaking about pointers, the typical way of working with vectors in
 a list is to obtain a pointer to one of the items via the
-igraph_vector_list_get_ptr() method and then passing this pointer
+igraph_vector_list_get_ptr() method and then passing this pointer
 onwards to functions that manipulate igraph_vector_t objects. However,
 note that the pointers are ephemeral in the sense that they may be
 invalidated any time when the list is modified because a modification may
@@ -21500,15 +21499,15 @@ 
Warning

 list due to the ownership rules. If you want to keep a few of the vectors
 in the vector list, you need to copy them with igraph_vector_init_copy() or
 igraph_vector_update(), or you need to remove them from the list and
-take ownership by calling igraph_vector_list_pop_back(),
-igraph_vector_list_remove() or igraph_vector_list_remove_fast() .

+take ownership by calling igraph_vector_list_pop_back(),
+igraph_vector_list_remove() or igraph_vector_list_remove_fast() .

 

 

 9.2.1. igraph_vector_list_init —  Initializes a list of vectors (constructor).

 

 

 
-igraph_error_t igraph_vector_list_init(igraph_vector_list_t* v, igraph_integer_t size);
+igraph_error_t igraph_vector_list_init(igraph_vector_list_t *v, igraph_integer_t size);
 

 

 

@@ -21582,7 +21581,7 @@ 
Warning

 

 

 
-void igraph_vector_list_destroy(igraph_vector_list_t* v);
+void igraph_vector_list_destroy(igraph_vector_list_t *v);
 

 

 

@@ -21629,13 +21628,13 @@ 
Warning

 

 9.3.  Accessing elements

 

-
9.3.1. igraph_vector_list_get_ptr —  Retrieve the address of a vector in the vector list.

-
9.3.2. igraph_vector_list_tail_ptr —  Retrieve the address of the last vector in the vector list.

+
9.3.1. igraph_vector_list_get_ptr —  The address of a vector in the vector list.

+
9.3.2. igraph_vector_list_tail_ptr —  The address of the last vector in the vector list.

 
9.3.3. igraph_vector_list_set —  Sets the vector at the given index in the list.

 
9.3.4. igraph_vector_list_replace —  Replaces the vector at the given index in the list with another one.

 

 
Elements of a vector list may be accessed with the
-igraph_vector_list_get_ptr() function. The function returns a pointer
+igraph_vector_list_get_ptr() function. The function returns a pointer
 to the vector with a given index inside the list, and you may then pass
 this pointer onwards to other functions that can query or manipulate
 vectors. The pointer itself is guaranteed to stay valid as long as the
@@ -21650,22 +21649,22 @@ 
Warning

 
Note that the standard VECTOR macro that works for ordinary vectors
 does not work for lists of vectors to access the i-th element (but of course
 you can use it to index into an existing vector that you retrieved from the
-vector list with igraph_vector_list_get_ptr() ). This is because the
+vector list with igraph_vector_list_get_ptr() ). This is because the
 macro notation would allow one to overwrite the vector in the list with
 another one without the list knowing about it, so the list would not be able
 to destroy the vector that was overwritten by a new one.
 

-
 igraph_vector_list_tail_ptr() returns a pointer to the last
+
 igraph_vector_list_tail_ptr() returns a pointer to the last
 vector in the list, or NULL if the list is empty. There is no
 igraph_vector_list_head_ptr(), however, as it is easy to
 write igraph_vector_list_get_ptr(v, 0) instead.

 

 

-9.3.1. igraph_vector_list_get_ptr —  Retrieve the address of a vector in the vector list.

+9.3.1. igraph_vector_list_get_ptr —  The address of a vector in the vector list.

 

 

 
-igraph_vector_t* igraph_vector_list_get_ptr(const igraph_vector_list_t* v, igraph_integer_t pos);
+igraph_vector_t *igraph_vector_list_get_ptr(const igraph_vector_list_t *v, igraph_integer_t pos);
 

 

 

@@ -21673,6 +21672,7 @@ 
Warning

 
 
 
+
 

 
Arguments: 
 

@@ -21721,11 +21721,11 @@ 
Warning

 

 

 

-9.3.2. igraph_vector_list_tail_ptr —  Retrieve the address of the last vector in the vector list.

+9.3.2. igraph_vector_list_tail_ptr —  The address of the last vector in the vector list.

 

 

 
-igraph_vector_t* igraph_vector_list_tail_ptr(const igraph_vector_list_t *v);
+igraph_vector_t *igraph_vector_list_tail_ptr(const igraph_vector_list_t *v);
 

 

 

@@ -21733,6 +21733,7 @@ 
Warning

 
 
 
+
 

 
Arguments: 
 

@@ -21776,7 +21777,7 @@ 
Warning

 

 

 
-void igraph_vector_list_set(igraph_vector_list_t* v, igraph_integer_t pos, igraph_vector_t* e);
+void igraph_vector_list_set(igraph_vector_list_t *v, igraph_integer_t pos, igraph_vector_t *e);
 

 

 

@@ -21835,7 +21836,7 @@ 
Warning

 

 

 
-void igraph_vector_list_replace(igraph_vector_list_t* v, igraph_integer_t pos, igraph_vector_t* e);
+void igraph_vector_list_replace(igraph_vector_list_t *v, igraph_integer_t pos, igraph_vector_t *e);
 

 

 

@@ -21895,7 +21896,7 @@ 
Warning

 9.4. Vector properties

 

 
9.4.1. igraph_vector_list_empty —  Decides whether the size of the list is zero.

-
9.4.2. igraph_vector_list_size —  Returns the size (=length) of the vector.

+
9.4.2. igraph_vector_list_size —  The size of the vector list.

 
9.4.3. igraph_vector_list_capacity —  Returns the allocated capacity of the list.

 

 

@@ -21904,7 +21905,7 @@ 
Warning

 

 

 
-igraph_bool_t igraph_vector_list_empty(const igraph_vector_list_t* v);
+igraph_bool_t igraph_vector_list_empty(const igraph_vector_list_t *v);
 

 

 

@@ -21951,11 +21952,11 @@ 
Warning

 

 

 

-9.4.2. igraph_vector_list_size —  Returns the size (=length) of the vector.

+9.4.2. igraph_vector_list_size —  The size of the vector list.

 

 

 
-igraph_integer_t igraph_vector_list_size(const igraph_vector_list_t* v);
+igraph_integer_t igraph_vector_list_size(const igraph_vector_list_t *v);
 

 

 

@@ -21964,6 +21965,8 @@ 
Warning

 
 
 
+Returns the number of vectors stored in the list.
+
 

 
Arguments: 
 

@@ -22006,7 +22009,7 @@ 
Warning

 

 

 
-igraph_integer_t igraph_vector_list_capacity(const igraph_vector_list_t* v);
+igraph_integer_t igraph_vector_list_capacity(const igraph_vector_list_t *v);
 

 

 

@@ -22016,7 +22019,7 @@ 
Warning

 
 
 Note that this might be different from the size of the list (as
-queried by igraph_vector_list_size()), and specifies how many vectors
+queried by igraph_vector_list_size()), and specifies how many vectors
 the list can hold, without reallocation.
 
 

@@ -22061,7 +22064,7 @@ 
Warning

 
 

 

-  igraph_vector_list_size().
+  igraph_vector_list_size().
   

 
 

@@ -22078,19 +22081,19 @@ 
Warning

 

 
9.5.1. igraph_vector_list_clear —  Removes all elements from a list of vectors.

 
9.5.2. igraph_vector_list_reserve —  Reserves memory for a list.

-
9.5.3. igraph_vector_list_resize —  Resize the list of vectors.

-
9.5.4. igraph_vector_list_push_back —  Append an existing vector to the list, transferring ownership.

-
9.5.5. igraph_vector_list_push_back_copy —  Append the copy of a vector to the list.

-
9.5.6. igraph_vector_list_push_back_new —  Append a new vector to the list.

-
9.5.7. igraph_vector_list_pop_back —  Remove the last item from the vector list and transfer ownership to the caller.

-
9.5.8. igraph_vector_list_insert —  Insert an existing vector into the list, transferring ownership.

-
9.5.9. igraph_vector_list_insert_copy —  Insert the copy of a vector to the list.

-
9.5.10. igraph_vector_list_insert_new —  Insert a new vector into the list.

-
9.5.11. igraph_vector_list_remove —  Remove the item at the given index from the vector list and transfer ownership to the caller.

-
9.5.12. igraph_vector_list_remove_fast —  Remove the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.

-
9.5.13. igraph_vector_list_discard —  Discard the item at the given index in the vector list.

-
9.5.14. igraph_vector_list_discard_back —  Discard the last item in the vector list.

-
9.5.15. igraph_vector_list_discard_fast —  Discard the item at the given index in the vector list and move the last item to its place.

+
9.5.3. igraph_vector_list_resize —  Resizes the list of vectors.

+
9.5.4. igraph_vector_list_push_back —  Appends an existing vector to the list, transferring ownership.

+
9.5.5. igraph_vector_list_push_back_copy —  Appends the copy of a vector to the list.

+
9.5.6. igraph_vector_list_push_back_new —  Appends a new vector to the list.

+
9.5.7. igraph_vector_list_pop_back —  Removes the last item from the vector list and transfer ownership to the caller.

+
9.5.8. igraph_vector_list_insert —  Inserts an existing vector into the list, transferring ownership.

+
9.5.9. igraph_vector_list_insert_copy —  Inserts the copy of a vector to the list.

+
9.5.10. igraph_vector_list_insert_new —  Inserts a new vector into the list.

+
9.5.11. igraph_vector_list_remove —  Removes the item at the given index from the vector list and transfer ownership to the caller.

+
9.5.12. igraph_vector_list_remove_fast —  Removes the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.

+
9.5.13. igraph_vector_list_discard —  Discards the item at the given index in the vector list.

+
9.5.14. igraph_vector_list_discard_back —  Discards the last item in the vector list.

+
9.5.15. igraph_vector_list_discard_fast —  Discards the item at the given index in the vector list and moves the last item to its place.

 

 

 

@@ -22098,7 +22101,7 @@ 
Warning

 

 

 
-void igraph_vector_list_clear(igraph_vector_list_t* v);
+void igraph_vector_list_clear(igraph_vector_list_t *v);
 

 

 

@@ -22107,8 +22110,6 @@ 
Warning

 
 
 
-

-

 This function sets the size of the list to zero, and it also destroys all
 the vectors that were placed in the list before clearing it.
 
@@ -22139,7 +22140,7 @@ 
Warning

 

 

 
-igraph_error_t igraph_vector_list_reserve(igraph_vector_list_t* v, igraph_integer_t capacity);
+igraph_error_t igraph_vector_list_reserve(igraph_vector_list_t *v, igraph_integer_t capacity);
 

 

 

@@ -22210,11 +22211,11 @@ 
Warning

 

 

 

-9.5.3. igraph_vector_list_resize —  Resize the list of vectors.

+9.5.3. igraph_vector_list_resize —  Resizes the list of vectors.

 

 

 
-igraph_error_t igraph_vector_list_resize(igraph_vector_list_t* v, igraph_integer_t new_size);
+igraph_error_t igraph_vector_list_resize(igraph_vector_list_t *v, igraph_integer_t new_size);
 

 

 

@@ -22305,11 +22306,11 @@ 
Warning

 

 

 

-9.5.4. igraph_vector_list_push_back —  Append an existing vector to the list, transferring ownership.

+9.5.4. igraph_vector_list_push_back —  Appends an existing vector to the list, transferring ownership.

 

 

 
-igraph_error_t igraph_vector_list_push_back(igraph_vector_list_t* v, igraph_vector_t* e);
+igraph_error_t igraph_vector_list_push_back(igraph_vector_list_t *v, igraph_vector_t *e);
 

 

 

@@ -22318,8 +22319,6 @@ 
Warning

 
 
 
-

-

 This function resizes the list to be one element longer, and sets the very last
 element in the list to the specified vector e . The list takes ownership
 of the vector so the user is not responsible for freeing e any more;
@@ -22380,11 +22379,11 @@ 
Warning

 

 

 

-9.5.5. igraph_vector_list_push_back_copy —  Append the copy of a vector to the list.

+9.5.5. igraph_vector_list_push_back_copy —  Appends the copy of a vector to the list.

 

 

 
-igraph_error_t igraph_vector_list_push_back_copy(igraph_vector_list_t* v, const igraph_vector_t* e);
+igraph_error_t igraph_vector_list_push_back_copy(igraph_vector_list_t *v, const igraph_vector_t *e);
 

 

 

@@ -22393,8 +22392,6 @@ 
Warning

 
 
 
-

-

 This function resizes the list to be one element longer, and copies the
 specified vector given as an argument to the last element. The newly added
 element is owned by the list, but the ownership of the original vector is
@@ -22441,18 +22438,18 @@ 
Warning

 

 

 
-Time complexity: same as igraph_vector_list_push_back() plus the time
+Time complexity: same as igraph_vector_list_push_back() plus the time
 needed to copy the vector (which is O(n) for n elements in the vector).
  
 

 

 

 

-9.5.6. igraph_vector_list_push_back_new —  Append a new vector to the list.

+9.5.6. igraph_vector_list_push_back_new —  Appends a new vector to the list.

 

 

 
-igraph_error_t igraph_vector_list_push_back_new(igraph_vector_list_t* v, igraph_vector_t** e);
+igraph_error_t igraph_vector_list_push_back_new(igraph_vector_list_t *v, igraph_vector_t** e);
 

 

 

@@ -22461,8 +22458,6 @@ 
Warning

 
 
 
-

-

 This function resizes the list to be one element longer. The newly added
 element will be an empty vector that is owned by the list. A pointer to
 the newly added element is returned in the last argument if it is not
@@ -22511,17 +22506,17 @@ 
Warning

 

 

 
-Time complexity: same as igraph_vector_list_push_back().
+Time complexity: same as igraph_vector_list_push_back().
  
 

 

 

 

-9.5.7. igraph_vector_list_pop_back —  Remove the last item from the vector list and transfer ownership to the caller.

+9.5.7. igraph_vector_list_pop_back —  Removes the last item from the vector list and transfer ownership to the caller.

 

 

 
-igraph_vector_t igraph_vector_list_pop_back(igraph_vector_list_t* v);
+igraph_vector_t igraph_vector_list_pop_back(igraph_vector_list_t *v);
 

 

 

@@ -22530,8 +22525,6 @@ 
Warning

 
 
 
-

-

 This function removes the last vector from the list. The vector that was
 removed from the list is returned and its ownership is passed back to the
 caller; in other words, the caller becomes responsible for destroying
@@ -22559,7 +22552,7 @@ 
Warning

 
 
result:

 

-  Pointer to an igraph_vector_t object; it will be updated to the
+  Pointer to an igraph_vector_t object; it will be updated to the
        item that was removed from the list. Ownership of this vector is
        passed on to the caller.

 
@@ -22574,11 +22567,11 @@ 
Warning

 

 

 

-9.5.8. igraph_vector_list_insert —  Insert an existing vector into the list, transferring ownership.

+9.5.8. igraph_vector_list_insert —  Inserts an existing vector into the list, transferring ownership.

 

 

 
-igraph_error_t igraph_vector_list_insert(igraph_vector_list_t* v, igraph_integer_t pos, igraph_vector_t* e);
+igraph_error_t igraph_vector_list_insert(igraph_vector_list_t *v, igraph_integer_t pos, igraph_vector_t *e);
 

 

 

@@ -22587,8 +22580,6 @@ 
Warning

 
 
 
-

-

 This function inserts e into the list at the given index, moving other
 items towards the end of the list as needed. The list takes ownership
 of the vector so the user is not responsible for freeing e any more;
@@ -22648,11 +22639,11 @@ 
Warning

 

 

 

-9.5.9. igraph_vector_list_insert_copy —  Insert the copy of a vector to the list.

+9.5.9. igraph_vector_list_insert_copy —  Inserts the copy of a vector to the list.

 

 

 
-igraph_error_t igraph_vector_list_insert_copy(igraph_vector_list_t* v, igraph_integer_t pos, const igraph_vector_t* e);
+igraph_error_t igraph_vector_list_insert_copy(igraph_vector_list_t *v, igraph_integer_t pos, const igraph_vector_t *e);
 

 

 

@@ -22661,8 +22652,6 @@ 
Warning

 
 
 
-

-

 This function inserts a copy of e into the list at the given index, moving
 other items towards the end of the list as needed. The newly added
 element is owned by the list, but the ownership of the original vector is
@@ -22715,18 +22704,18 @@ 
Warning

 

 

 
-Time complexity: same as igraph_vector_list_insert() plus the time
+Time complexity: same as igraph_vector_list_insert() plus the time
 needed to copy the vector (which is O(n) for n elements in the vector).
  
 

 

 

 

-9.5.10. igraph_vector_list_insert_new —  Insert a new vector into the list.

+9.5.10. igraph_vector_list_insert_new —  Inserts a new vector into the list.

 

 

 
-igraph_error_t igraph_vector_list_insert_new(igraph_vector_list_t* v, igraph_integer_t pos, igraph_vector_t** e);
+igraph_error_t igraph_vector_list_insert_new(igraph_vector_list_t *v, igraph_integer_t pos, igraph_vector_t** e);
 

 

 

@@ -22735,8 +22724,6 @@ 
Warning

 
 
 
-

-

 This function inserts a newly created empty vector into the list at the given
 index, moving other items towards the end of the list as needed. The newly
 added vector is owned by the list. A pointer to the new element is returned
@@ -22791,17 +22778,17 @@ 
Warning

 

 

 
-Time complexity: same as igraph_vector_list_push_back().
+Time complexity: same as igraph_vector_list_push_back().
  
 

 

 

 

-9.5.11. igraph_vector_list_remove —  Remove the item at the given index from the vector list and transfer ownership to the caller.

+9.5.11. igraph_vector_list_remove —  Removes the item at the given index from the vector list and transfer ownership to the caller.

 

 

 
-igraph_error_t igraph_vector_list_remove(igraph_vector_list_t* v, igraph_integer_t index, igraph_vector_t* result);
+igraph_error_t igraph_vector_list_remove(igraph_vector_list_t *v, igraph_integer_t index, igraph_vector_t *result);
 

 

 

@@ -22810,8 +22797,6 @@ 
Warning

 
 
 
-

-

 This function removes the vector at the given index from the list, and
 moves all subsequent items in the list by one slot to the left to fill
 the gap. The vector that was removed from the list is returned in e
@@ -22842,7 +22827,7 @@ 
Warning

 
 
result:

 

-  Pointer to an igraph_vector_t object; it will be updated to the
+  Pointer to an igraph_vector_t object; it will be updated to the
        item that was removed from the list. Ownership of this vector is
        passed on to the caller. It is an error to supply a null pointer here.
 

@@ -22860,8 +22845,8 @@ 
Warning

 
 

 

-  igraph_vector_list_discard() if you are not interested in the item
-that was removed, igraph_vector_list_remove_fast() if you do not care
+  igraph_vector_list_discard() if you are not interested in the item
+that was removed, igraph_vector_list_remove_fast() if you do not care
 about the order of the items in the list.
   

 
@@ -22874,11 +22859,11 @@ 
Warning

 

 

 

-9.5.12. igraph_vector_list_remove_fast —  Remove the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.

+9.5.12. igraph_vector_list_remove_fast —  Removes the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.

 

 

 
-igraph_error_t igraph_vector_list_remove_fast(igraph_vector_list_t* v, igraph_integer_t index, igraph_vector_t* result);
+igraph_error_t igraph_vector_list_remove_fast(igraph_vector_list_t *v, igraph_integer_t index, igraph_vector_t *result);
 

 

 

@@ -22887,8 +22872,6 @@ 
Warning

 
 
 
-

-

 This function removes the vector at the given index from the list,
 moves the last item in the list to index to fill the gap, and then
 transfers ownership of the removed vector back to the caller; in other words,
@@ -22919,7 +22902,7 @@ 
Warning

 
 
result:

 

-  Pointer to an igraph_vector_t object; it will be updated to the
+  Pointer to an igraph_vector_t object; it will be updated to the
        item that was removed from the list. Ownership of this vector is
        passed on to the caller. It is an error to supply a null pointer here.
 

@@ -22937,8 +22920,8 @@ 
Warning

 
 

 

-  igraph_vector_list_remove() if you want to preserve the order of the
-items in the list, igraph_vector_list_discard_fast() if you are not
+  igraph_vector_list_remove() if you want to preserve the order of the
+items in the list, igraph_vector_list_discard_fast() if you are not
 interested in the item that was removed.
   

 
@@ -22951,11 +22934,11 @@ 
Warning

 

 

 

-9.5.13. igraph_vector_list_discard —  Discard the item at the given index in the vector list.

+9.5.13. igraph_vector_list_discard —  Discards the item at the given index in the vector list.

 

 

 
-void igraph_vector_list_discard(igraph_vector_list_t* v, igraph_integer_t index);
+void igraph_vector_list_discard(igraph_vector_list_t *v, igraph_integer_t index);
 

 

 

@@ -22964,8 +22947,6 @@ 
Warning

 
 
 
-

-

 This function removes the vector at the given index from the list, and
 moves all subsequent items in the list by one slot to the left to fill
 the gap. The vector that was removed from the list is destroyed automatically.
@@ -23004,8 +22985,8 @@ 
Warning

 
 

 

-  igraph_vector_list_discard_fast() if you do not care about the
-order of the items in the list, igraph_vector_list_remove() if you
+  igraph_vector_list_discard_fast() if you do not care about the
+order of the items in the list, igraph_vector_list_remove() if you
 want to gain ownership of the item that was removed instead of destroying it.
   

 
@@ -23018,11 +22999,11 @@ 
Warning

 

 

 

-9.5.14. igraph_vector_list_discard_back —  Discard the last item in the vector list.

+9.5.14. igraph_vector_list_discard_back —  Discards the last item in the vector list.

 

 

 
-void igraph_vector_list_discard_back(igraph_vector_list_t* v);
+void igraph_vector_list_discard_back(igraph_vector_list_t *v);
 

 

 

@@ -23031,8 +23012,6 @@ 
Warning

 
 
 
-

-

 This function removes the last vector from the list and destroys it.
 
 

@@ -23058,11 +23037,11 @@ 
Warning

 

 

 

-9.5.15. igraph_vector_list_discard_fast —  Discard the item at the given index in the vector list and move the last item to its place.

+9.5.15. igraph_vector_list_discard_fast —  Discards the item at the given index in the vector list and moves the last item to its place.

 

 

 
-void igraph_vector_list_discard_fast(igraph_vector_list_t* v, igraph_integer_t index);
+void igraph_vector_list_discard_fast(igraph_vector_list_t *v, igraph_integer_t index);
 

 

 

@@ -23071,8 +23050,6 @@ 
Warning

 
 
 
-

-

 This function removes the vector at the given index from the list, and
 moves the last item in the list to index to fill the gap. The vector that
 was removed from the list is destroyed automatically.
@@ -23111,8 +23088,8 @@ 
Warning

 
 

 

-  igraph_vector_list_discard() if you want to preserve the order of the
-items in the list, igraph_vector_list_remove_fast() if you want to gain
+  igraph_vector_list_discard() if you want to preserve the order of the
+items in the list, igraph_vector_list_remove_fast() if you want to gain
 ownership of the item that was removed instead of destroying it.
   

 
@@ -23140,7 +23117,7 @@ 
Warning

 

 

 
-igraph_error_t igraph_vector_list_permute(igraph_vector_list_t* v, const igraph_vector_int_t* index);
+igraph_error_t igraph_vector_list_permute(igraph_vector_list_t *v, const igraph_vector_int_t* index);
 

 

 

@@ -23411,6 +23388,7 @@ 
Warning

 
 
 Note that currently no range checking is performed.
+
 

 
Arguments: 
 

@@ -23976,8 +23954,9 @@ 
Warning

 

 
 
-Returns a pointer to an igraph_vector_int_t object from an
+Returns a pointer to an igraph_vector_int_t object from an
 adjacency list. The vector can be modified as desired.
+
 

 
Arguments: 
 

@@ -24012,7 +23991,7 @@ 
Warning

 
 

 

-  Pointer to the igraph_vector_int_t object.
+  Pointer to the igraph_vector_int_t object.
   

 
 

@@ -25791,13 +25770,18 @@ 
Warning

 single bit of memory.

 
The elements in an igraph_bitset_t object and its variants are
 indexed from zero, we follow the usual C convention here. Bitsets are indexed
-from right to left, meaning index 0 is the least significant bit and index n-1
-is the most significant bit.

+from right to left, meaning index 0 is the least significant bit and index
+n - 1 is the most significant bit.

 
The elements of a bitset always occupy a single block of
 memory, the starting address of this memory block can be queried
 with the VECTOR() macro. This way, bitset objects can be used
 with standard mathematical libraries, like the GNU Scientific
 Library.

+
Note that while the interface of bitset functions is similar to
+igraph's vector functions, there is one major difference: bitset functions
+such as igraph_bitset_and() do not verify that that sizes of input
+parameters are compatible, and do not automatically resize the output
+parameter. Doing so is the responsibility of the user.

 

 

 

@@ -25925,11 +25909,9 @@ 
Warning

 We reserve the right to change the function signature without changing the
 major version of igraph. Use it at your own risk.

 

-

-

-
-The contents of the existing bitset object will be copied to
+
The contents of the existing bitset object will be copied to
 the new one.
+
 

 
Arguments: 
 

@@ -26000,9 +25982,7 @@ 
Warning

 We reserve the right to change the function signature without changing the
 major version of igraph. Use it at your own risk.

 

-

-

-All bitsets initialized by igraph_bitset_init() should be properly
+
All bitsets initialized by igraph_bitset_init() should be properly
 destroyed by this function. A destroyed bitset needs to be
 reinitialized by igraph_bitset_init() or
 another constructor.
@@ -26442,7 +26422,7 @@ 
Warning

 

 
 
-* 

+

 
See also: 

 
@@ -26569,13 +26549,13 @@ 
Warning

+  A bitset. Must have have same size as dest.

 

 

 
src1:

 

-  A bitset
+  A bitset. Must have have same size as dest.
 

 

 

 
src2:

 

-  A bitset

 

 
 

@@ -26633,13 +26613,13 @@ 
Warning

 
 
src1:

 

-  A bitset
+  A bitset. Must have have same size as dest.
 

 
 
 
src2:

 

-  A bitset

+  A bitset. Must have have same size as dest.

 
 
 

@@ -26698,13 +26678,13 @@ 
Warning

 
 
src1:

 

-  A bitset
+  A bitset. Must have have same size as dest.
 

 
 
 
src2:

 

-  A bitset

+  A bitset. Must have have same size as dest.

 
 
 

@@ -26761,7 +26741,7 @@ 
Warning

 
 
src:

 

-  A bitset

+  A bitset. Must have have same size as dest.

 
 
 

@@ -27488,9 +27468,7 @@ 
Warning

 We reserve the right to change the function signature without changing the
 major version of igraph. Use it at your own risk.

 

-

-

-igraph bitsets are flexible, they can grow and
+
igraph bitsets are flexible, they can grow and
 shrink. Growing
 however occasionally needs the data in the bitset to be copied.
 In order to avoid this, you can call this function to reserve space for
@@ -27503,6 +27481,7 @@ 
Warning

 reserve space for 100 elements and the size of your
 bitset was (and still is) 60, then you can surely add additional 40
 elements to your bitset before it will be copied.
+
 

 
Arguments: 
 

@@ -27573,9 +27552,7 @@ 
Warning

 We reserve the right to change the function signature without changing the
 major version of igraph. Use it at your own risk.

 

-

-

-Note that this function does not free any memory, just sets the
+
Note that this function does not free any memory, just sets the
 size of the bitset to the given one. It may, on the other hand,
 allocate more memory if the new size is larger than the previous
 one. In this case the newly appeared elements in the bitset are
diff --git a/docs/c/html/master/igraph-Foreign.html b/docs/c/html/master/igraph-Foreign.html
index d385ab458..d9924fa8e 100644
--- a/docs/c/html/master/igraph-Foreign.html
+++ b/docs/c/html/master/igraph-Foreign.html
@@ -1135,7 +1135,7 @@ 
igraph Reference Manual

 
 

 

-  igraph_write_graph_dimacs()
+  igraph_write_graph_dimacs_flow()
   

 
 

diff --git a/docs/c/html/master/igraph-Generators.html b/docs/c/html/master/igraph-Generators.html
index 91486c008..a76ce3582 100644
--- a/docs/c/html/master/igraph-Generators.html
+++ b/docs/c/html/master/igraph-Generators.html
@@ -1080,7 +1080,7 @@ 
igraph Reference Manual

 

   Logical, for undirected graphs this specified
        whether each edge is included twice, in the vectors of
-       both adjacent vertices. If this is false (0), then it is
+       both adjacent vertices. If this is false, then it is
        assumed that every edge is included only once. This argument
        is ignored for directed graphs.
 

diff --git a/docs/c/html/master/igraph-Motifs.html b/docs/c/html/master/igraph-Motifs.html
index ff979cce2..6cfe05049 100644
--- a/docs/c/html/master/igraph-Motifs.html
+++ b/docs/c/html/master/igraph-Motifs.html
@@ -902,7 +902,7 @@ 
igraph Reference Manual

     /* Compute the total number of motifs (connected 4-vertex subgraphs)
      * so that we can print the normalized distribution. */
     igraph_real_t sum = 0.0;
-    igraph_integer_t n = igraph_vector_size(&hist);
+    igraph_integer_t n = igraph_vector_size(&hist);
     for (igraph_integer_t i=0; i < n; i++) {
         if (!isnan(VECTOR(hist)[i])) {
             sum += VECTOR(hist)[i];
@@ -1287,7 +1287,7 @@ 
igraph Reference Manual

     /* Compute the total number of motifs (connected 4-vertex subgraphs)
      * so that we can print the normalized distribution. */
     igraph_real_t sum = 0.0;
-    igraph_integer_t n = igraph_vector_size(&hist);
+    igraph_integer_t n = igraph_vector_size(&hist);
     for (igraph_integer_t i=0; i < n; i++) {
         if (!isnan(VECTOR(hist)[i])) {
             sum += VECTOR(hist)[i];
diff --git a/docs/c/html/master/igraph-Operators.html b/docs/c/html/master/igraph-Operators.html
index 36a020767..376a06b4b 100644
--- a/docs/c/html/master/igraph-Operators.html
+++ b/docs/c/html/master/igraph-Operators.html
@@ -941,7 +941,7 @@ 
Warning

 
#include <igraph.h>
 
 void print_vector(igraph_vector_t *v) {
-    igraph_integer_t i, l = igraph_vector_size(v);
+    igraph_integer_t i, l = igraph_vector_size(v);
     for (i = 0; i < l; i++) {
         printf(" %" IGRAPH_PRId "", (igraph_integer_t) VECTOR(*v)[i]);
     }
diff --git a/docs/c/html/master/igraph-Structural.html b/docs/c/html/master/igraph-Structural.html
index 720774955..7f7da5cb7 100644
--- a/docs/c/html/master/igraph-Structural.html
+++ b/docs/c/html/master/igraph-Structural.html
@@ -1820,7 +1820,7 @@ 
Warning

 
IGRAPH_FLOYD_WARSHALL_AUTOMATIC

 

 
-         tried to select the best performing variant for the current graph;
+         tries to select the best performing variant for the current graph;
          presently this option always uses the "Tree" method.
        
 

@@ -2575,11 +2575,11 @@ 
Warning

 
 

 

-  igraph_distances_dijkstra() if you only need the path length but
+  igraph_distances_dijkstra() if you only need the path lengths but
 not the paths themselves; igraph_get_shortest_paths() if all edge
 weights are equal; igraph_get_all_shortest_paths() to find all
 shortest paths between (source, target) pairs;
-igraph_get_shortest_paths_bellman_ford() if some edge weighted are
+igraph_get_shortest_paths_bellman_ford() if some edge weights are
 negative.
   

 
@@ -3786,7 +3786,7 @@ 
Warning

 

 

   igraph_distances_dijkstra() if you only need the path
-length but not the paths themselves, igraph_get_all_shortest_paths()
+lengths but not the paths themselves, igraph_get_all_shortest_paths()
 if all edge weights are equal.
   

 
@@ -9182,8 +9182,8 @@ 
Warning

   The maximum number of components to return. The
    first maxcompno components will be returned (which hold at
    least minelements vertices, see the next parameter), the
-   others will be ignored. Supply -1 here if you don't want to limit
-   the number of components.
+   others will be ignored. Supply -1 here if you don't
+   want to limit the number of components.
 

 
 
@@ -9191,7 +9191,7 @@ 
Warning

 

   The minimum number of vertices a component
    should contain in order to place it in the components
-   vector. Eg. supply 2 here to ignore isolated vertices.
+   vector. For example, supplying 2 here ignored isolated vertices.
 

 
 
@@ -16896,11 +16896,13 @@ 
Warning

 
#include <igraph.h>
 
 int main(void) {
-
-    igraph_t graph, tree;
+    igraph_t graph;
     igraph_vector_t eb;
     igraph_vector_int_t edges;
 
+    /* Create the vector where the tree edges will be stored. */
+    igraph_vector_int_init(&edges, 0);
+
     /* Create the Frucht graph */
     igraph_famous(&graph, "Frucht");
 
@@ -16908,17 +16910,17 @@ 
Warning

     igraph_vector_init(&eb, igraph_ecount(&graph));
     igraph_edge_betweenness(&graph, &eb, IGRAPH_UNDIRECTED, /*weights=*/ NULL);
 
-    /* Compute and output a minimum weight spanning tree using edge betweenness
-     * values as weights. */
-    igraph_minimum_spanning_tree_prim(&graph, &tree, &eb);
-    printf("Minimum spanning tree:\n");
-    igraph_write_graph_edgelist(&tree, stdout);
+    /* Use Prim's algorithm to compute the edges that belong to the minimum weight
+     * spanning tree, using edge betweenness values as edge weights. */
+    igraph_minimum_spanning_tree(&graph, &edges, &eb);
+    printf("Minimum spanning tree edges:\n");
+    igraph_vector_int_print(&edges);
 
     /* A maximum spanning tree can be computed by first negating the weights. */
     igraph_vector_scale(&eb, -1);
 
-    /* Compute and output the edges that belong to the maximum weight spanning tree. */
-    igraph_vector_int_init(&edges, 0);
+    /* Compute and output the edges that belong to the maximum weight spanning tree,
+     * letting igraph automatically select the most suitable algorithm. */
     igraph_minimum_spanning_tree(&graph, &edges, &eb);
     printf("\nMaximum spanning tree edges:\n");
     igraph_vector_int_print(&edges);
@@ -16931,10 +16933,9 @@ 
Warning

     printf("\nTotal maximum spanning tree weight: %g\n", total_tree_weight);
 
     /* Clean up */
-    igraph_vector_int_destroy(&edges);
-    igraph_destroy(&tree);
     igraph_destroy(&graph);
     igraph_vector_destroy(&eb);
+    igraph_vector_int_destroy(&edges);
 
     return 0;
 }
@@ -16963,6 +16964,14 @@ 
Warning

 
 
 
+

+

+
Warning

+
Deprecated since version 0.10.14. Please do not use this function in new
+code; use igraph_minimum_spanning_tree()
+instead.

+

+

 If the graph has more minimum spanning trees (this is always the
 case, except if it is a forest) this implementation returns only
 the same one.
@@ -17063,6 +17072,14 @@ 
Warning

 
 
 
+

+

+
Warning

+
Deprecated since version 0.10.14. Please do not use this function in new
+code; use igraph_minimum_spanning_tree()
+instead.

+

+

 Finds a spanning tree or spanning forest for which the sum of edge
 weights is the smallest. This function uses Prim's method for carrying
 out the computation.
@@ -17164,16 +17181,18 @@ 
Warning

 

 

 

-
Example 13.32.  File examples/simple/igraph_minimum_spanning_tree.c

+
Example 13.32.  File examples/simple/igraph_minimum_spanning_tree.c

 

 
#include <igraph.h>
 
 int main(void) {
-
-    igraph_t graph, tree;
+    igraph_t graph;
     igraph_vector_t eb;
     igraph_vector_int_t edges;
 
+    /* Create the vector where the tree edges will be stored. */
+    igraph_vector_int_init(&edges, 0);
+
     /* Create the Frucht graph */
     igraph_famous(&graph, "Frucht");
 
@@ -17181,17 +17200,17 @@ 
Warning

     igraph_vector_init(&eb, igraph_ecount(&graph));
     igraph_edge_betweenness(&graph, &eb, IGRAPH_UNDIRECTED, /*weights=*/ NULL);
 
-    /* Compute and output a minimum weight spanning tree using edge betweenness
-     * values as weights. */
-    igraph_minimum_spanning_tree_prim(&graph, &tree, &eb);
-    printf("Minimum spanning tree:\n");
-    igraph_write_graph_edgelist(&tree, stdout);
+    /* Use Prim's algorithm to compute the edges that belong to the minimum weight
+     * spanning tree, using edge betweenness values as edge weights. */
+    igraph_minimum_spanning_tree(&graph, &edges, &eb);
+    printf("Minimum spanning tree edges:\n");
+    igraph_vector_int_print(&edges);
 
     /* A maximum spanning tree can be computed by first negating the weights. */
     igraph_vector_scale(&eb, -1);
 
-    /* Compute and output the edges that belong to the maximum weight spanning tree. */
-    igraph_vector_int_init(&edges, 0);
+    /* Compute and output the edges that belong to the maximum weight spanning tree,
+     * letting igraph automatically select the most suitable algorithm. */
     igraph_minimum_spanning_tree(&graph, &edges, &eb);
     printf("\nMaximum spanning tree edges:\n");
     igraph_vector_int_print(&edges);
@@ -17204,10 +17223,9 @@ 
Warning

     printf("\nTotal maximum spanning tree weight: %g\n", total_tree_weight);
 
     /* Clean up */
-    igraph_vector_int_destroy(&edges);
-    igraph_destroy(&tree);
     igraph_destroy(&graph);
     igraph_vector_destroy(&eb);
+    igraph_vector_int_destroy(&edges);
 
     return 0;
 }
@@ -19017,7 +19035,7 @@ 
Warning

 
 
IGRAPH_LAPLACIAN_SYMMETRIC:

 

-  Symmetric normalized Laplacian, L = I - D^(-1/2) A D^(-1/2).
+  Symmetrically normalized Laplacian, L = I - D^(-1/2) A D^(-1/2).
 

 
 
@@ -19140,7 +19158,7 @@ 
Warning

 

 
 igraph_error_t igraph_is_loop(const igraph_t *graph, igraph_vector_bool_t *res,
-                   igraph_es_t es);
+                              igraph_es_t es);
 

 

 

@@ -19148,7 +19166,7 @@ 
Warning

 
 
 
-A loop edge is an edge from a vertex to itself.
+A loop edge, also called a self-loop, is an edge from a vertex to itself.
 
 

 
Arguments: 
@@ -19507,7 +19525,7 @@ 
Warning

 

 
 igraph_error_t igraph_is_multiple(const igraph_t *graph, igraph_vector_bool_t *res,
-                       igraph_es_t es);
+                                  igraph_es_t es);
 

 

 

@@ -19581,7 +19599,8 @@ 
Warning

 
 

 

-  igraph_count_multiple(), igraph_has_multiple() and igraph_simplify().
+  igraph_count_multiple(), igraph_count_multiple_1(),
+igraph_has_multiple() and igraph_simplify().
   

 
 

@@ -19803,7 +19822,8 @@ 
Warning

 

 

 
-igraph_error_t igraph_count_multiple(const igraph_t *graph, igraph_vector_int_t *res, igraph_es_t es);
+igraph_error_t igraph_count_multiple(const igraph_t *graph, igraph_vector_int_t *res,
+                                     igraph_es_t es);
 

 

 

@@ -19894,7 +19914,8 @@ 
Warning

 

 

 
-igraph_error_t igraph_count_multiple_1(const igraph_t *graph, igraph_integer_t *res, igraph_integer_t eid);
+igraph_error_t igraph_count_multiple_1(const igraph_t *graph, igraph_integer_t *res,
+                                       igraph_integer_t eid);
 

 

 

@@ -23089,7 +23110,8 @@ 
Warning

 

 

 
-igraph_error_t igraph_is_mutual(const igraph_t *graph, igraph_vector_bool_t *res, igraph_es_t es, igraph_bool_t loops);
+igraph_error_t igraph_is_mutual(const igraph_t *graph, igraph_vector_bool_t *res,
+                                igraph_es_t es, igraph_bool_t loops);
 

 

 

@@ -23179,7 +23201,8 @@ 
Warning

 

 

 
-igraph_error_t igraph_has_mutual(const igraph_t *graph, igraph_bool_t *res, igraph_bool_t loops);
+igraph_error_t igraph_has_mutual(const igraph_t *graph, igraph_bool_t *res,
+                                 igraph_bool_t loops);
 

 

 

diff --git a/docs/c/html/master/igraph-Tutorial.html b/docs/c/html/master/igraph-Tutorial.html
index dbc560410..056215bb1 100644
--- a/docs/c/html/master/igraph-Tutorial.html
+++ b/docs/c/html/master/igraph-Tutorial.html
@@ -461,8 +461,8 @@ 
C++ must be enabled in igraph projects

 

 

 The vertices in a graph are identified by a vertex ID, an integer between
-0 and N-1, where N is the number of vertices in the graph. The vertex count can be
-retrieved using igraph_vcount(),
+0 and n - 1, where n is the number of vertices in the graph.
+The vertex count can be retrieved using igraph_vcount(),
 as in the example.
 

 

diff --git a/docs/c/html/master/index.html b/docs/c/html/master/index.html
index 8df113850..f4ca4b620 100644
--- a/docs/c/html/master/index.html
+++ b/docs/c/html/master/index.html
@@ -191,9 +191,9 @@ 

 

 

 

-
0.10.13-1-g9949ea26a

+
0.10.13-37-g5564d5070

 

-
This manual is for igraph, version 0.10.13-1-g9949ea26a.

+
This manual is for igraph, version 0.10.13-37-g5564d5070.

 

       Copyright (C) 2005-2019 Gábor Csárdi and Tamás Nepusz.
       Copyright (C) 2020-2024 igraph development team.
diff --git a/docs/c/html/master/ix01.html b/docs/c/html/master/ix01.html
index 7eaa58a7c..d136f0fd4 100644
--- a/docs/c/html/master/ix01.html
+++ b/docs/c/html/master/ix01.html
@@ -157,460 +157,460 @@ 
A

 
 
add_vertices, igraph_add_vertices —  Adds vertices to a graph.
 

-
adhesion, igraph_adhesion —  Graph adhesion, this is (almost) the same as edge connectivity.
+
adhesion, igraph_adhesion —  Graph adhesion, this is (almost) the same as edge connectivity.
 

-
adjacency, igraph_adjacency —  Creates a graph from an adjacency matrix.
+
adjacency, igraph_adjacency —  Creates a graph from an adjacency matrix.
 

-
adjacency_spectral_embedding, igraph_adjacency_spectral_embedding — Adjacency spectral embedding
+
adjacency_spectral_embedding, igraph_adjacency_spectral_embedding — Adjacency spectral embedding
 

-
adjacent_triangles, igraph_adjacent_triangles —  Count the number of triangles a vertex is part of.
+
adjacent_triangles, igraph_adjacent_triangles —  Count the number of triangles a vertex is part of.
 

-
adjlist, igraph_adjlist —  Creates a graph from an adjacency list.
+
adjlist, igraph_adjlist —  Creates a graph from an adjacency list.
 

-
adjlist_clear, igraph_adjlist_clear — Removes all edges from an adjacency list.
+
adjlist_clear, igraph_adjlist_clear — Removes all edges from an adjacency list.
 

-
adjlist_destroy, igraph_adjlist_destroy —  Deallocates an adjacency list.
+
adjlist_destroy, igraph_adjlist_destroy —  Deallocates an adjacency list.
 

-
adjlist_get, igraph_adjlist_get —  Query a vector in an adjacency list.
+
adjlist_get, igraph_adjlist_get —  Query a vector in an adjacency list.
 

-
adjlist_init, igraph_adjlist_init —  Constructs an adjacency list of vertices from a given graph.
+
adjlist_init, igraph_adjlist_init —  Constructs an adjacency list of vertices from a given graph.
 

-
adjlist_init_complementer, igraph_adjlist_init_complementer —  Adjacency lists for the complementer graph.
+
adjlist_init_complementer, igraph_adjlist_init_complementer —  Adjacency lists for the complementer graph.
 

-
adjlist_init_empty, igraph_adjlist_init_empty —  Initializes an empty adjacency list.
+
adjlist_init_empty, igraph_adjlist_init_empty —  Initializes an empty adjacency list.
 

-
adjlist_init_from_inclist, igraph_adjlist_init_from_inclist —  Constructs an adjacency list of vertices from an incidence list.
+
adjlist_init_from_inclist, igraph_adjlist_init_from_inclist —  Constructs an adjacency list of vertices from an incidence list.
 

-
adjlist_simplify, igraph_adjlist_simplify —  Simplifies an adjacency list.
+
adjlist_simplify, igraph_adjlist_simplify —  Simplifies an adjacency list.
 

-
adjlist_size, igraph_adjlist_size —  Returns the number of vertices in an adjacency list.
+
adjlist_size, igraph_adjlist_size —  Returns the number of vertices in an adjacency list.
 

-
adjlist_sort, igraph_adjlist_sort —  Sorts each vector in an adjacency list.
+
adjlist_sort, igraph_adjlist_sort —  Sorts each vector in an adjacency list.
 

-
all_minimal_st_separators, igraph_all_minimal_st_separators —  List all vertex sets that are minimal (s,t) separators for some s and t.
+
all_minimal_st_separators, igraph_all_minimal_st_separators —  List all vertex sets that are minimal (s,t) separators for some s and t.
 

-
all_st_cuts, igraph_all_st_cuts — List all edge-cuts between two vertices in a directed graph
+
all_st_cuts, igraph_all_st_cuts — List all edge-cuts between two vertices in a directed graph
 

-
all_st_mincuts, igraph_all_st_mincuts —  All minimum s-t cuts of a directed graph.
+
all_st_mincuts, igraph_all_st_mincuts —  All minimum s-t cuts of a directed graph.
 

-
almost_equals, igraph_almost_equals —  Compare two double-precision floats with a tolerance.
+
almost_equals, igraph_almost_equals —  Compare two double-precision floats with a tolerance.
 

-
are_adjacent, igraph_are_adjacent —  Decides whether two vertices are adjacent.
+
are_adjacent, igraph_are_adjacent —  Decides whether two vertices are adjacent.
 

-
are_connected, igraph_are_connected —  Decides whether two vertices are adjacent (deprecated alias).
+
are_connected, igraph_are_connected —  Decides whether two vertices are adjacent (deprecated alias).
 

-
arpack_function_t, igraph_arpack_function_t —  Type of the ARPACK callback function.
+
arpack_function_t, igraph_arpack_function_t —  Type of the ARPACK callback function.
 

-
arpack_options_init, igraph_arpack_options_init —  Initialize ARPACK options.
+
arpack_options_init, igraph_arpack_options_init —  Initialize ARPACK options.
 

-
arpack_options_t, igraph_arpack_options_t —  Options for ARPACK.
+
arpack_options_t, igraph_arpack_options_t —  Options for ARPACK.
 

-
arpack_rnsolve, igraph_arpack_rnsolve —  ARPACK solver for non-symmetric matrices.
+
arpack_rnsolve, igraph_arpack_rnsolve —  ARPACK solver for non-symmetric matrices.
 

-
arpack_rssolve, igraph_arpack_rssolve —  ARPACK solver for symmetric matrices.
+
arpack_rssolve, igraph_arpack_rssolve —  ARPACK solver for symmetric matrices.
 

-
arpack_storage_destroy, igraph_arpack_storage_destroy —  Deallocate ARPACK storage.
+
arpack_storage_destroy, igraph_arpack_storage_destroy —  Deallocate ARPACK storage.
 

-
arpack_storage_init, igraph_arpack_storage_init —  Initialize ARPACK storage.
+
arpack_storage_init, igraph_arpack_storage_init —  Initialize ARPACK storage.
 

-
arpack_storage_t, igraph_arpack_storage_t —  Storage for ARPACK.
+
arpack_storage_t, igraph_arpack_storage_t —  Storage for ARPACK.
 

-
arpack_unpack_complex, igraph_arpack_unpack_complex —  Makes the result of the non-symmetric ARPACK solver more readable.
+
arpack_unpack_complex, igraph_arpack_unpack_complex —  Makes the result of the non-symmetric ARPACK solver more readable.
 

-
articulation_points, igraph_articulation_points —  Finds the articulation points in a graph.
+
articulation_points, igraph_articulation_points —  Finds the articulation points in a graph.
 

 
ASSERT, IGRAPH_ASSERT —  igraph-specific replacement for assert().
 

-
assortativity, igraph_assortativity —  Assortativity based on numeric properties of vertices.
+
assortativity, igraph_assortativity —  Assortativity based on numeric properties of vertices.
 

-
assortativity_degree, igraph_assortativity_degree —  Assortativity of a graph based on vertex degree.
+
assortativity_degree, igraph_assortativity_degree —  Assortativity of a graph based on vertex degree.
 

-
assortativity_nominal, igraph_assortativity_nominal —  Assortativity of a graph based on vertex categories.
+
assortativity_nominal, igraph_assortativity_nominal —  Assortativity of a graph based on vertex categories.
 

-
astar_heuristic_func_t, igraph_astar_heuristic_func_t —  Distance estimator for A* algorithm.
+
astar_heuristic_func_t, igraph_astar_heuristic_func_t —  Distance estimator for A* algorithm.
 

-
asymmetric_preference_game, igraph_asymmetric_preference_game —  Generates a graph with asymmetric vertex types and connection preferences.
+
asymmetric_preference_game, igraph_asymmetric_preference_game —  Generates a graph with asymmetric vertex types and connection preferences.
 

-
atlas, igraph_atlas —  Create a small graph from the “Graph Atlas”.
+
atlas, igraph_atlas —  Create a small graph from the “Graph Atlas”.
 

-
attribute_combination, igraph_attribute_combination —  Initialize attribute combination list and add records.
+
attribute_combination, igraph_attribute_combination —  Initialize attribute combination list and add records.
 

-
attribute_combination_add, igraph_attribute_combination_add —  Add combination record to attribute combination list.
+
attribute_combination_add, igraph_attribute_combination_add —  Add combination record to attribute combination list.
 

-
attribute_combination_destroy, igraph_attribute_combination_destroy —  Destroy attribute combination list.
+
attribute_combination_destroy, igraph_attribute_combination_destroy —  Destroy attribute combination list.
 

-
attribute_combination_init, igraph_attribute_combination_init —  Initialize attribute combination list.
+
attribute_combination_init, igraph_attribute_combination_init —  Initialize attribute combination list.
 

-
attribute_combination_remove, igraph_attribute_combination_remove —  Remove a record from an attribute combination list.
+
attribute_combination_remove, igraph_attribute_combination_remove —  Remove a record from an attribute combination list.
 

-
attribute_combination_type_t, igraph_attribute_combination_type_t — The possible types of attribute combinations.
+
attribute_combination_type_t, igraph_attribute_combination_type_t — The possible types of attribute combinations.
 

-
attribute_table_t, igraph_attribute_table_t —  Table of functions to perform operations on attributes.
+
attribute_table_t, igraph_attribute_table_t —  Table of functions to perform operations on attributes.
 

-
attribute_type_t, igraph_attribute_type_t — The possible types of the attributes.
+
attribute_type_t, igraph_attribute_type_t — The possible types of the attributes.
 

-
authority_score, igraph_authority_score —  Kleinberg's authority scores.
+
authority_score, igraph_authority_score —  Kleinberg's authority scores.
 

-
automorphisms, igraph_automorphisms —  Number of automorphisms using Bliss (deprecated alias).
+
automorphisms, igraph_automorphisms —  Number of automorphisms using Bliss (deprecated alias).
 

-
automorphism_group, igraph_automorphism_group —  Automorphism group generators using Bliss.
+
automorphism_group, igraph_automorphism_group —  Automorphism group generators using Bliss.
 

-
average_local_efficiency, igraph_average_local_efficiency —  Calculates the average local efficiency in a network.
+
average_local_efficiency, igraph_average_local_efficiency —  Calculates the average local efficiency in a network.
 

-
average_path_length, igraph_average_path_length —  Calculates the average unweighted shortest path length between all vertex pairs.
+
average_path_length, igraph_average_path_length —  Calculates the average unweighted shortest path length between all vertex pairs.
 

-
average_path_length_dijkstra, igraph_average_path_length_dijkstra —  Calculates the average weighted shortest path length between all vertex pairs.
+
average_path_length_dijkstra, igraph_average_path_length_dijkstra —  Calculates the average weighted shortest path length between all vertex pairs.
 

-
avg_nearest_neighbor_degree, igraph_avg_nearest_neighbor_degree —  Average neighbor degree.
+
avg_nearest_neighbor_degree, igraph_avg_nearest_neighbor_degree —  Average neighbor degree.
 

 
 

 

 
B

 

-
barabasi_aging_game, igraph_barabasi_aging_game —  Preferential attachment with aging of vertices.
+
barabasi_aging_game, igraph_barabasi_aging_game —  Preferential attachment with aging of vertices.
 

-
barabasi_game, igraph_barabasi_game —  Generates a graph based on the Barabási-Albert model.
+
barabasi_game, igraph_barabasi_game —  Generates a graph based on the Barabási-Albert model.
 

-
betweenness, igraph_betweenness —  Betweenness centrality of some vertices.
+
betweenness, igraph_betweenness —  Betweenness centrality of some vertices.
 

-
betweenness_cutoff, igraph_betweenness_cutoff —  Range-limited betweenness centrality.
+
betweenness_cutoff, igraph_betweenness_cutoff —  Range-limited betweenness centrality.
 

-
betweenness_subset, igraph_betweenness_subset —  Betweenness centrality for a subset of source and target vertices.
+
betweenness_subset, igraph_betweenness_subset —  Betweenness centrality for a subset of source and target vertices.
 

-
bfs, igraph_bfs —  Breadth-first search.
+
bfs, igraph_bfs —  Breadth-first search.
 

-
bfshandler_t, igraph_bfshandler_t —  Callback type for BFS function.
+
bfshandler_t, igraph_bfshandler_t —  Callback type for BFS function.
 

-
bfs_simple, igraph_bfs_simple — Breadth-first search, single-source version
+
bfs_simple, igraph_bfs_simple — Breadth-first search, single-source version
 

-
biadjacency, igraph_biadjacency —  Creates a bipartite graph from a bipartite adjacency matrix.
+
biadjacency, igraph_biadjacency —  Creates a bipartite graph from a bipartite adjacency matrix.
 

-
bibcoupling, igraph_bibcoupling —  Bibliographic coupling.
+
bibcoupling, igraph_bibcoupling —  Bibliographic coupling.
 

-
biconnected_components, igraph_biconnected_components —  Calculates biconnected components.
+
biconnected_components, igraph_biconnected_components —  Calculates biconnected components.
 

-
bipartite_game, igraph_bipartite_game —  Generate a bipartite random graph (similar to Erdős-Rényi).
+
bipartite_game, igraph_bipartite_game —  Generate a bipartite random graph (similar to Erdős-Rényi).
 

-
bipartite_game_gnm, igraph_bipartite_game_gnm —  Generate a random bipartite graph with a fixed number of edges.
+
bipartite_game_gnm, igraph_bipartite_game_gnm —  Generate a random bipartite graph with a fixed number of edges.
 

-
bipartite_game_gnp, igraph_bipartite_game_gnp —  Generates a random bipartite graph with a fixed connection probability.
+
bipartite_game_gnp, igraph_bipartite_game_gnp —  Generates a random bipartite graph with a fixed connection probability.
 

-
bipartite_projection, igraph_bipartite_projection —  Create one or both projections of a bipartite (two-mode) network.
+
bipartite_projection, igraph_bipartite_projection —  Create one or both projections of a bipartite (two-mode) network.
 

-
bipartite_projection_size, igraph_bipartite_projection_size —  Calculate the number of vertices and edges in the bipartite projections.
+
bipartite_projection_size, igraph_bipartite_projection_size —  Calculate the number of vertices and edges in the bipartite projections.
 

-
bitset_and, igraph_bitset_and —  Bitwise AND of two bitsets.
+
bitset_and, igraph_bitset_and —  Bitwise AND of two bitsets.
 

-
bitset_capacity, igraph_bitset_capacity —  Returns the allocated capacity of the bitset.
+
bitset_capacity, igraph_bitset_capacity —  Returns the allocated capacity of the bitset.
 

-
bitset_countl_one, igraph_bitset_countl_one —  The number of leading ones in the bitset.
+
bitset_countl_one, igraph_bitset_countl_one —  The number of leading ones in the bitset.
 

-
bitset_countl_zero, igraph_bitset_countl_zero —  The number of leading zeros in the bitset.
+
bitset_countl_zero, igraph_bitset_countl_zero —  The number of leading zeros in the bitset.
 

-
bitset_countr_one, igraph_bitset_countr_one —  The number of trailing ones in the bitset.
+
bitset_countr_one, igraph_bitset_countr_one —  The number of trailing ones in the bitset.
 

-
bitset_countr_zero, igraph_bitset_countr_zero —  The number of trailing zeros in the bitset.
+
bitset_countr_zero, igraph_bitset_countr_zero —  The number of trailing zeros in the bitset.
 

-
bitset_destroy, igraph_bitset_destroy —  Destroys a bitset object.
+
bitset_destroy, igraph_bitset_destroy —  Destroys a bitset object.
 

-
bitset_fill, igraph_bitset_fill —  Fills a bitset with a constant value.
+
bitset_fill, igraph_bitset_fill —  Fills a bitset with a constant value.
 

-
bitset_init, igraph_bitset_init —  Initializes a bitset object (constructor).
+
bitset_init, igraph_bitset_init —  Initializes a bitset object (constructor).
 

-
bitset_init_copy, igraph_bitset_init_copy —  Initializes a bitset from another bitset object (constructor).
+
bitset_init_copy, igraph_bitset_init_copy —  Initializes a bitset from another bitset object (constructor).
 

-
bitset_is_all_one, igraph_bitset_is_all_one —  Are all bits ones?
+
bitset_is_all_one, igraph_bitset_is_all_one —  Are all bits ones?
 

-
bitset_is_all_zero, igraph_bitset_is_all_zero —  Are all bits zeros?
+
bitset_is_all_zero, igraph_bitset_is_all_zero —  Are all bits zeros?
 

-
bitset_is_any_one, igraph_bitset_is_any_one —  Are any bits ones?
+
bitset_is_any_one, igraph_bitset_is_any_one —  Are any bits ones?
 

-
bitset_is_any_zero, igraph_bitset_is_any_zero —  Are any bits zeros?
+
bitset_is_any_zero, igraph_bitset_is_any_zero —  Are any bits zeros?
 

-
bitset_not, igraph_bitset_not —  Bitwise negation of a bitset.
+
bitset_not, igraph_bitset_not —  Bitwise negation of a bitset.
 

-
bitset_null, igraph_bitset_null —  Clears all bits in a bitset.
+
bitset_null, igraph_bitset_null —  Clears all bits in a bitset.
 

-
bitset_or, igraph_bitset_or —  Bitwise OR of two bitsets.
+
bitset_or, igraph_bitset_or —  Bitwise OR of two bitsets.
 

-
bitset_popcount, igraph_bitset_popcount —  The population count of the bitset.
+
bitset_popcount, igraph_bitset_popcount —  The population count of the bitset.
 

-
bitset_reserve, igraph_bitset_reserve —  Reserves memory for a bitset.
+
bitset_reserve, igraph_bitset_reserve —  Reserves memory for a bitset.
 

-
bitset_resize, igraph_bitset_resize —  Resizes the bitset.
+
bitset_resize, igraph_bitset_resize —  Resizes the bitset.
 

-
bitset_size, igraph_bitset_size —  Returns the length of the bitset.
+
bitset_size, igraph_bitset_size —  Returns the length of the bitset.
 

-
bitset_xor, igraph_bitset_xor —  Bitwise XOR of two bitsets.
+
bitset_xor, igraph_bitset_xor —  Bitwise XOR of two bitsets.
 

-
BIT_CLEAR, IGRAPH_BIT_CLEAR —  Sets a specific bit in a bitset to 0 without altering other bits.
+
BIT_CLEAR, IGRAPH_BIT_CLEAR —  Sets a specific bit in a bitset to 0 without altering other bits.
 

-
BIT_MASK, IGRAPH_BIT_MASK —  Computes mask used to access a specific bit of an integer.
+
BIT_MASK, IGRAPH_BIT_MASK —  Computes mask used to access a specific bit of an integer.
 

-
BIT_NSLOTS, IGRAPH_BIT_NSLOTS —  Computes the number of slots required to store a specified number of bits.
+
BIT_NSLOTS, IGRAPH_BIT_NSLOTS —  Computes the number of slots required to store a specified number of bits.
 

-
BIT_SET, IGRAPH_BIT_SET —  Sets a specific bit in a bitset to 1 without altering other bits.
+
BIT_SET, IGRAPH_BIT_SET —  Sets a specific bit in a bitset to 1 without altering other bits.
 

-
BIT_SLOT, IGRAPH_BIT_SLOT —  Computes index used to access a specific slot of a bitset.
+
BIT_SLOT, IGRAPH_BIT_SLOT —  Computes index used to access a specific slot of a bitset.
 

-
BIT_TEST, IGRAPH_BIT_TEST —  Tests whether a bit is set in a bitset.
+
BIT_TEST, IGRAPH_BIT_TEST —  Tests whether a bit is set in a bitset.
 

-
blas_ddot, igraph_blas_ddot —  Dot product of two vectors.
+
blas_ddot, igraph_blas_ddot —  Dot product of two vectors.
 

-
blas_dgemm, igraph_blas_dgemm —  Matrix-matrix multiplication using BLAS.
+
blas_dgemm, igraph_blas_dgemm —  Matrix-matrix multiplication using BLAS.
 

-
blas_dgemv, igraph_blas_dgemv —  Matrix-vector multiplication using BLAS, vector version.
+
blas_dgemv, igraph_blas_dgemv —  Matrix-vector multiplication using BLAS, vector version.
 

-
blas_dgemv_array, igraph_blas_dgemv_array —  Matrix-vector multiplication using BLAS, array version.
+
blas_dgemv_array, igraph_blas_dgemv_array —  Matrix-vector multiplication using BLAS, array version.
 

-
blas_dnrm2, igraph_blas_dnrm2 —  Euclidean norm of a vector.
+
blas_dnrm2, igraph_blas_dnrm2 —  Euclidean norm of a vector.
 

-
bliss_info_t, igraph_bliss_info_t —  Information about a Bliss run.
+
bliss_info_t, igraph_bliss_info_t —  Information about a Bliss run.
 

-
bliss_sh_t, igraph_bliss_sh_t —  Splitting heuristics for Bliss.
+
bliss_sh_t, igraph_bliss_sh_t —  Splitting heuristics for Bliss.
 

-
bridges, igraph_bridges —  Finds all bridges in a graph.
+
bridges, igraph_bridges —  Finds all bridges in a graph.
 

 

 

 

 
C

 

-
callaway_traits_game, igraph_callaway_traits_game —  Simulates a growing network with vertex types.
+
callaway_traits_game, igraph_callaway_traits_game —  Simulates a growing network with vertex types.
 

 
calloc, igraph_calloc —  Allocate memory that can be safely deallocated by igraph functions.
 

-
canonical_permutation, igraph_canonical_permutation —  Canonical permutation using Bliss.
+
canonical_permutation, igraph_canonical_permutation —  Canonical permutation using Bliss.
 

-
cattribute_EAB, igraph_cattribute_EAB —  Query a boolean edge attribute.
+
cattribute_EAB, igraph_cattribute_EAB —  Query a boolean edge attribute.
 

-
cattribute_EABV, igraph_cattribute_EABV —  Query a boolean edge attribute for many edges.
+
cattribute_EABV, igraph_cattribute_EABV —  Query a boolean edge attribute for many edges.
 

-
cattribute_EAB_set, igraph_cattribute_EAB_set —  Set a boolean edge attribute.
+
cattribute_EAB_set, igraph_cattribute_EAB_set —  Set a boolean edge attribute.
 

-
cattribute_EAB_setv, igraph_cattribute_EAB_setv —  Set a boolean edge attribute for all edges.
+
cattribute_EAB_setv, igraph_cattribute_EAB_setv —  Set a boolean edge attribute for all edges.
 

-
cattribute_EAN, igraph_cattribute_EAN —  Query a numeric edge attribute.
+
cattribute_EAN, igraph_cattribute_EAN —  Query a numeric edge attribute.
 

-
cattribute_EANV, igraph_cattribute_EANV —  Query a numeric edge attribute for many edges.
+
cattribute_EANV, igraph_cattribute_EANV —  Query a numeric edge attribute for many edges.
 

-
cattribute_EAN_set, igraph_cattribute_EAN_set —  Set a numeric edge attribute.
+
cattribute_EAN_set, igraph_cattribute_EAN_set —  Set a numeric edge attribute.
 

-
cattribute_EAN_setv, igraph_cattribute_EAN_setv —  Set a numeric edge attribute for all edges.
+
cattribute_EAN_setv, igraph_cattribute_EAN_setv —  Set a numeric edge attribute for all edges.
 

-
cattribute_EAS, igraph_cattribute_EAS —  Query a string edge attribute.
+
cattribute_EAS, igraph_cattribute_EAS —  Query a string edge attribute.
 

-
cattribute_EASV, igraph_cattribute_EASV —  Query a string edge attribute for many edges.
+
cattribute_EASV, igraph_cattribute_EASV —  Query a string edge attribute for many edges.
 

-
cattribute_EAS_set, igraph_cattribute_EAS_set —  Set a string edge attribute.
+
cattribute_EAS_set, igraph_cattribute_EAS_set —  Set a string edge attribute.
 

-
cattribute_EAS_setv, igraph_cattribute_EAS_setv —  Set a string edge attribute for all edges.
+
cattribute_EAS_setv, igraph_cattribute_EAS_setv —  Set a string edge attribute for all edges.
 

-
cattribute_GAB, igraph_cattribute_GAB —  Query a boolean graph attribute.
+
cattribute_GAB, igraph_cattribute_GAB —  Query a boolean graph attribute.
 

-
cattribute_GAB_set, igraph_cattribute_GAB_set —  Set a boolean graph attribute.
+
cattribute_GAB_set, igraph_cattribute_GAB_set —  Set a boolean graph attribute.
 

-
cattribute_GAN, igraph_cattribute_GAN —  Query a numeric graph attribute.
+
cattribute_GAN, igraph_cattribute_GAN —  Query a numeric graph attribute.
 

-
cattribute_GAN_set, igraph_cattribute_GAN_set —  Set a numeric graph attribute.
+
cattribute_GAN_set, igraph_cattribute_GAN_set —  Set a numeric graph attribute.
 

-
cattribute_GAS, igraph_cattribute_GAS —  Query a string graph attribute.
+
cattribute_GAS, igraph_cattribute_GAS —  Query a string graph attribute.
 

-
cattribute_GAS_set, igraph_cattribute_GAS_set —  Set a string graph attribute.
+
cattribute_GAS_set, igraph_cattribute_GAS_set —  Set a string graph attribute.
 

-
cattribute_has_attr, igraph_cattribute_has_attr —  Checks whether a (graph, vertex or edge) attribute exists.
+
cattribute_has_attr, igraph_cattribute_has_attr —  Checks whether a (graph, vertex or edge) attribute exists.
 

-
cattribute_list, igraph_cattribute_list —  List all attributes.
+
cattribute_list, igraph_cattribute_list —  List all attributes.
 

-
cattribute_remove_all, igraph_cattribute_remove_all —  Remove all graph/vertex/edge attributes.
+
cattribute_remove_all, igraph_cattribute_remove_all —  Remove all graph/vertex/edge attributes.
 

-
cattribute_remove_e, igraph_cattribute_remove_e —  Remove an edge attribute.
+
cattribute_remove_e, igraph_cattribute_remove_e —  Remove an edge attribute.
 

-
cattribute_remove_g, igraph_cattribute_remove_g —  Remove a graph attribute.
+
cattribute_remove_g, igraph_cattribute_remove_g —  Remove a graph attribute.
 

-
cattribute_remove_v, igraph_cattribute_remove_v —  Remove a vertex attribute.
+
cattribute_remove_v, igraph_cattribute_remove_v —  Remove a vertex attribute.
 

-
cattribute_VAB, igraph_cattribute_VAB —  Query a boolean vertex attribute.
+
cattribute_VAB, igraph_cattribute_VAB —  Query a boolean vertex attribute.
 

-
cattribute_VABV, igraph_cattribute_VABV —  Query a boolean vertex attribute for many vertices.
+
cattribute_VABV, igraph_cattribute_VABV —  Query a boolean vertex attribute for many vertices.
 

-
cattribute_VAB_set, igraph_cattribute_VAB_set —  Set a boolean vertex attribute.
+
cattribute_VAB_set, igraph_cattribute_VAB_set —  Set a boolean vertex attribute.
 

-
cattribute_VAB_setv, igraph_cattribute_VAB_setv —  Set a boolean vertex attribute for all vertices.
+
cattribute_VAB_setv, igraph_cattribute_VAB_setv —  Set a boolean vertex attribute for all vertices.
 

-
cattribute_VAN, igraph_cattribute_VAN —  Query a numeric vertex attribute.
+
cattribute_VAN, igraph_cattribute_VAN —  Query a numeric vertex attribute.
 

-
cattribute_VANV, igraph_cattribute_VANV —  Query a numeric vertex attribute for many vertices.
+
cattribute_VANV, igraph_cattribute_VANV —  Query a numeric vertex attribute for many vertices.
 

-
cattribute_VAN_set, igraph_cattribute_VAN_set —  Set a numeric vertex attribute.
+
cattribute_VAN_set, igraph_cattribute_VAN_set —  Set a numeric vertex attribute.
 

-
cattribute_VAN_setv, igraph_cattribute_VAN_setv —  Set a numeric vertex attribute for all vertices.
+
cattribute_VAN_setv, igraph_cattribute_VAN_setv —  Set a numeric vertex attribute for all vertices.
 

-
cattribute_VAS, igraph_cattribute_VAS —  Query a string vertex attribute.
+
cattribute_VAS, igraph_cattribute_VAS —  Query a string vertex attribute.
 

-
cattribute_VASV, igraph_cattribute_VASV —  Query a string vertex attribute for many vertices.
+
cattribute_VASV, igraph_cattribute_VASV —  Query a string vertex attribute for many vertices.
 

-
cattribute_VAS_set, igraph_cattribute_VAS_set —  Set a string vertex attribute.
+
cattribute_VAS_set, igraph_cattribute_VAS_set —  Set a string vertex attribute.
 

-
cattribute_VAS_setv, igraph_cattribute_VAS_setv —  Set a string vertex attribute for all vertices.
+
cattribute_VAS_setv, igraph_cattribute_VAS_setv —  Set a string vertex attribute for all vertices.
 

-
centralization, igraph_centralization —  Calculate the centralization score from the node level scores.
+
centralization, igraph_centralization —  Calculate the centralization score from the node level scores.
 

-
centralization_betweenness, igraph_centralization_betweenness —  Calculate vertex betweenness and graph centralization.
+
centralization_betweenness, igraph_centralization_betweenness —  Calculate vertex betweenness and graph centralization.
 

-
centralization_betweenness_tmax, igraph_centralization_betweenness_tmax —  Theoretical maximum for graph centralization based on betweenness.
+
centralization_betweenness_tmax, igraph_centralization_betweenness_tmax —  Theoretical maximum for graph centralization based on betweenness.
 

-
centralization_closeness, igraph_centralization_closeness —  Calculate vertex closeness and graph centralization.
+
centralization_closeness, igraph_centralization_closeness —  Calculate vertex closeness and graph centralization.
 

-
centralization_closeness_tmax, igraph_centralization_closeness_tmax —  Theoretical maximum for graph centralization based on closeness.
+
centralization_closeness_tmax, igraph_centralization_closeness_tmax —  Theoretical maximum for graph centralization based on closeness.
 

-
centralization_degree, igraph_centralization_degree —  Calculate vertex degree and graph centralization.
+
centralization_degree, igraph_centralization_degree —  Calculate vertex degree and graph centralization.
 

-
centralization_degree_tmax, igraph_centralization_degree_tmax —  Theoretical maximum for graph centralization based on degree.
+
centralization_degree_tmax, igraph_centralization_degree_tmax —  Theoretical maximum for graph centralization based on degree.
 

-
centralization_eigenvector_centrality, igraph_centralization_eigenvector_centrality —  Calculate eigenvector centrality scores and graph centralization.
+
centralization_eigenvector_centrality, igraph_centralization_eigenvector_centrality —  Calculate eigenvector centrality scores and graph centralization.
 

-
centralization_eigenvector_centrality_tmax, igraph_centralization_eigenvector_centrality_tmax —  Theoretical maximum centralization for eigenvector centrality.
+
centralization_eigenvector_centrality_tmax, igraph_centralization_eigenvector_centrality_tmax —  Theoretical maximum centralization for eigenvector centrality.
 

 
CHECK, IGRAPH_CHECK —  Checks the return value of a function call.
 

 
CHECK_CALLBACK, IGRAPH_CHECK_CALLBACK —  Checks the return value of a callback.
 

-
chung_lu_game, igraph_chung_lu_game —  Samples graphs from the Chung-Lu model.
+
chung_lu_game, igraph_chung_lu_game —  Samples graphs from the Chung-Lu model.
 

-
circulant, igraph_circulant —  Creates a circulant graph.
+
circulant, igraph_circulant —  Creates a circulant graph.
 

-
cited_type_game, igraph_cited_type_game —  Simulates a citation based on vertex types.
+
cited_type_game, igraph_cited_type_game —  Simulates a citation based on vertex types.
 

-
citing_cited_type_game, igraph_citing_cited_type_game —  Simulates a citation network based on vertex types.
+
citing_cited_type_game, igraph_citing_cited_type_game —  Simulates a citation network based on vertex types.
 

-
cliques, igraph_cliques —  Finds all or some cliques in a graph.
+
cliques, igraph_cliques —  Finds all or some cliques in a graph.
 

-
cliques_callback, igraph_cliques_callback —  Calls a function for each clique in the graph.
+
cliques_callback, igraph_cliques_callback —  Calls a function for each clique in the graph.
 

-
clique_handler_t, igraph_clique_handler_t —  Type of clique handler functions.
+
clique_handler_t, igraph_clique_handler_t —  Type of clique handler functions.
 

-
clique_number, igraph_clique_number —  Finds the clique number of the graph.
+
clique_number, igraph_clique_number —  Finds the clique number of the graph.
 

-
clique_size_hist, igraph_clique_size_hist —  Counts cliques of each size in the graph.
+
clique_size_hist, igraph_clique_size_hist —  Counts cliques of each size in the graph.
 

-
closeness, igraph_closeness —  Closeness centrality calculations for some vertices.
+
closeness, igraph_closeness —  Closeness centrality calculations for some vertices.
 

-
closeness_cutoff, igraph_closeness_cutoff —  Range limited closeness centrality.
+
closeness_cutoff, igraph_closeness_cutoff —  Range limited closeness centrality.
 

-
clusters, igraph_clusters —  Calculates the (weakly or strongly) connected components in a graph (deprecated alias).
+
clusters, igraph_clusters —  Calculates the (weakly or strongly) connected components in a graph (deprecated alias).
 

-
cmp_epsilon, igraph_cmp_epsilon —  Compare two double-precision floats with a tolerance.
+
cmp_epsilon, igraph_cmp_epsilon —  Compare two double-precision floats with a tolerance.
 

-
cocitation, igraph_cocitation —  Cocitation coupling.
+
cocitation, igraph_cocitation —  Cocitation coupling.
 

-
cohesion, igraph_cohesion —  Graph cohesion, this is the same as vertex connectivity.
+
cohesion, igraph_cohesion —  Graph cohesion, this is the same as vertex connectivity.
 

-
cohesive_blocks, igraph_cohesive_blocks —  Identifies the hierarchical cohesive block structure of a graph.
+
cohesive_blocks, igraph_cohesive_blocks —  Identifies the hierarchical cohesive block structure of a graph.
 

-
coloring_greedy_t, igraph_coloring_greedy_t —  Ordering heuristics for greedy graph coloring.
+
coloring_greedy_t, igraph_coloring_greedy_t —  Ordering heuristics for greedy graph coloring.
 

-
community_eb_get_merges, igraph_community_eb_get_merges —  Calculating the merges, i.e. the dendrogram for an edge betweenness community structure.
+
community_eb_get_merges, igraph_community_eb_get_merges —  Calculating the merges, i.e. the dendrogram for an edge betweenness community structure.
 

-
community_edge_betweenness, igraph_community_edge_betweenness —  Community finding based on edge betweenness.
+
community_edge_betweenness, igraph_community_edge_betweenness —  Community finding based on edge betweenness.
 

-
community_fastgreedy, igraph_community_fastgreedy —  Finding community structure by greedy optimization of modularity.
+
community_fastgreedy, igraph_community_fastgreedy —  Finding community structure by greedy optimization of modularity.
 

-
community_fluid_communities, igraph_community_fluid_communities —  Community detection based on fluids interacting on the graph.
+
community_fluid_communities, igraph_community_fluid_communities —  Community detection based on fluids interacting on the graph.
 

-
community_infomap, igraph_community_infomap —  Find community structure that minimizes the expected description length of a random walker trajectory.
+
community_infomap, igraph_community_infomap —  Find community structure that minimizes the expected description length of a random walker trajectory.
 

-
community_label_propagation, igraph_community_label_propagation —  Community detection based on label propagation.
+
community_label_propagation, igraph_community_label_propagation —  Community detection based on label propagation.
 

-
community_leading_eigenvector, igraph_community_leading_eigenvector —  Leading eigenvector community finding (proper version).
+
community_leading_eigenvector, igraph_community_leading_eigenvector —  Leading eigenvector community finding (proper version).
 

-
community_leading_eigenvector_callback_t, igraph_community_leading_eigenvector_callback_t — Callback for the leading eigenvector community finding method.
+
community_leading_eigenvector_callback_t, igraph_community_leading_eigenvector_callback_t — Callback for the leading eigenvector community finding method.
 

-
community_leiden, igraph_community_leiden —  Finding community structure using the Leiden algorithm.
+
community_leiden, igraph_community_leiden —  Finding community structure using the Leiden algorithm.
 

-
community_multilevel, igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity.
+
community_multilevel, igraph_community_multilevel —  Finding community structure by multi-level optimization of modularity (Louvain).
 

-
community_optimal_modularity, igraph_community_optimal_modularity —  Calculate the community structure with the highest modularity value.
+
community_optimal_modularity, igraph_community_optimal_modularity —  Calculate the community structure with the highest modularity value.
 

-
community_spinglass, igraph_community_spinglass —  Community detection based on statistical mechanics.
+
community_spinglass, igraph_community_spinglass —  Community detection based on statistical mechanics.
 

-
community_spinglass_single, igraph_community_spinglass_single —  Community of a single node based on statistical mechanics.
+
community_spinglass_single, igraph_community_spinglass_single —  Community of a single node based on statistical mechanics.
 

-
community_to_membership, igraph_community_to_membership —  Creates a membership vector from a community structure dendrogram.
+
community_to_membership, igraph_community_to_membership —  Creates a membership vector from a community structure dendrogram.
 

-
community_voronoi, igraph_community_voronoi —  Finds communities using Voronoi partitioning.
+
community_voronoi, igraph_community_voronoi —  Finds communities using Voronoi partitioning.
 

-
community_walktrap, igraph_community_walktrap —  Community finding using a random walk based similarity measure.
+
community_walktrap, igraph_community_walktrap —  Community finding using a random walk based similarity measure.
 

-
compare_communities, igraph_compare_communities —  Compares community structures using various metrics.
+
compare_communities, igraph_compare_communities —  Compares community structures using various metrics.
 

-
complementer, igraph_complementer —  Creates the complementer of a graph.
+
complementer, igraph_complementer —  Creates the complementer of a graph.
 

-
complex_almost_equals, igraph_complex_almost_equals —  Compare two complex numbers with a tolerance.
+
complex_almost_equals, igraph_complex_almost_equals —  Compare two complex numbers with a tolerance.
 

-
compose, igraph_compose —  Calculates the composition of two graphs.
+
compose, igraph_compose —  Calculates the composition of two graphs.
 

-
connected_components, igraph_connected_components —  Calculates the (weakly or strongly) connected components in a graph.
+
connected_components, igraph_connected_components —  Calculates the (weakly or strongly) connected components in a graph.
 

-
connect_neighborhood, igraph_connect_neighborhood —  Connects each vertex to its neighborhood.
+
connect_neighborhood, igraph_connect_neighborhood —  Connects each vertex to its neighborhood.
 

-
constraint, igraph_constraint —  Burt's constraint scores.
+
constraint, igraph_constraint —  Burt's constraint scores.
 

-
contract_vertices, igraph_contract_vertices —  Replace multiple vertices with a single one.
+
contract_vertices, igraph_contract_vertices —  Replace multiple vertices with a single one.
 

-
convergence_degree, igraph_convergence_degree —  Calculates the convergence degree of each edge in a graph.
+
convergence_degree, igraph_convergence_degree —  Calculates the convergence degree of each edge in a graph.
 

-
convex_hull, igraph_convex_hull —  Determines the convex hull of a given set of points in the 2D plane.
+
convex_hull, igraph_convex_hull —  Determines the convex hull of a given set of points in the 2D plane.
 

 
copy, igraph_copy —  Creates an exact (deep) copy of a graph.
 

-
coreness, igraph_coreness —  The coreness of the vertices in a graph.
+
coreness, igraph_coreness —  The coreness of the vertices in a graph.
 

-
correlated_game, igraph_correlated_game —  Generates a random graph correlated to an existing graph.
+
correlated_game, igraph_correlated_game —  Generates a random graph correlated to an existing graph.
 

-
correlated_pair_game, igraph_correlated_pair_game —  Generates pairs of correlated random graphs.
+
correlated_pair_game, igraph_correlated_pair_game —  Generates pairs of correlated random graphs.
 

-
count_automorphisms, igraph_count_automorphisms —  Number of automorphisms using Bliss.
+
count_automorphisms, igraph_count_automorphisms —  Number of automorphisms using Bliss.
 

-
count_isomorphisms_vf2, igraph_count_isomorphisms_vf2 —  Number of isomorphisms via VF2.
+
count_isomorphisms_vf2, igraph_count_isomorphisms_vf2 —  Number of isomorphisms via VF2.
 

-
count_loops, igraph_count_loops —  Counts the self-loops in the graph.
+
count_loops, igraph_count_loops —  Counts the self-loops in the graph.
 

-
count_multiple, igraph_count_multiple —  The multiplicity of some edges in a graph.
+
count_multiple, igraph_count_multiple —  The multiplicity of some edges in a graph.
 

-
count_multiple_1, igraph_count_multiple_1 —  The multiplicity of a single edge in a graph.
+
count_multiple_1, igraph_count_multiple_1 —  The multiplicity of a single edge in a graph.
 

-
count_reachable, igraph_count_reachable —  The number of vertices reachable from each vertex in the graph.
+
count_reachable, igraph_count_reachable —  The number of vertices reachable from each vertex in the graph.
 

-
count_subisomorphisms_vf2, igraph_count_subisomorphisms_vf2 — Number of subgraph isomorphisms using VF2
+
count_subisomorphisms_vf2, igraph_count_subisomorphisms_vf2 — Number of subgraph isomorphisms using VF2
 

-
create, igraph_create —  Creates a graph with the specified edges.
+
create, igraph_create —  Creates a graph with the specified edges.
 

-
create_bipartite, igraph_create_bipartite —  Create a bipartite graph.
+
create_bipartite, igraph_create_bipartite —  Create a bipartite graph.
 

 

 

 

 
D

 

-
decompose, igraph_decompose —  Decomposes a graph into connected components.
+
decompose, igraph_decompose —  Decomposes a graph into connected components.
 

-
decompose_destroy, igraph_decompose_destroy —  Frees the contents of a pointer vector holding graphs.
+
decompose_destroy, igraph_decompose_destroy —  Frees the contents of a pointer vector holding graphs.
 

 
degree, igraph_degree —  The degree of some vertices in a graph.
 

 
degree_1, igraph_degree_1 —  The degree of of a single vertex in the graph.
 

-
degree_correlation_vector, igraph_degree_correlation_vector —  Degree correlation function.
+
degree_correlation_vector, igraph_degree_correlation_vector —  Degree correlation function.
 

-
degree_sequence_game, igraph_degree_sequence_game —  Generates a random graph with a given degree sequence.
+
degree_sequence_game, igraph_degree_sequence_game —  Generates a random graph with a given degree sequence.
 

-
DELALL, DELALL — Remove all attributes.
+
DELALL, DELALL — Remove all attributes.
 

-
DELEA, DELEA — Remove an edge attribute.
+
DELEA, DELEA — Remove an edge attribute.
 

-
DELEAS, DELEAS — Remove all edge attributes.
+
DELEAS, DELEAS — Remove all edge attributes.
 

 
delete_edges, igraph_delete_edges —  Removes edges from a graph.
 

@@ -618,106 +618,106 @@ 
D

 
 
delete_vertices_idx, igraph_delete_vertices_idx —  Removes some vertices (with all their edges) from the graph.
 

-
DELGA, DELGA — Remove a graph attribute.
+
DELGA, DELGA — Remove a graph attribute.
 

-
DELGAS, DELGAS — Remove all graph attributes.
+
DELGAS, DELGAS — Remove all graph attributes.
 

-
DELVA, DELVA — Remove a vertex attribute.
+
DELVA, DELVA — Remove a vertex attribute.
 

-
DELVAS, DELVAS — Remove all vertex attributes.
+
DELVAS, DELVAS — Remove all vertex attributes.
 

-
density, igraph_density —  Calculate the density of a graph.
+
density, igraph_density —  Calculate the density of a graph.
 

 
destroy, igraph_destroy —  Frees the memory allocated for a graph object.
 

-
deterministic_optimal_imitation, igraph_deterministic_optimal_imitation —  Adopt a strategy via deterministic optimal imitation.
+
deterministic_optimal_imitation, igraph_deterministic_optimal_imitation —  Adopt a strategy via deterministic optimal imitation.
 

-
de_bruijn, igraph_de_bruijn —  Generate a de Bruijn graph.
+
de_bruijn, igraph_de_bruijn —  Generate a de Bruijn graph.
 

-
dfs, igraph_dfs —  Depth-first search.
+
dfs, igraph_dfs —  Depth-first search.
 

-
dfshandler_t, igraph_dfshandler_t —  Callback type for the DFS function.
+
dfshandler_t, igraph_dfshandler_t —  Callback type for the DFS function.
 

-
diameter, igraph_diameter —  Calculates the diameter of a graph (longest geodesic).
+
diameter, igraph_diameter —  Calculates the diameter of a graph (longest geodesic).
 

-
diameter_dijkstra, igraph_diameter_dijkstra —  Calculates the weighted diameter of a graph using Dijkstra's algorithm.
+
diameter_dijkstra, igraph_diameter_dijkstra —  Calculates the weighted diameter of a graph using Dijkstra's algorithm.
 

-
difference, igraph_difference —  Calculates the difference of two graphs.
+
difference, igraph_difference —  Calculates the difference of two graphs.
 

-
dim_select, igraph_dim_select —  Dimensionality selection.
+
dim_select, igraph_dim_select —  Dimensionality selection.
 

-
disjoint_union, igraph_disjoint_union —  Creates the union of two disjoint graphs.
+
disjoint_union, igraph_disjoint_union —  Creates the union of two disjoint graphs.
 

-
disjoint_union_many, igraph_disjoint_union_many —  The disjoint union of many graphs.
+
disjoint_union_many, igraph_disjoint_union_many —  The disjoint union of many graphs.
 

-
distances, igraph_distances —  Length of the shortest paths between vertices.
+
distances, igraph_distances —  Length of the shortest paths between vertices.
 

-
distances_bellman_ford, igraph_distances_bellman_ford —  Weighted shortest path lengths between vertices, allowing negative weights.
+
distances_bellman_ford, igraph_distances_bellman_ford —  Weighted shortest path lengths between vertices, allowing negative weights.
 

-
distances_cutoff, igraph_distances_cutoff —  Length of the shortest paths between vertices, with cutoff.
+
distances_cutoff, igraph_distances_cutoff —  Length of the shortest paths between vertices, with cutoff.
 

-
distances_dijkstra, igraph_distances_dijkstra —  Weighted shortest path lengths between vertices.
+
distances_dijkstra, igraph_distances_dijkstra —  Weighted shortest path lengths between vertices.
 

-
distances_dijkstra_cutoff, igraph_distances_dijkstra_cutoff —  Weighted shortest path lengths between vertices, with cutoff.
+
distances_dijkstra_cutoff, igraph_distances_dijkstra_cutoff —  Weighted shortest path lengths between vertices, with cutoff.
 

-
distances_floyd_warshall, igraph_distances_floyd_warshall —  Weighted all-pairs shortest path lengths with the Floyd-Warshall algorithm.
+
distances_floyd_warshall, igraph_distances_floyd_warshall —  Weighted all-pairs shortest path lengths with the Floyd-Warshall algorithm.
 

-
distances_johnson, igraph_distances_johnson —  Weighted shortest path lengths between vertices, using Johnson's algorithm.
+
distances_johnson, igraph_distances_johnson —  Weighted shortest path lengths between vertices, using Johnson's algorithm.
 

-
diversity, igraph_diversity —  Structural diversity index of the vertices.
+
diversity, igraph_diversity —  Structural diversity index of the vertices.
 

-
dominator_tree, igraph_dominator_tree —  Calculates the dominator tree of a flowgraph.
+
dominator_tree, igraph_dominator_tree —  Calculates the dominator tree of a flowgraph.
 

-
dot_product_game, igraph_dot_product_game —  Generates a random dot product graph.
+
dot_product_game, igraph_dot_product_game —  Generates a random dot product graph.
 

-
dqueue_back, igraph_dqueue_back —  Tail of the queue.
+
dqueue_back, igraph_dqueue_back —  Tail of the queue.
 

-
dqueue_clear, igraph_dqueue_clear —  Remove all elements from the queue.
+
dqueue_clear, igraph_dqueue_clear —  Remove all elements from the queue.
 

-
dqueue_destroy, igraph_dqueue_destroy —  Destroy a double ended queue.
+
dqueue_destroy, igraph_dqueue_destroy —  Destroy a double ended queue.
 

-
dqueue_empty, igraph_dqueue_empty —  Decide whether the queue is empty.
+
dqueue_empty, igraph_dqueue_empty —  Decide whether the queue is empty.
 

-
dqueue_full, igraph_dqueue_full —  Check whether the queue is full.
+
dqueue_full, igraph_dqueue_full —  Check whether the queue is full.
 

-
dqueue_get, igraph_dqueue_get —  Access an element in a queue.
+
dqueue_get, igraph_dqueue_get —  Access an element in a queue.
 

-
dqueue_head, igraph_dqueue_head —  Head of the queue.
+
dqueue_head, igraph_dqueue_head —  Head of the queue.
 

-
dqueue_init, igraph_dqueue_init —  Initialize a double ended queue (deque).
+
dqueue_init, igraph_dqueue_init —  Initialize a double ended queue (deque).
 

-
dqueue_pop, igraph_dqueue_pop —  Remove the head.
+
dqueue_pop, igraph_dqueue_pop —  Remove the head.
 

-
dqueue_pop_back, igraph_dqueue_pop_back —  Removes the tail.
+
dqueue_pop_back, igraph_dqueue_pop_back —  Removes the tail.
 

-
dqueue_push, igraph_dqueue_push —  Appends an element.
+
dqueue_push, igraph_dqueue_push —  Appends an element.
 

-
dqueue_size, igraph_dqueue_size —  Number of elements in the queue.
+
dqueue_size, igraph_dqueue_size —  Number of elements in the queue.
 

-
dyad_census, igraph_dyad_census —  Dyad census, as defined by Holland and Leinhardt.
+
dyad_census, igraph_dyad_census —  Dyad census, as defined by Holland and Leinhardt.
 

 

 

 

 
E

 

-
EAB, EAB — Query a boolean edge attribute.
+
EAB, EAB — Query a boolean edge attribute.
 

-
EABV, EABV — Query a boolean edge attribute for all edges.
+
EABV, EABV — Query a boolean edge attribute for all edges.
 

-
EAN, EAN — Query a numeric edge attribute.
+
EAN, EAN — Query a numeric edge attribute.
 

-
EANV, EANV — Query a numeric edge attribute for all edges.
+
EANV, EANV — Query a numeric edge attribute for all edges.
 

-
EAS, EAS — Query a string edge attribute.
+
EAS, EAS — Query a string edge attribute.
 

-
EASV, EASV — Query a string edge attribute for all edges.
+
EASV, EASV — Query a string edge attribute for all edges.
 

-
ecc, igraph_ecc —  Edge clustering coefficient of some edges.
+
ecc, igraph_ecc —  Edge clustering coefficient of some edges.
 

-
eccentricity, igraph_eccentricity —  Eccentricity of some vertices.
+
eccentricity, igraph_eccentricity —  Eccentricity of some vertices.
 

-
eccentricity_dijkstra, igraph_eccentricity_dijkstra —  Eccentricity of some vertices, using weighted edges.
+
eccentricity_dijkstra, igraph_eccentricity_dijkstra —  Eccentricity of some vertices, using weighted edges.
 

 
ecount, igraph_ecount —  The number of edges in a graph.
 

@@ -727,43 +727,43 @@ 
E

 
 
edges, igraph_edges —  Gives the head and tail vertices of a series of edges.
 

-
edge_betweenness, igraph_edge_betweenness —  Betweenness centrality of the edges.
+
edge_betweenness, igraph_edge_betweenness —  Betweenness centrality of the edges.
 

-
edge_betweenness_cutoff, igraph_edge_betweenness_cutoff —  Range-limited betweenness centrality of the edges.
+
edge_betweenness_cutoff, igraph_edge_betweenness_cutoff —  Range-limited betweenness centrality of the edges.
 

-
edge_betweenness_subset, igraph_edge_betweenness_subset —  Edge betweenness centrality for a subset of source and target vertices.
+
edge_betweenness_subset, igraph_edge_betweenness_subset —  Edge betweenness centrality for a subset of source and target vertices.
 

-
edge_connectivity, igraph_edge_connectivity —  The minimum edge connectivity in a graph.
+
edge_connectivity, igraph_edge_connectivity —  The minimum edge connectivity in a graph.
 

-
edge_disjoint_paths, igraph_edge_disjoint_paths —  The maximum number of edge-disjoint paths between two vertices.
+
edge_disjoint_paths, igraph_edge_disjoint_paths —  The maximum number of edge-disjoint paths between two vertices.
 

-
eigenvector_centrality, igraph_eigenvector_centrality —  Eigenvector centrality of the vertices.
+
eigenvector_centrality, igraph_eigenvector_centrality —  Eigenvector centrality of the vertices.
 

-
eit_create, igraph_eit_create —  Creates an edge iterator from an edge selector.
+
eit_create, igraph_eit_create —  Creates an edge iterator from an edge selector.
 

-
eit_destroy, igraph_eit_destroy —  Destroys an edge iterator.
+
eit_destroy, igraph_eit_destroy —  Destroys an edge iterator.
 

-
EIT_END, IGRAPH_EIT_END —  Are we at the end?
+
EIT_END, IGRAPH_EIT_END —  Are we at the end?
 

-
EIT_GET, IGRAPH_EIT_GET —  Query an edge iterator.
+
EIT_GET, IGRAPH_EIT_GET —  Query an edge iterator.
 

-
EIT_NEXT, IGRAPH_EIT_NEXT —  Next edge.
+
EIT_NEXT, IGRAPH_EIT_NEXT —  Next edge.
 

-
EIT_RESET, IGRAPH_EIT_RESET —  Reset an edge iterator.
+
EIT_RESET, IGRAPH_EIT_RESET —  Reset an edge iterator.
 

-
EIT_SIZE, IGRAPH_EIT_SIZE —  Number of edges in the iterator.
+
EIT_SIZE, IGRAPH_EIT_SIZE —  Number of edges in the iterator.
 

 
empty, igraph_empty —  Creates an empty graph with some vertices and no edges.
 

 
empty_attrs, igraph_empty_attrs —  Creates an empty graph with some vertices, no edges and some graph attributes.
 

-
enter_safelocale, igraph_enter_safelocale —  Temporarily set the C locale.
+
enter_safelocale, igraph_enter_safelocale —  Temporarily set the C locale.
 

-
erdos_renyi_game, igraph_erdos_renyi_game —  Generates a random (Erdős-Rényi) graph.
+
erdos_renyi_game, igraph_erdos_renyi_game —  Generates a random (Erdős-Rényi) graph.
 

-
erdos_renyi_game_gnm, igraph_erdos_renyi_game_gnm —  Generates a random (Erdős-Rényi) graph with a fixed number of edges.
+
erdos_renyi_game_gnm, igraph_erdos_renyi_game_gnm —  Generates a random (Erdős-Rényi) graph with a fixed number of edges.
 

-
erdos_renyi_game_gnp, igraph_erdos_renyi_game_gnp —  Generates a random (Erdős-Rényi) graph with fixed edge probabilities.
+
erdos_renyi_game_gnp, igraph_erdos_renyi_game_gnp —  Generates a random (Erdős-Rényi) graph with fixed edge probabilities.
 

 
ERROR, IGRAPH_ERROR —  Triggers an error.
 

@@ -785,74 +785,74 @@ 
E

 
 
error_type_t, igraph_error_type_t —  Error code type.
 

-
ess_1, igraph_ess_1 —  Immediate version of the single edge edge selector.
+
ess_1, igraph_ess_1 —  Immediate version of the single edge edge selector.
 

-
ess_all, igraph_ess_all —  Edge set, all edges (immediate version).
+
ess_all, igraph_ess_all —  Edge set, all edges (immediate version).
 

-
ess_none, igraph_ess_none —  Immediate empty edge selector.
+
ess_none, igraph_ess_none —  Immediate empty edge selector.
 

-
ess_range, igraph_ess_range —  Immediate version of the sequence edge selector.
+
ess_range, igraph_ess_range —  Immediate version of the sequence edge selector.
 

-
ess_seq, igraph_ess_seq —  Immediate version of the sequence edge selector, with inclusive endpoints.
+
ess_seq, igraph_ess_seq —  Immediate version of the sequence edge selector, with inclusive endpoints.
 

-
ess_vector, igraph_ess_vector —  Immediate vector view edge selector.
+
ess_vector, igraph_ess_vector —  Immediate vector view edge selector.
 

-
establishment_game, igraph_establishment_game —  Generates a graph with a simple growing model with vertex types.
+
establishment_game, igraph_establishment_game —  Generates a graph with a simple growing model with vertex types.
 

-
es_1, igraph_es_1 —  Edge selector containing a single edge.
+
es_1, igraph_es_1 —  Edge selector containing a single edge.
 

-
es_all, igraph_es_all —  Edge set, all edges.
+
es_all, igraph_es_all —  Edge set, all edges.
 

-
es_all_between, igraph_es_all_between —  Edge selector, all edge IDs between a pair of vertices.
+
es_all_between, igraph_es_all_between —  Edge selector, all edge IDs between a pair of vertices.
 

-
es_as_vector, igraph_es_as_vector —  Transform edge selector into vector.
+
es_as_vector, igraph_es_as_vector —  Transform edge selector into vector.
 

-
es_copy, igraph_es_copy —  Creates a copy of an edge selector.
+
es_copy, igraph_es_copy —  Creates a copy of an edge selector.
 

-
es_destroy, igraph_es_destroy —  Destroys an edge selector object.
+
es_destroy, igraph_es_destroy —  Destroys an edge selector object.
 

-
es_incident, igraph_es_incident —  Edges incident on a given vertex.
+
es_incident, igraph_es_incident —  Edges incident on a given vertex.
 

-
es_is_all, igraph_es_is_all —  Check whether an edge selector includes all edges.
+
es_is_all, igraph_es_is_all —  Check whether an edge selector includes all edges.
 

-
es_none, igraph_es_none —  Empty edge selector.
+
es_none, igraph_es_none —  Empty edge selector.
 

-
es_pairs, igraph_es_pairs —  Edge selector, multiple edges defined by their endpoints in a vector.
+
es_pairs, igraph_es_pairs —  Edge selector, multiple edges defined by their endpoints in a vector.
 

-
es_pairs_small, igraph_es_pairs_small —  Edge selector, multiple edges defined by their endpoints as arguments.
+
es_pairs_small, igraph_es_pairs_small —  Edge selector, multiple edges defined by their endpoints as arguments.
 

-
es_path, igraph_es_path —  Edge selector, edge IDs on a path.
+
es_path, igraph_es_path —  Edge selector, edge IDs on a path.
 

-
es_range, igraph_es_range —  Edge selector, a sequence of edge IDs.
+
es_range, igraph_es_range —  Edge selector, a sequence of edge IDs.
 

-
es_seq, igraph_es_seq —  Edge selector, a sequence of edge IDs, with inclusive endpoints (deprecated).
+
es_seq, igraph_es_seq —  Edge selector, a sequence of edge IDs, with inclusive endpoints (deprecated).
 

-
es_size, igraph_es_size —  Returns the size of the edge selector.
+
es_size, igraph_es_size —  Returns the size of the edge selector.
 

-
es_type, igraph_es_type —  Returns the type of the edge selector.
+
es_type, igraph_es_type —  Returns the type of the edge selector.
 

-
es_vector, igraph_es_vector —  Handle a vector as an edge selector.
+
es_vector, igraph_es_vector —  Handle a vector as an edge selector.
 

-
es_vector_copy, igraph_es_vector_copy —  Edge set, based on a vector, with copying.
+
es_vector_copy, igraph_es_vector_copy —  Edge set, based on a vector, with copying.
 

-
eulerian_cycle, igraph_eulerian_cycle —  Finds an Eulerian cycle.
+
eulerian_cycle, igraph_eulerian_cycle —  Finds an Eulerian cycle.
 

-
eulerian_path, igraph_eulerian_path —  Finds an Eulerian path.
+
eulerian_path, igraph_eulerian_path —  Finds an Eulerian path.
 

-
even_tarjan_reduction, igraph_even_tarjan_reduction —  Even-Tarjan reduction of a graph.
+
even_tarjan_reduction, igraph_even_tarjan_reduction —  Even-Tarjan reduction of a graph.
 

-
exit_safelocale, igraph_exit_safelocale —  Temporarily set the C locale.
+
exit_safelocale, igraph_exit_safelocale —  Temporarily set the C locale.
 

 
expand_path_to_pairs, igraph_expand_path_to_pairs —  Helper function to convert a sequence of vertex IDs describing a path into a "pairs" vector.
 

-
extended_chordal_ring, igraph_extended_chordal_ring —  Create an extended chordal ring.
+
extended_chordal_ring, igraph_extended_chordal_ring —  Create an extended chordal ring.
 

 

 

 

 
F

 

-
famous, igraph_famous —  Create a famous graph by simply providing its name.
+
famous, igraph_famous —  Create a famous graph by simply providing its name.
 

 
FATAL, IGRAPH_FATAL —  Triggers a fatal error.
 

@@ -866,7 +866,7 @@ 
F

 
 
fatal_handler_t, igraph_fatal_handler_t —  The type of igraph fatal error handler functions.
 

-
feedback_arc_set, igraph_feedback_arc_set —  Feedback arc set of a graph using exact or heuristic methods.
+
feedback_arc_set, igraph_feedback_arc_set —  Feedback arc set of a graph using exact or heuristic methods.
 

 
FINALLY, IGRAPH_FINALLY —  Registers an object for deallocation.
 

@@ -874,195 +874,195 @@ 
F

 
 
FINALLY_FREE, IGRAPH_FINALLY_FREE —  Deallocates objects registered at the current level.
 

-
forest_fire_game, igraph_forest_fire_game —  Generates a network according to the “forest fire game”.
+
forest_fire_game, igraph_forest_fire_game —  Generates a network according to the “forest fire game”.
 

 
free, igraph_free —  Deallocate memory that was allocated by igraph functions.
 

 
FROM, IGRAPH_FROM —  The source vertex of an edge.
 

-
from_hrg_dendrogram, igraph_from_hrg_dendrogram —  Create a graph representation of the dendrogram of a hierarchical random graph model.
+
from_hrg_dendrogram, igraph_from_hrg_dendrogram —  Create a graph representation of the dendrogram of a hierarchical random graph model.
 

-
from_prufer, igraph_from_prufer —  Generates a tree from a Prüfer sequence.
+
from_prufer, igraph_from_prufer —  Generates a tree from a Prüfer sequence.
 

-
full, igraph_full —  Creates a full graph (complete graph).
+
full, igraph_full —  Creates a full graph (complete graph).
 

-
full_bipartite, igraph_full_bipartite —  Creates a complete bipartite graph.
+
full_bipartite, igraph_full_bipartite —  Creates a complete bipartite graph.
 

-
full_citation, igraph_full_citation —  Creates a full citation graph (a complete directed acyclic graph).
+
full_citation, igraph_full_citation —  Creates a full citation graph (a complete directed acyclic graph).
 

-
full_multipartite, igraph_full_multipartite —  Creates a full multipartite graph.
+
full_multipartite, igraph_full_multipartite —  Creates a full multipartite graph.
 

-
fundamental_cycles, igraph_fundamental_cycles —  Finds a fundamental cycle basis.
+
fundamental_cycles, igraph_fundamental_cycles —  Finds a fundamental cycle basis.
 

 

 

 

 
G

 

-
GAB, GAB — Query a boolean graph attribute.
+
GAB, GAB — Query a boolean graph attribute.
 

-
GAN, GAN — Query a numeric graph attribute.
+
GAN, GAN — Query a numeric graph attribute.
 

-
GAS, GAS — Query a string graph attribute.
+
GAS, GAS — Query a string graph attribute.
 

-
generalized_petersen, igraph_generalized_petersen —  Creates a Generalized Petersen graph.
+
generalized_petersen, igraph_generalized_petersen —  Creates a Generalized Petersen graph.
 

-
get_adjacency, igraph_get_adjacency —  The adjacency matrix of a graph.
+
get_adjacency, igraph_get_adjacency —  The adjacency matrix of a graph.
 

-
get_adjacency_sparse, igraph_get_adjacency_sparse —  Returns the adjacency matrix of a graph in a sparse matrix format.
+
get_adjacency_sparse, igraph_get_adjacency_sparse —  Returns the adjacency matrix of a graph in a sparse matrix format.
 

 
get_all_eids_between, igraph_get_all_eids_between —  Returns all edge IDs between a pair of vertices.
 

-
get_all_shortest_paths, igraph_get_all_shortest_paths —  All shortest paths (geodesics) from a vertex.
+
get_all_shortest_paths, igraph_get_all_shortest_paths —  All shortest paths (geodesics) from a vertex.
 

-
get_all_shortest_paths_dijkstra, igraph_get_all_shortest_paths_dijkstra —  All weighted shortest paths (geodesics) from a vertex.
+
get_all_shortest_paths_dijkstra, igraph_get_all_shortest_paths_dijkstra —  All weighted shortest paths (geodesics) from a vertex.
 

-
get_all_simple_paths, igraph_get_all_simple_paths —  List all simple paths from one source.
+
get_all_simple_paths, igraph_get_all_simple_paths —  List all simple paths from one source.
 

-
get_biadjacency, igraph_get_biadjacency —  Converts a bipartite graph into a bipartite adjacency matrix.
+
get_biadjacency, igraph_get_biadjacency —  Converts a bipartite graph into a bipartite adjacency matrix.
 

-
get_edgelist, igraph_get_edgelist —  The list of edges in a graph.
+
get_edgelist, igraph_get_edgelist —  The list of edges in a graph.
 

 
get_eid, igraph_get_eid —  Get the edge ID from the endpoints of an edge.
 

 
get_eids, igraph_get_eids — Return edge IDs based on the adjacent vertices.
 

-
get_incidence, igraph_get_incidence —  Convert a bipartite graph into a bipartite adjacency matrix (deprecated alias).
+
get_incidence, igraph_get_incidence —  Convert a bipartite graph into a bipartite adjacency matrix (deprecated alias).
 

-
get_isomorphisms_vf2, igraph_get_isomorphisms_vf2 —  Collect all isomorphic mappings of two graphs.
+
get_isomorphisms_vf2, igraph_get_isomorphisms_vf2 —  Collect all isomorphic mappings of two graphs.
 

-
get_isomorphisms_vf2_callback, igraph_get_isomorphisms_vf2_callback — The generic VF2 interface
+
get_isomorphisms_vf2_callback, igraph_get_isomorphisms_vf2_callback — The generic VF2 interface
 

-
get_k_shortest_paths, igraph_get_k_shortest_paths —  k shortest paths between two vertices.
+
get_k_shortest_paths, igraph_get_k_shortest_paths —  k shortest paths between two vertices.
 

-
get_laplacian, igraph_get_laplacian —  Returns the Laplacian matrix of a graph.
+
get_laplacian, igraph_get_laplacian —  Returns the Laplacian matrix of a graph.
 

-
get_laplacian_sparse, igraph_get_laplacian_sparse —  Returns the Laplacian of a graph in a sparse matrix format.
+
get_laplacian_sparse, igraph_get_laplacian_sparse —  Returns the Laplacian of a graph in a sparse matrix format.
 

-
get_shortest_path, igraph_get_shortest_path —  Shortest path from one vertex to another one.
+
get_shortest_path, igraph_get_shortest_path —  Shortest path from one vertex to another one.
 

-
get_shortest_paths, igraph_get_shortest_paths —  Shortest paths from a vertex.
+
get_shortest_paths, igraph_get_shortest_paths —  Shortest paths from a vertex.
 

-
get_shortest_paths_bellman_ford, igraph_get_shortest_paths_bellman_ford —  Weighted shortest paths from a vertex, allowing negative weights.
+
get_shortest_paths_bellman_ford, igraph_get_shortest_paths_bellman_ford —  Weighted shortest paths from a vertex, allowing negative weights.
 

-
get_shortest_paths_dijkstra, igraph_get_shortest_paths_dijkstra —  Weighted shortest paths from a vertex.
+
get_shortest_paths_dijkstra, igraph_get_shortest_paths_dijkstra —  Weighted shortest paths from a vertex.
 

-
get_shortest_path_astar, igraph_get_shortest_path_astar —  A* gives the shortest path from one vertex to another, with heuristic.
+
get_shortest_path_astar, igraph_get_shortest_path_astar —  A* gives the shortest path from one vertex to another, with heuristic.
 

-
get_shortest_path_bellman_ford, igraph_get_shortest_path_bellman_ford —  Weighted shortest path from one vertex to another one (Bellman-Ford).
+
get_shortest_path_bellman_ford, igraph_get_shortest_path_bellman_ford —  Weighted shortest path from one vertex to another one (Bellman-Ford).
 

-
get_shortest_path_dijkstra, igraph_get_shortest_path_dijkstra —  Weighted shortest path from one vertex to another one (Dijkstra).
+
get_shortest_path_dijkstra, igraph_get_shortest_path_dijkstra —  Weighted shortest path from one vertex to another one (Dijkstra).
 

-
get_sparsemat, igraph_get_sparsemat —  Converts an igraph graph to a sparse matrix (deprecated).
+
get_sparsemat, igraph_get_sparsemat —  Converts an igraph graph to a sparse matrix (deprecated).
 

-
get_stochastic, igraph_get_stochastic —  Stochastic adjacency matrix of a graph.
+
get_stochastic, igraph_get_stochastic —  Stochastic adjacency matrix of a graph.
 

-
get_stochastic_sparse, igraph_get_stochastic_sparse —  The stochastic adjacency matrix of a graph.
+
get_stochastic_sparse, igraph_get_stochastic_sparse —  The stochastic adjacency matrix of a graph.
 

-
get_stochastic_sparsemat, igraph_get_stochastic_sparsemat —  Stochastic adjacency matrix of a graph (deprecated).
+
get_stochastic_sparsemat, igraph_get_stochastic_sparsemat —  Stochastic adjacency matrix of a graph (deprecated).
 

-
get_subisomorphisms_vf2, igraph_get_subisomorphisms_vf2 —  Return all subgraph isomorphic mappings.
+
get_subisomorphisms_vf2, igraph_get_subisomorphisms_vf2 —  Return all subgraph isomorphic mappings.
 

-
get_subisomorphisms_vf2_callback, igraph_get_subisomorphisms_vf2_callback —  Generic VF2 function for subgraph isomorphism problems.
+
get_subisomorphisms_vf2_callback, igraph_get_subisomorphisms_vf2_callback —  Generic VF2 function for subgraph isomorphism problems.
 

-
get_widest_path, igraph_get_widest_path —  Widest path from one vertex to another one.
+
get_widest_path, igraph_get_widest_path —  Widest path from one vertex to another one.
 

-
get_widest_paths, igraph_get_widest_paths —  Widest paths from a single vertex.
+
get_widest_paths, igraph_get_widest_paths —  Widest paths from a single vertex.
 

-
girth, igraph_girth —  The girth of a graph is the length of the shortest cycle in it.
+
girth, igraph_girth —  The girth of a graph is the length of the shortest cycle in it.
 

-
global_efficiency, igraph_global_efficiency —  Calculates the global efficiency of a network.
+
global_efficiency, igraph_global_efficiency —  Calculates the global efficiency of a network.
 

-
gomory_hu_tree, igraph_gomory_hu_tree —  Gomory-Hu tree of a graph.
+
gomory_hu_tree, igraph_gomory_hu_tree —  Gomory-Hu tree of a graph.
 

-
graphlets, igraph_graphlets — Calculate graphlets basis and project the graph on it
+
graphlets, igraph_graphlets — Calculate graphlets basis and project the graph on it
 

-
graphlets_candidate_basis, igraph_graphlets_candidate_basis — Calculate a candidate graphlets basis
+
graphlets_candidate_basis, igraph_graphlets_candidate_basis — Calculate a candidate graphlets basis
 

-
graphlets_project, igraph_graphlets_project — Project a graph on a graphlets basis
+
graphlets_project, igraph_graphlets_project — Project a graph on a graphlets basis
 

-
graph_center, igraph_graph_center —  Central vertices of a graph.
+
graph_center, igraph_graph_center —  Central vertices of a graph.
 

-
graph_center_dijkstra, igraph_graph_center_dijkstra —  Central vertices of a graph, using weighted edges.
+
graph_center_dijkstra, igraph_graph_center_dijkstra —  Central vertices of a graph, using weighted edges.
 

-
graph_count, igraph_graph_count —  The number of unlabelled graphs on the given number of vertices.
+
graph_count, igraph_graph_count —  The number of unlabelled graphs on the given number of vertices.
 

-
graph_power, igraph_graph_power —  The kth power of a graph.
+
graph_power, igraph_graph_power —  The kth power of a graph.
 

-
grg_game, igraph_grg_game —  Generates a geometric random graph.
+
grg_game, igraph_grg_game —  Generates a geometric random graph.
 

-
growing_random_game, igraph_growing_random_game —  Generates a growing random graph.
+
growing_random_game, igraph_growing_random_game —  Generates a growing random graph.
 

 

 

 

 
H

 

-
harmonic_centrality, igraph_harmonic_centrality —  Harmonic centrality for some vertices.
+
harmonic_centrality, igraph_harmonic_centrality —  Harmonic centrality for some vertices.
 

-
harmonic_centrality_cutoff, igraph_harmonic_centrality_cutoff —  Range limited harmonic centrality.
+
harmonic_centrality_cutoff, igraph_harmonic_centrality_cutoff —  Range limited harmonic centrality.
 

-
has_loop, igraph_has_loop —  Returns whether the graph has at least one loop edge.
+
has_loop, igraph_has_loop —  Returns whether the graph has at least one loop edge.
 

-
has_multiple, igraph_has_multiple —  Check whether the graph has at least one multiple edge.
+
has_multiple, igraph_has_multiple —  Check whether the graph has at least one multiple edge.
 

-
has_mutual, igraph_has_mutual —  Check whether a directed graph has any mutual edges.
+
has_mutual, igraph_has_mutual —  Check whether a directed graph has any mutual edges.
 

-
heap_clear, igraph_heap_clear —  Removes all elements from a heap.
+
heap_clear, igraph_heap_clear —  Removes all elements from a heap.
 

-
heap_delete_top, igraph_heap_delete_top —  Removes and returns the top element.
+
heap_delete_top, igraph_heap_delete_top —  Removes and returns the top element.
 

-
heap_destroy, igraph_heap_destroy —  Destroys an initialized heap object.
+
heap_destroy, igraph_heap_destroy —  Destroys an initialized heap object.
 

-
heap_empty, igraph_heap_empty —  Decides whether a heap object is empty.
+
heap_empty, igraph_heap_empty —  Decides whether a heap object is empty.
 

-
heap_init, igraph_heap_init —  Initializes an empty heap object.
+
heap_init, igraph_heap_init —  Initializes an empty heap object.
 

-
heap_init_array, igraph_heap_init_array —  Build a heap from an array.
+
heap_init_array, igraph_heap_init_array —  Build a heap from an array.
 

-
heap_push, igraph_heap_push —  Add an element.
+
heap_push, igraph_heap_push —  Add an element.
 

-
heap_reserve, igraph_heap_reserve —  Reserves memory for a heap.
+
heap_reserve, igraph_heap_reserve —  Reserves memory for a heap.
 

-
heap_size, igraph_heap_size —  Number of elements in the heap.
+
heap_size, igraph_heap_size —  Number of elements in the heap.
 

-
heap_top, igraph_heap_top —  Top element.
+
heap_top, igraph_heap_top —  Top element.
 

-
hexagonal_lattice, igraph_hexagonal_lattice —  A hexagonal lattice with the given shape.
+
hexagonal_lattice, igraph_hexagonal_lattice —  A hexagonal lattice with the given shape.
 

-
hrg_consensus, igraph_hrg_consensus —  Calculate a consensus tree for a HRG.
+
hrg_consensus, igraph_hrg_consensus —  Calculate a consensus tree for a HRG.
 

-
hrg_create, igraph_hrg_create —  Create a HRG from an igraph graph.
+
hrg_create, igraph_hrg_create —  Create a HRG from an igraph graph.
 

-
hrg_dendrogram, igraph_hrg_dendrogram —  Create a dendrogram from a hierarchical random graph.
+
hrg_dendrogram, igraph_hrg_dendrogram —  Create a dendrogram from a hierarchical random graph.
 

-
hrg_destroy, igraph_hrg_destroy —  Deallocate memory for an HRG.
+
hrg_destroy, igraph_hrg_destroy —  Deallocate memory for an HRG.
 

-
hrg_fit, igraph_hrg_fit —  Fit a hierarchical random graph model to a network.
+
hrg_fit, igraph_hrg_fit —  Fit a hierarchical random graph model to a network.
 

-
hrg_game, igraph_hrg_game —  Generate a hierarchical random graph.
+
hrg_game, igraph_hrg_game —  Generate a hierarchical random graph.
 

-
hrg_init, igraph_hrg_init —  Allocate memory for a HRG.
+
hrg_init, igraph_hrg_init —  Allocate memory for a HRG.
 

-
hrg_predict, igraph_hrg_predict —  Predict missing edges in a graph, based on HRG models.
+
hrg_predict, igraph_hrg_predict —  Predict missing edges in a graph, based on HRG models.
 

-
hrg_resize, igraph_hrg_resize —  Resize a HRG.
+
hrg_resize, igraph_hrg_resize —  Resize a HRG.
 

-
hrg_sample, igraph_hrg_sample —  Sample from a hierarchical random graph model.
+
hrg_sample, igraph_hrg_sample —  Sample from a hierarchical random graph model.
 

-
hrg_size, igraph_hrg_size —  Returns the size of the HRG, the number of leaf nodes.
+
hrg_size, igraph_hrg_size —  Returns the size of the HRG, the number of leaf nodes.
 

-
hrg_t, igraph_hrg_t —  Data structure to store a hierarchical random graph.
+
hrg_t, igraph_hrg_t —  Data structure to store a hierarchical random graph.
 

-
hsbm_game, igraph_hsbm_game —  Hierarchical stochastic block model.
+
hsbm_game, igraph_hsbm_game —  Hierarchical stochastic block model.
 

-
hsbm_list_game, igraph_hsbm_list_game —  Hierarchical stochastic block model, more general version.
+
hsbm_list_game, igraph_hsbm_list_game —  Hierarchical stochastic block model, more general version.
 

-
hub_and_authority_scores, igraph_hub_and_authority_scores —  Kleinberg's hub and authority scores (HITS).
+
hub_and_authority_scores, igraph_hub_and_authority_scores —  Kleinberg's hub and authority scores (HITS).
 

-
hub_score, igraph_hub_score —  Kleinberg's hub scores.
+
hub_score, igraph_hub_score —  Kleinberg's hub scores.
 

-
hypercube, igraph_hypercube —  The n-dimensional hypercube graph.
+
hypercube, igraph_hypercube —  The n-dimensional hypercube graph.
 

 

 

@@ -1085,272 +1085,272 @@ 
I

 
 
igraph_uint_t, Atomic data types
 

-
incidence, igraph_incidence —  Creates a bipartite graph from a bipartite adjacency matrix (deprecated alias).
+
incidence, igraph_incidence —  Creates a bipartite graph from a bipartite adjacency matrix (deprecated alias).
 

 
incident, igraph_incident —  Gives the incident edges of a vertex.
 

-
inclist_clear, igraph_inclist_clear —  Removes all edges from an incidence list.
+
inclist_clear, igraph_inclist_clear —  Removes all edges from an incidence list.
 

-
inclist_destroy, igraph_inclist_destroy —  Frees all memory allocated for an incidence list.
+
inclist_destroy, igraph_inclist_destroy —  Frees all memory allocated for an incidence list.
 

-
inclist_get, igraph_inclist_get —  Query a vector in an incidence list.
+
inclist_get, igraph_inclist_get —  Query a vector in an incidence list.
 

-
inclist_init, igraph_inclist_init —  Initializes an incidence list.
+
inclist_init, igraph_inclist_init —  Initializes an incidence list.
 

-
inclist_size, igraph_inclist_size —  Returns the number of vertices in an incidence list.
+
inclist_size, igraph_inclist_size —  Returns the number of vertices in an incidence list.
 

-
independence_number, igraph_independence_number —  Finds the independence number of the graph.
+
independence_number, igraph_independence_number —  Finds the independence number of the graph.
 

-
independent_vertex_sets, igraph_independent_vertex_sets —  Finds all independent vertex sets in a graph.
+
independent_vertex_sets, igraph_independent_vertex_sets —  Finds all independent vertex sets in a graph.
 

-
induced_subgraph, igraph_induced_subgraph —  Creates a subgraph induced by the specified vertices.
+
induced_subgraph, igraph_induced_subgraph —  Creates a subgraph induced by the specified vertices.
 

-
induced_subgraph_edges, igraph_induced_subgraph_edges —  The edges contained within an induced subgraph.
+
induced_subgraph_edges, igraph_induced_subgraph_edges —  The edges contained within an induced subgraph.
 

-
induced_subgraph_map, igraph_induced_subgraph_map —  Creates an induced subraph and returns the mapping from the original.
+
induced_subgraph_map, igraph_induced_subgraph_map —  Creates an induced subraph and returns the mapping from the original.
 

-
intersection, igraph_intersection —  Collect the common edges from two graphs.
+
intersection, igraph_intersection —  Collect the common edges from two graphs.
 

-
intersection_many, igraph_intersection_many —  The intersection of more than two graphs.
+
intersection_many, igraph_intersection_many —  The intersection of more than two graphs.
 

 
invalidate_cache, igraph_invalidate_cache —  Invalidates the internal cache of an igraph graph.
 

-
isoclass, igraph_isoclass —  Determine the isomorphism class of small graphs.
+
isoclass, igraph_isoclass —  Determine the isomorphism class of small graphs.
 

-
isoclass_create, igraph_isoclass_create —  Creates a graph from the given isomorphism class.
+
isoclass_create, igraph_isoclass_create —  Creates a graph from the given isomorphism class.
 

-
isoclass_subgraph, igraph_isoclass_subgraph —  The isomorphism class of a subgraph of a graph.
+
isoclass_subgraph, igraph_isoclass_subgraph —  The isomorphism class of a subgraph of a graph.
 

-
isocompat_t, igraph_isocompat_t — Callback type, called to check whether two vertices or edges are compatible
+
isocompat_t, igraph_isocompat_t — Callback type, called to check whether two vertices or edges are compatible
 

-
isohandler_t, igraph_isohandler_t — Callback type, called when an isomorphism was found
+
isohandler_t, igraph_isohandler_t — Callback type, called when an isomorphism was found
 

-
isomorphic, igraph_isomorphic —  Are two graphs isomorphic?
+
isomorphic, igraph_isomorphic —  Are two graphs isomorphic?
 

-
isomorphic_34, igraph_isomorphic_34 —  Graph isomorphism for 3-4 vertices (deprecated).
+
isomorphic_34, igraph_isomorphic_34 —  Graph isomorphism for 3-4 vertices (deprecated).
 

-
isomorphic_bliss, igraph_isomorphic_bliss —  Graph isomorphism via Bliss.
+
isomorphic_bliss, igraph_isomorphic_bliss —  Graph isomorphism via Bliss.
 

-
isomorphic_function_vf2, igraph_isomorphic_function_vf2 —  The generic VF2 interface (deprecated alias).
+
isomorphic_function_vf2, igraph_isomorphic_function_vf2 —  The generic VF2 interface (deprecated alias).
 

-
isomorphic_vf2, igraph_isomorphic_vf2 —  Isomorphism via VF2.
+
isomorphic_vf2, igraph_isomorphic_vf2 —  Isomorphism via VF2.
 

-
is_acyclic, igraph_is_acyclic —  Checks whether a graph is acyclic or not.
+
is_acyclic, igraph_is_acyclic —  Checks whether a graph is acyclic or not.
 

-
is_biconnected, igraph_is_biconnected —  Checks whether a graph is biconnected.
+
is_biconnected, igraph_is_biconnected —  Checks whether a graph is biconnected.
 

-
is_bigraphical, igraph_is_bigraphical —  Is there a bipartite graph with the given bi-degree-sequence?
+
is_bigraphical, igraph_is_bigraphical —  Is there a bipartite graph with the given bi-degree-sequence?
 

-
is_bipartite, igraph_is_bipartite —  Check whether a graph is bipartite.
+
is_bipartite, igraph_is_bipartite —  Check whether a graph is bipartite.
 

-
is_chordal, igraph_is_chordal —  Decides whether a graph is chordal.
+
is_chordal, igraph_is_chordal —  Decides whether a graph is chordal.
 

-
is_clique, igraph_is_clique —  Does a set of vertices form a clique?
+
is_clique, igraph_is_clique —  Does a set of vertices form a clique?
 

-
is_complete, igraph_is_complete —  Decides whether the graph is complete.
+
is_complete, igraph_is_complete —  Decides whether the graph is complete.
 

-
is_connected, igraph_is_connected —  Decides whether the graph is (weakly or strongly) connected.
+
is_connected, igraph_is_connected —  Decides whether the graph is (weakly or strongly) connected.
 

-
is_dag, igraph_is_dag —  Checks whether a graph is a directed acyclic graph (DAG).
+
is_dag, igraph_is_dag —  Checks whether a graph is a directed acyclic graph (DAG).
 

 
is_directed, igraph_is_directed —  Is this a directed graph?
 

-
is_eulerian, igraph_is_eulerian —  Checks whether an Eulerian path or cycle exists.
+
is_eulerian, igraph_is_eulerian —  Checks whether an Eulerian path or cycle exists.
 

-
is_forest, igraph_is_forest —  Decides whether the graph is a forest.
+
is_forest, igraph_is_forest —  Decides whether the graph is a forest.
 

-
is_graphical, igraph_is_graphical —  Is there a graph with the given degree sequence?
+
is_graphical, igraph_is_graphical —  Is there a graph with the given degree sequence?
 

-
is_independent_vertex_set, igraph_is_independent_vertex_set —  Does a set of vertices form an independent set?
+
is_independent_vertex_set, igraph_is_independent_vertex_set —  Does a set of vertices form an independent set?
 

-
is_loop, igraph_is_loop —  Find the loop edges in a graph.
+
is_loop, igraph_is_loop —  Find the loop edges in a graph.
 

-
is_matching, igraph_is_matching — Checks whether the given matching is valid for the given graph.
+
is_matching, igraph_is_matching — Checks whether the given matching is valid for the given graph.
 

-
is_maximal_matching, igraph_is_maximal_matching —  Checks whether a matching in a graph is maximal.
+
is_maximal_matching, igraph_is_maximal_matching —  Checks whether a matching in a graph is maximal.
 

-
is_minimal_separator, igraph_is_minimal_separator —  Decides whether a set of vertices is a minimal separator.
+
is_minimal_separator, igraph_is_minimal_separator —  Decides whether a set of vertices is a minimal separator.
 

-
is_multiple, igraph_is_multiple —  Find the multiple edges in a graph.
+
is_multiple, igraph_is_multiple —  Find the multiple edges in a graph.
 

-
is_mutual, igraph_is_mutual —  Check whether some edges of a directed graph are mutual.
+
is_mutual, igraph_is_mutual —  Check whether some edges of a directed graph are mutual.
 

-
is_perfect, igraph_is_perfect —  Checks if the graph is perfect.
+
is_perfect, igraph_is_perfect —  Checks if the graph is perfect.
 

 
is_same_graph, igraph_is_same_graph —  Are two graphs identical as labelled graphs?
 

-
is_separator, igraph_is_separator —  Would removing this set of vertices disconnect the graph?
+
is_separator, igraph_is_separator —  Would removing this set of vertices disconnect the graph?
 

-
is_simple, igraph_is_simple —  Decides whether the input graph is a simple graph.
+
is_simple, igraph_is_simple —  Decides whether the input graph is a simple graph.
 

-
is_tree, igraph_is_tree —  Decides whether the graph is a tree.
+
is_tree, igraph_is_tree —  Decides whether the graph is a tree.
 

 
 

 

 
J

 

-
join, igraph_join —  Creates the join of two disjoint graphs.
+
join, igraph_join —  Creates the join of two disjoint graphs.
 

-
joint_degree_distribution, igraph_joint_degree_distribution —  The joint degree distribution of a graph.
+
joint_degree_distribution, igraph_joint_degree_distribution —  The joint degree distribution of a graph.
 

-
joint_degree_matrix, igraph_joint_degree_matrix —  The joint degree matrix of a graph.
+
joint_degree_matrix, igraph_joint_degree_matrix —  The joint degree matrix of a graph.
 

-
joint_type_distribution, igraph_joint_type_distribution —  Mixing matrix for vertex categories.
+
joint_type_distribution, igraph_joint_type_distribution —  Mixing matrix for vertex categories.
 

 

 

 

 
K

 

-
kary_tree, igraph_kary_tree —  Creates a k-ary tree in which almost all vertices have k children.
+
kary_tree, igraph_kary_tree —  Creates a k-ary tree in which almost all vertices have k children.
 

-
kautz, igraph_kautz —  Generate a Kautz graph.
+
kautz, igraph_kautz —  Generate a Kautz graph.
 

-
k_regular_game, igraph_k_regular_game —  Generates a random graph where each vertex has the same degree.
+
k_regular_game, igraph_k_regular_game —  Generates a random graph where each vertex has the same degree.
 

 

 

 

 
L

 

-
lapack_dgeev, igraph_lapack_dgeev —  Eigenvalues and optionally eigenvectors of a non-symmetric matrix.
+
lapack_dgeev, igraph_lapack_dgeev —  Eigenvalues and optionally eigenvectors of a non-symmetric matrix.
 

-
lapack_dgeevx, igraph_lapack_dgeevx —  Eigenvalues/vectors of nonsymmetric matrices, expert mode.
+
lapack_dgeevx, igraph_lapack_dgeevx —  Eigenvalues/vectors of nonsymmetric matrices, expert mode.
 

-
lapack_dgesv, igraph_lapack_dgesv —  Solve system of linear equations with LU factorization.
+
lapack_dgesv, igraph_lapack_dgesv —  Solve system of linear equations with LU factorization.
 

-
lapack_dgetrf, igraph_lapack_dgetrf —  LU factorization of a general M-by-N matrix.
+
lapack_dgetrf, igraph_lapack_dgetrf —  LU factorization of a general M-by-N matrix.
 

-
lapack_dgetrs, igraph_lapack_dgetrs —  Solve general system of linear equations using LU factorization.
+
lapack_dgetrs, igraph_lapack_dgetrs —  Solve general system of linear equations using LU factorization.
 

-
lapack_dsyevr, igraph_lapack_dsyevr —  Selected eigenvalues and optionally eigenvectors of a symmetric matrix.
+
lapack_dsyevr, igraph_lapack_dsyevr —  Selected eigenvalues and optionally eigenvectors of a symmetric matrix.
 

-
laplacian, igraph_laplacian —  Returns the Laplacian matrix of a graph (deprecated).
+
laplacian, igraph_laplacian —  Returns the Laplacian matrix of a graph (deprecated).
 

-
laplacian_normalization_t, igraph_laplacian_normalization_t —  Normalization methods for a Laplacian matrix.
+
laplacian_normalization_t, igraph_laplacian_normalization_t —  Normalization methods for a Laplacian matrix.
 

-
laplacian_spectral_embedding, igraph_laplacian_spectral_embedding — Spectral embedding of the Laplacian of a graph
+
laplacian_spectral_embedding, igraph_laplacian_spectral_embedding — Spectral embedding of the Laplacian of a graph
 

-
largest_cliques, igraph_largest_cliques —  Finds the largest clique(s) in a graph.
+
largest_cliques, igraph_largest_cliques —  Finds the largest clique(s) in a graph.
 

-
largest_independent_vertex_sets, igraph_largest_independent_vertex_sets —  Finds the largest independent vertex set(s) in a graph.
+
largest_independent_vertex_sets, igraph_largest_independent_vertex_sets —  Finds the largest independent vertex set(s) in a graph.
 

-
largest_weighted_cliques, igraph_largest_weighted_cliques —  Finds the largest weight clique(s) in a graph.
+
largest_weighted_cliques, igraph_largest_weighted_cliques —  Finds the largest weight clique(s) in a graph.
 

-
lastcit_game, igraph_lastcit_game —  Simulates a citation network, based on time passed since the last citation.
+
lastcit_game, igraph_lastcit_game —  Simulates a citation network, based on time passed since the last citation.
 

-
lattice, igraph_lattice —  Arbitrary dimensional square lattices (deprecated).
+
lattice, igraph_lattice —  Arbitrary dimensional square lattices (deprecated).
 

-
layout_bipartite, igraph_layout_bipartite — Simple layout for bipartite graphs.
+
layout_bipartite, igraph_layout_bipartite — Simple layout for bipartite graphs.
 

-
layout_circle, igraph_layout_circle —  Places the vertices uniformly on a circle in arbitrary order.
+
layout_circle, igraph_layout_circle —  Places the vertices uniformly on a circle in arbitrary order.
 

-
layout_davidson_harel, igraph_layout_davidson_harel —  Davidson-Harel layout algorithm.
+
layout_davidson_harel, igraph_layout_davidson_harel —  Davidson-Harel layout algorithm.
 

-
layout_drl, igraph_layout_drl — The DrL layout generator
+
layout_drl, igraph_layout_drl — The DrL layout generator
 

-
layout_drl_3d, igraph_layout_drl_3d — The DrL layout generator, 3d version.
+
layout_drl_3d, igraph_layout_drl_3d — The DrL layout generator, 3d version.
 

-
layout_drl_default_t, igraph_layout_drl_default_t — Predefined parameter templates for the DrL layout generator
+
layout_drl_default_t, igraph_layout_drl_default_t — Predefined parameter templates for the DrL layout generator
 

-
layout_drl_options_init, igraph_layout_drl_options_init — Initialize parameters for the DrL layout generator
+
layout_drl_options_init, igraph_layout_drl_options_init — Initialize parameters for the DrL layout generator
 

-
layout_drl_options_t, igraph_layout_drl_options_t — Parameters for the DrL layout generator
+
layout_drl_options_t, igraph_layout_drl_options_t — Parameters for the DrL layout generator
 

-
layout_fruchterman_reingold, igraph_layout_fruchterman_reingold —  Places the vertices on a plane according to the Fruchterman-Reingold algorithm.
+
layout_fruchterman_reingold, igraph_layout_fruchterman_reingold —  Places the vertices on a plane according to the Fruchterman-Reingold algorithm.
 

-
layout_fruchterman_reingold_3d, igraph_layout_fruchterman_reingold_3d —  3D Fruchterman-Reingold algorithm.
+
layout_fruchterman_reingold_3d, igraph_layout_fruchterman_reingold_3d —  3D Fruchterman-Reingold algorithm.
 

-
layout_gem, igraph_layout_gem —  Layout graph according to GEM algorithm.
+
layout_gem, igraph_layout_gem —  Layout graph according to GEM algorithm.
 

-
layout_graphopt, igraph_layout_graphopt —  Optimizes vertex layout via the graphopt algorithm.
+
layout_graphopt, igraph_layout_graphopt —  Optimizes vertex layout via the graphopt algorithm.
 

-
layout_grid, igraph_layout_grid —  Places the vertices on a regular grid on the plane.
+
layout_grid, igraph_layout_grid —  Places the vertices on a regular grid on the plane.
 

-
layout_grid_3d, igraph_layout_grid_3d —  Places the vertices on a regular grid in the 3D space.
+
layout_grid_3d, igraph_layout_grid_3d —  Places the vertices on a regular grid in the 3D space.
 

-
layout_kamada_kawai, igraph_layout_kamada_kawai —  Places the vertices on a plane according to the Kamada-Kawai algorithm.
+
layout_kamada_kawai, igraph_layout_kamada_kawai —  Places the vertices on a plane according to the Kamada-Kawai algorithm.
 

-
layout_kamada_kawai_3d, igraph_layout_kamada_kawai_3d —  3D version of the Kamada-Kawai layout generator.
+
layout_kamada_kawai_3d, igraph_layout_kamada_kawai_3d —  3D version of the Kamada-Kawai layout generator.
 

-
layout_lgl, igraph_layout_lgl —  Force based layout algorithm for large graphs.
+
layout_lgl, igraph_layout_lgl —  Force based layout algorithm for large graphs.
 

-
layout_mds, igraph_layout_mds —  Place the vertices on a plane using multidimensional scaling.
+
layout_mds, igraph_layout_mds —  Place the vertices on a plane using multidimensional scaling.
 

-
layout_merge_dla, igraph_layout_merge_dla —  Merges multiple layouts by using a DLA algorithm.
+
layout_merge_dla, igraph_layout_merge_dla —  Merges multiple layouts by using a DLA algorithm.
 

-
layout_random, igraph_layout_random —  Places the vertices uniform randomly on a plane.
+
layout_random, igraph_layout_random —  Places the vertices uniform randomly on a plane.
 

-
layout_random_3d, igraph_layout_random_3d —  Places the vertices uniform randomly in a cube.
+
layout_random_3d, igraph_layout_random_3d —  Places the vertices uniform randomly in a cube.
 

-
layout_reingold_tilford, igraph_layout_reingold_tilford —  Reingold-Tilford layout for tree graphs.
+
layout_reingold_tilford, igraph_layout_reingold_tilford —  Reingold-Tilford layout for tree graphs.
 

-
layout_reingold_tilford_circular, igraph_layout_reingold_tilford_circular —  Circular Reingold-Tilford layout for trees.
+
layout_reingold_tilford_circular, igraph_layout_reingold_tilford_circular —  Circular Reingold-Tilford layout for trees.
 

-
layout_sphere, igraph_layout_sphere —  Places vertices (more or less) uniformly on a sphere.
+
layout_sphere, igraph_layout_sphere —  Places vertices (more or less) uniformly on a sphere.
 

-
layout_star, igraph_layout_star —  Generates a star-like layout.
+
layout_star, igraph_layout_star —  Generates a star-like layout.
 

-
layout_sugiyama, igraph_layout_sugiyama —  Sugiyama layout algorithm for layered directed acyclic graphs.
+
layout_sugiyama, igraph_layout_sugiyama —  Sugiyama layout algorithm for layered directed acyclic graphs.
 

-
layout_umap, igraph_layout_umap —  Layout using Uniform Manifold Approximation and Projection (UMAP).
+
layout_umap, igraph_layout_umap —  Layout using Uniform Manifold Approximation and Projection (UMAP).
 

-
layout_umap_3d, igraph_layout_umap_3d —  3D layout using UMAP.
+
layout_umap_3d, igraph_layout_umap_3d —  3D layout using UMAP.
 

-
layout_umap_compute_weights, igraph_layout_umap_compute_weights —  Compute weights for a UMAP layout starting from distances.
+
layout_umap_compute_weights, igraph_layout_umap_compute_weights —  Compute weights for a UMAP layout starting from distances.
 

-
lazy_adjlist_clear, igraph_lazy_adjlist_clear —  Removes all edges from a lazy adjacency list.
+
lazy_adjlist_clear, igraph_lazy_adjlist_clear —  Removes all edges from a lazy adjacency list.
 

-
lazy_adjlist_destroy, igraph_lazy_adjlist_destroy —  Deallocate a lazt adjacency list.
+
lazy_adjlist_destroy, igraph_lazy_adjlist_destroy —  Deallocate a lazt adjacency list.
 

-
lazy_adjlist_get, igraph_lazy_adjlist_get —  Query neighbor vertices.
+
lazy_adjlist_get, igraph_lazy_adjlist_get —  Query neighbor vertices.
 

-
lazy_adjlist_has, igraph_lazy_adjlist_has —  Are adjacenct vertices already stored in a lazy adjacency list?
+
lazy_adjlist_has, igraph_lazy_adjlist_has —  Are adjacenct vertices already stored in a lazy adjacency list?
 

-
lazy_adjlist_init, igraph_lazy_adjlist_init —  Initializes a lazy adjacency list.
+
lazy_adjlist_init, igraph_lazy_adjlist_init —  Initializes a lazy adjacency list.
 

-
lazy_adjlist_size, igraph_lazy_adjlist_size —  Returns the number of vertices in a lazy adjacency list.
+
lazy_adjlist_size, igraph_lazy_adjlist_size —  Returns the number of vertices in a lazy adjacency list.
 

-
lazy_inclist_clear, igraph_lazy_inclist_clear —  Removes all edges from a lazy incidence list.
+
lazy_inclist_clear, igraph_lazy_inclist_clear —  Removes all edges from a lazy incidence list.
 

-
lazy_inclist_destroy, igraph_lazy_inclist_destroy —  Deallocates a lazy incidence list.
+
lazy_inclist_destroy, igraph_lazy_inclist_destroy —  Deallocates a lazy incidence list.
 

-
lazy_inclist_get, igraph_lazy_inclist_get —  Query incident edges.
+
lazy_inclist_get, igraph_lazy_inclist_get —  Query incident edges.
 

-
lazy_inclist_has, igraph_lazy_inclist_has —  Are incident edges already stored in a lazy inclist?
+
lazy_inclist_has, igraph_lazy_inclist_has —  Are incident edges already stored in a lazy inclist?
 

-
lazy_inclist_init, igraph_lazy_inclist_init —  Initializes a lazy incidence list of edges.
+
lazy_inclist_init, igraph_lazy_inclist_init —  Initializes a lazy incidence list of edges.
 

-
lazy_inclist_size, igraph_lazy_inclist_size —  Returns the number of vertices in a lazy incidence list.
+
lazy_inclist_size, igraph_lazy_inclist_size —  Returns the number of vertices in a lazy incidence list.
 

-
lcf, igraph_lcf —  Creates a graph from LCF notation.
+
lcf, igraph_lcf —  Creates a graph from LCF notation.
 

-
lcf_vector, igraph_lcf_vector —  Creates a graph from LCF notation.
+
lcf_vector, igraph_lcf_vector —  Creates a graph from LCF notation.
 

-
le_community_to_membership, igraph_le_community_to_membership —  Vertex membership from the leading eigenvector community structure.
+
le_community_to_membership, igraph_le_community_to_membership —  Vertex membership from the leading eigenvector community structure.
 

-
linegraph, igraph_linegraph —  Create the line graph of a graph.
+
linegraph, igraph_linegraph —  Create the line graph of a graph.
 

-
list_triangles, igraph_list_triangles —  Find all triangles in a graph.
+
list_triangles, igraph_list_triangles —  Find all triangles in a graph.
 

-
local_efficiency, igraph_local_efficiency —  Calculates the local efficiency around each vertex in a network.
+
local_efficiency, igraph_local_efficiency —  Calculates the local efficiency around each vertex in a network.
 

-
local_scan_0, igraph_local_scan_0 — Local scan-statistics, k=0
+
local_scan_0, igraph_local_scan_0 — Local scan-statistics, k=0
 

-
local_scan_0_them, igraph_local_scan_0_them — Local THEM scan-statistics, k=0
+
local_scan_0_them, igraph_local_scan_0_them — Local THEM scan-statistics, k=0
 

-
local_scan_1_ecount, igraph_local_scan_1_ecount — Local scan-statistics, k=1, edge count and sum of weights
+
local_scan_1_ecount, igraph_local_scan_1_ecount — Local scan-statistics, k=1, edge count and sum of weights
 

-
local_scan_1_ecount_them, igraph_local_scan_1_ecount_them — Local THEM scan-statistics, k=1, edge count and sum of weights
+
local_scan_1_ecount_them, igraph_local_scan_1_ecount_them — Local THEM scan-statistics, k=1, edge count and sum of weights
 

-
local_scan_k_ecount, igraph_local_scan_k_ecount —  Sum the number of edges or the weights in k-neighborhood of every vertex.
+
local_scan_k_ecount, igraph_local_scan_k_ecount —  Sum the number of edges or the weights in k-neighborhood of every vertex.
 

-
local_scan_k_ecount_them, igraph_local_scan_k_ecount_them —  Local THEM scan-statistics, edge count or sum of weights.
+
local_scan_k_ecount_them, igraph_local_scan_k_ecount_them —  Local THEM scan-statistics, edge count or sum of weights.
 

-
local_scan_neighborhood_ecount, igraph_local_scan_neighborhood_ecount — Local scan-statistics with pre-calculated neighborhoods
+
local_scan_neighborhood_ecount, igraph_local_scan_neighborhood_ecount — Local scan-statistics with pre-calculated neighborhoods
 

-
local_scan_subset_ecount, igraph_local_scan_subset_ecount —  Local scan-statistics of subgraphs induced by subsets of vertices.
+
local_scan_subset_ecount, igraph_local_scan_subset_ecount —  Local scan-statistics of subgraphs induced by subsets of vertices.
 

 

 

@@ -1359,228 +1359,228 @@ 
M

 

 
malloc, igraph_malloc —  Allocate memory that can be safely deallocated by igraph functions.
 

-
MATRIX, MATRIX —  Accessing an element of a matrix.
+
MATRIX, MATRIX —  Accessing an element of a matrix.
 

-
matrix_add, igraph_matrix_add — Add two matrices.
+
matrix_add, igraph_matrix_add — Add two matrices.
 

-
matrix_add_cols, igraph_matrix_add_cols —  Adds columns to a matrix.
+
matrix_add_cols, igraph_matrix_add_cols —  Adds columns to a matrix.
 

-
matrix_add_constant, igraph_matrix_add_constant — Add a constant to every element.
+
matrix_add_constant, igraph_matrix_add_constant — Add a constant to every element.
 

-
matrix_add_rows, igraph_matrix_add_rows —  Adds rows to a matrix.
+
matrix_add_rows, igraph_matrix_add_rows —  Adds rows to a matrix.
 

-
matrix_all_almost_e, igraph_matrix_all_almost_e —  Are all elements almost equal?
+
matrix_all_almost_e, igraph_matrix_all_almost_e —  Are all elements almost equal?
 

-
matrix_all_e, igraph_matrix_all_e —  Are all elements equal?
+
matrix_all_e, igraph_matrix_all_e —  Are all elements equal?
 

-
matrix_all_g, igraph_matrix_all_g —  Are all elements greater?
+
matrix_all_g, igraph_matrix_all_g —  Are all elements greater?
 

-
matrix_all_ge, igraph_matrix_all_ge —  Are all elements greater or equal?
+
matrix_all_ge, igraph_matrix_all_ge —  Are all elements greater or equal?
 

-
matrix_all_l, igraph_matrix_all_l —  Are all elements less?
+
matrix_all_l, igraph_matrix_all_l —  Are all elements less?
 

-
matrix_all_le, igraph_matrix_all_le —  Are all elements less or equal?
+
matrix_all_le, igraph_matrix_all_le —  Are all elements less or equal?
 

-
matrix_as_sparsemat, igraph_matrix_as_sparsemat —  Converts a dense matrix to a sparse matrix.
+
matrix_as_sparsemat, igraph_matrix_as_sparsemat —  Converts a dense matrix to a sparse matrix.
 

-
matrix_capacity, igraph_matrix_capacity —  Returns the number of elements allocated for a matrix.
+
matrix_capacity, igraph_matrix_capacity —  Returns the number of elements allocated for a matrix.
 

-
matrix_cbind, igraph_matrix_cbind — Combine matrices columnwise.
+
matrix_cbind, igraph_matrix_cbind — Combine matrices columnwise.
 

-
matrix_colsum, igraph_matrix_colsum —  Columnwise sum.
+
matrix_colsum, igraph_matrix_colsum —  Columnwise sum.
 

-
matrix_complex_all_almost_e, igraph_matrix_complex_all_almost_e —  Are all elements almost equal?
+
matrix_complex_all_almost_e, igraph_matrix_complex_all_almost_e —  Are all elements almost equal?
 

-
matrix_complex_create, igraph_matrix_complex_create —  Creates a complex matrix from a real and imaginary part.
+
matrix_complex_create, igraph_matrix_complex_create —  Creates a complex matrix from a real and imaginary part.
 

-
matrix_complex_create_polar, igraph_matrix_complex_create_polar —  Creates a complex matrix from a magnitude and an angle.
+
matrix_complex_create_polar, igraph_matrix_complex_create_polar —  Creates a complex matrix from a magnitude and an angle.
 

-
matrix_complex_imag, igraph_matrix_complex_imag —  Gives the imaginary part of a complex matrix.
+
matrix_complex_imag, igraph_matrix_complex_imag —  Gives the imaginary part of a complex matrix.
 

-
matrix_complex_real, igraph_matrix_complex_real —  Gives the real part of a complex matrix.
+
matrix_complex_real, igraph_matrix_complex_real —  Gives the real part of a complex matrix.
 

-
matrix_complex_realimag, igraph_matrix_complex_realimag —  Gives the real and imaginary parts of a complex matrix.
+
matrix_complex_realimag, igraph_matrix_complex_realimag —  Gives the real and imaginary parts of a complex matrix.
 

-
matrix_complex_zapsmall, igraph_matrix_complex_zapsmall —  Replaces small elements of a complex matrix by exact zeros.
+
matrix_complex_zapsmall, igraph_matrix_complex_zapsmall —  Replaces small elements of a complex matrix by exact zeros.
 

-
matrix_contains, igraph_matrix_contains — Search for an element.
+
matrix_contains, igraph_matrix_contains — Search for an element.
 

-
matrix_copy, igraph_matrix_copy —  Copies a matrix (deprecated alias).
+
matrix_copy, igraph_matrix_copy —  Copies a matrix (deprecated alias).
 

-
matrix_copy_to, igraph_matrix_copy_to —  Copies a matrix to a regular C array.
+
matrix_copy_to, igraph_matrix_copy_to —  Copies a matrix to a regular C array.
 

-
matrix_destroy, igraph_matrix_destroy —  Destroys a matrix object.
+
matrix_destroy, igraph_matrix_destroy —  Destroys a matrix object.
 

-
matrix_div_elements, igraph_matrix_div_elements — Elementwise division.
+
matrix_div_elements, igraph_matrix_div_elements — Elementwise division.
 

-
matrix_e, igraph_matrix_e — Extract an element from a matrix (deprecated alias).
+
matrix_e, igraph_matrix_e — Extract an element from a matrix (deprecated alias).
 

-
matrix_empty, igraph_matrix_empty —  Is the matrix empty?
+
matrix_empty, igraph_matrix_empty —  Is the matrix empty?
 

-
matrix_e_ptr, igraph_matrix_e_ptr — Pointer to an element of a matrix.
+
matrix_e_ptr, igraph_matrix_e_ptr — Pointer to an element of a matrix.
 

-
matrix_fill, igraph_matrix_fill — Fill with an element.
+
matrix_fill, igraph_matrix_fill — Fill with an element.
 

-
matrix_get, igraph_matrix_get — Extract an element from a matrix.
+
matrix_get, igraph_matrix_get — Extract an element from a matrix.
 

-
matrix_get_col, igraph_matrix_get_col —  Select a column.
+
matrix_get_col, igraph_matrix_get_col —  Select a column.
 

-
matrix_get_ptr, igraph_matrix_get_ptr — Pointer to an element of a matrix.
+
matrix_get_ptr, igraph_matrix_get_ptr — Pointer to an element of a matrix.
 

-
matrix_get_row, igraph_matrix_get_row — Extract a row.
+
matrix_get_row, igraph_matrix_get_row — Extract a row.
 

-
matrix_init, igraph_matrix_init —  Initializes a matrix.
+
matrix_init, igraph_matrix_init —  Initializes a matrix.
 

-
matrix_init_array, igraph_matrix_init_array —  Initializes a matrix from an ordinary C array (constructor).
+
matrix_init_array, igraph_matrix_init_array —  Initializes a matrix from an ordinary C array (constructor).
 

-
matrix_init_copy, igraph_matrix_init_copy —  Copies a matrix.
+
matrix_init_copy, igraph_matrix_init_copy —  Copies a matrix.
 

-
matrix_isnull, igraph_matrix_isnull —  Checks for a null matrix.
+
matrix_isnull, igraph_matrix_isnull —  Checks for a null matrix.
 

-
matrix_is_symmetric, igraph_matrix_is_symmetric —  Is the matrix symmetric?
+
matrix_is_symmetric, igraph_matrix_is_symmetric —  Is the matrix symmetric?
 

-
matrix_max, igraph_matrix_max —  Largest element of a matrix.
+
matrix_max, igraph_matrix_max —  Largest element of a matrix.
 

-
matrix_maxdifference, igraph_matrix_maxdifference —  Maximum absolute difference between two matrices.
+
matrix_maxdifference, igraph_matrix_maxdifference —  Maximum absolute difference between two matrices.
 

-
matrix_min, igraph_matrix_min —  Smallest element of a matrix.
+
matrix_min, igraph_matrix_min —  Smallest element of a matrix.
 

-
matrix_minmax, igraph_matrix_minmax —  Minimum and maximum elements of a matrix.
+
matrix_minmax, igraph_matrix_minmax —  Minimum and maximum elements of a matrix.
 

-
matrix_mul_elements, igraph_matrix_mul_elements —  Elementwise matrix multiplication.
+
matrix_mul_elements, igraph_matrix_mul_elements —  Elementwise matrix multiplication.
 

-
matrix_ncol, igraph_matrix_ncol —  The number of columns in a matrix.
+
matrix_ncol, igraph_matrix_ncol —  The number of columns in a matrix.
 

-
matrix_nrow, igraph_matrix_nrow —  The number of rows in a matrix.
+
matrix_nrow, igraph_matrix_nrow —  The number of rows in a matrix.
 

-
matrix_null, igraph_matrix_null —  Sets all elements in a matrix to zero.
+
matrix_null, igraph_matrix_null —  Sets all elements in a matrix to zero.
 

-
matrix_prod, igraph_matrix_prod —  Product of all matrix elements.
+
matrix_prod, igraph_matrix_prod —  Product of all matrix elements.
 

-
matrix_rbind, igraph_matrix_rbind — Combine two matrices rowwise.
+
matrix_rbind, igraph_matrix_rbind — Combine two matrices rowwise.
 

-
matrix_remove_col, igraph_matrix_remove_col —  Removes a column from a matrix.
+
matrix_remove_col, igraph_matrix_remove_col —  Removes a column from a matrix.
 

-
matrix_remove_row, igraph_matrix_remove_row — Remove a row.
+
matrix_remove_row, igraph_matrix_remove_row — Remove a row.
 

-
matrix_resize, igraph_matrix_resize —  Resizes a matrix.
+
matrix_resize, igraph_matrix_resize —  Resizes a matrix.
 

-
matrix_resize_min, igraph_matrix_resize_min —  Deallocates unused memory for a matrix.
+
matrix_resize_min, igraph_matrix_resize_min —  Deallocates unused memory for a matrix.
 

-
matrix_rowsum, igraph_matrix_rowsum —  Rowwise sum.
+
matrix_rowsum, igraph_matrix_rowsum —  Rowwise sum.
 

-
matrix_scale, igraph_matrix_scale — Multiplies each element of the matrix by a constant.
+
matrix_scale, igraph_matrix_scale — Multiplies each element of the matrix by a constant.
 

-
matrix_search, igraph_matrix_search — Search from a given position.
+
matrix_search, igraph_matrix_search — Search from a given position.
 

-
matrix_select_cols, igraph_matrix_select_cols —  Select some columns of a matrix.
+
matrix_select_cols, igraph_matrix_select_cols —  Select some columns of a matrix.
 

-
matrix_select_rows, igraph_matrix_select_rows —  Select some rows of a matrix.
+
matrix_select_rows, igraph_matrix_select_rows —  Select some rows of a matrix.
 

-
matrix_select_rows_cols, igraph_matrix_select_rows_cols —  Select some rows and columns of a matrix.
+
matrix_select_rows_cols, igraph_matrix_select_rows_cols —  Select some rows and columns of a matrix.
 

-
matrix_set, igraph_matrix_set — Set an element.
+
matrix_set, igraph_matrix_set — Set an element.
 

-
matrix_set_col, igraph_matrix_set_col — Set a column from a vector.
+
matrix_set_col, igraph_matrix_set_col — Set a column from a vector.
 

-
matrix_set_row, igraph_matrix_set_row — Set a row from a vector.
+
matrix_set_row, igraph_matrix_set_row — Set a row from a vector.
 

-
matrix_size, igraph_matrix_size —  The number of elements in a matrix.
+
matrix_size, igraph_matrix_size —  The number of elements in a matrix.
 

-
matrix_sub, igraph_matrix_sub — Difference of two matrices.
+
matrix_sub, igraph_matrix_sub — Difference of two matrices.
 

-
matrix_sum, igraph_matrix_sum —  Sum of elements.
+
matrix_sum, igraph_matrix_sum —  Sum of elements.
 

-
matrix_swap, igraph_matrix_swap —  Swap two matrices.
+
matrix_swap, igraph_matrix_swap —  Swap two matrices.
 

-
matrix_swap_cols, igraph_matrix_swap_cols — Swap two columns.
+
matrix_swap_cols, igraph_matrix_swap_cols — Swap two columns.
 

-
matrix_swap_rows, igraph_matrix_swap_rows — Swap two rows.
+
matrix_swap_rows, igraph_matrix_swap_rows — Swap two rows.
 

-
matrix_transpose, igraph_matrix_transpose —  Transpose of a matrix.
+
matrix_transpose, igraph_matrix_transpose —  Transpose of a matrix.
 

-
matrix_update, igraph_matrix_update — Update from another matrix.
+
matrix_update, igraph_matrix_update — Update from another matrix.
 

-
matrix_view, igraph_matrix_view —  Creates a matrix view into an existing array.
+
matrix_view, igraph_matrix_view —  Creates a matrix view into an existing array.
 

-
matrix_view_from_vector, igraph_matrix_view_from_vector —  Creates a matrix view that treats an existing vector as a matrix.
+
matrix_view_from_vector, igraph_matrix_view_from_vector —  Creates a matrix view that treats an existing vector as a matrix.
 

-
matrix_which_max, igraph_matrix_which_max —  Indices of the largest element.
+
matrix_which_max, igraph_matrix_which_max —  Indices of the largest element.
 

-
matrix_which_min, igraph_matrix_which_min —  Indices of the smallest element.
+
matrix_which_min, igraph_matrix_which_min —  Indices of the smallest element.
 

-
matrix_which_minmax, igraph_matrix_which_minmax —  Indices of the minimum and maximum elements.
+
matrix_which_minmax, igraph_matrix_which_minmax —  Indices of the minimum and maximum elements.
 

-
matrix_zapsmall, igraph_matrix_zapsmall —  Replaces small elements of a matrix by exact zeros.
+
matrix_zapsmall, igraph_matrix_zapsmall —  Replaces small elements of a matrix by exact zeros.
 

-
maxdegree, igraph_maxdegree —  The maximum degree in a graph (or set of vertices).
+
maxdegree, igraph_maxdegree —  The maximum degree in a graph (or set of vertices).
 

-
maxflow, igraph_maxflow —  Maximum network flow between a pair of vertices.
+
maxflow, igraph_maxflow —  Maximum network flow between a pair of vertices.
 

-
maxflow_stats_t, igraph_maxflow_stats_t —  Data structure holding statistics from the push-relabel maximum flow solver.
+
maxflow_stats_t, igraph_maxflow_stats_t —  Data structure holding statistics from the push-relabel maximum flow solver.
 

-
maxflow_value, igraph_maxflow_value —  Maximum flow in a network with the push/relabel algorithm.
+
maxflow_value, igraph_maxflow_value —  Maximum flow in a network with the push/relabel algorithm.
 

-
maximal_cliques, igraph_maximal_cliques —  Finds all maximal cliques in a graph.
+
maximal_cliques, igraph_maximal_cliques —  Finds all maximal cliques in a graph.
 

-
maximal_cliques_callback, igraph_maximal_cliques_callback —  Finds maximal cliques in a graph and calls a function for each one.
+
maximal_cliques_callback, igraph_maximal_cliques_callback —  Finds maximal cliques in a graph and calls a function for each one.
 

-
maximal_cliques_count, igraph_maximal_cliques_count —  Count the number of maximal cliques in a graph.
+
maximal_cliques_count, igraph_maximal_cliques_count —  Count the number of maximal cliques in a graph.
 

-
maximal_cliques_file, igraph_maximal_cliques_file —  Find maximal cliques and write them to a file.
+
maximal_cliques_file, igraph_maximal_cliques_file —  Find maximal cliques and write them to a file.
 

-
maximal_cliques_hist, igraph_maximal_cliques_hist —  Counts the number of maximal cliques of each size in a graph.
+
maximal_cliques_hist, igraph_maximal_cliques_hist —  Counts the number of maximal cliques of each size in a graph.
 

-
maximal_cliques_subset, igraph_maximal_cliques_subset —  Maximal cliques for a subset of initial vertices.
+
maximal_cliques_subset, igraph_maximal_cliques_subset —  Maximal cliques for a subset of initial vertices.
 

-
maximal_independent_vertex_sets, igraph_maximal_independent_vertex_sets —  Finds all maximal independent vertex sets of a graph.
+
maximal_independent_vertex_sets, igraph_maximal_independent_vertex_sets —  Finds all maximal independent vertex sets of a graph.
 

-
maximum_bipartite_matching, igraph_maximum_bipartite_matching — Calculates a maximum matching in a bipartite graph.
+
maximum_bipartite_matching, igraph_maximum_bipartite_matching — Calculates a maximum matching in a bipartite graph.
 

-
maximum_cardinality_search, igraph_maximum_cardinality_search —  Maximum cardinality search.
+
maximum_cardinality_search, igraph_maximum_cardinality_search —  Maximum cardinality search.
 

-
mean_degree, igraph_mean_degree —  The mean degree of a graph.
+
mean_degree, igraph_mean_degree —  The mean degree of a graph.
 

-
mincut, igraph_mincut —  Calculates the minimum cut in a graph.
+
mincut, igraph_mincut —  Calculates the minimum cut in a graph.
 

-
mincut_value, igraph_mincut_value —  The minimum edge cut in a graph.
+
mincut_value, igraph_mincut_value —  The minimum edge cut in a graph.
 

-
minimum_cycle_basis, igraph_minimum_cycle_basis —  Computes a minimum weight cycle basis.
+
minimum_cycle_basis, igraph_minimum_cycle_basis —  Computes a minimum weight cycle basis.
 

-
minimum_size_separators, igraph_minimum_size_separators —  Find all minimum size separating vertex sets.
+
minimum_size_separators, igraph_minimum_size_separators —  Find all minimum size separating vertex sets.
 

-
minimum_spanning_tree, igraph_minimum_spanning_tree —  Calculates one minimum spanning tree of a graph.
+
minimum_spanning_tree, igraph_minimum_spanning_tree —  Calculates one minimum spanning tree of a graph.
 

-
minimum_spanning_tree_prim, igraph_minimum_spanning_tree_prim —  Calculates one minimum spanning tree of a weighted graph.
+
minimum_spanning_tree_prim, igraph_minimum_spanning_tree_prim —  Calculates one minimum spanning tree of a weighted graph.
 

-
minimum_spanning_tree_unweighted, igraph_minimum_spanning_tree_unweighted —  Calculates one minimum spanning tree of an unweighted graph.
+
minimum_spanning_tree_unweighted, igraph_minimum_spanning_tree_unweighted —  Calculates one minimum spanning tree of an unweighted graph.
 

-
modularity, igraph_modularity —  Calculates the modularity of a graph with respect to some clusters or vertex types.
+
modularity, igraph_modularity —  Calculates the modularity of a graph with respect to some clusters or vertex types.
 

-
modularity_matrix, igraph_modularity_matrix —  Calculates the modularity matrix.
+
modularity_matrix, igraph_modularity_matrix —  Calculates the modularity matrix.
 

-
moran_process, igraph_moran_process —  The Moran process in a network setting.
+
moran_process, igraph_moran_process —  The Moran process in a network setting.
 

-
motifs_handler_t, igraph_motifs_handler_t —  Callback type for igraph_motifs_randesu_callback.
+
motifs_handler_t, igraph_motifs_handler_t —  Callback type for igraph_motifs_randesu_callback.
 

-
motifs_randesu, igraph_motifs_randesu —  Count the number of motifs in a graph.
+
motifs_randesu, igraph_motifs_randesu —  Count the number of motifs in a graph.
 

-
motifs_randesu_callback, igraph_motifs_randesu_callback —  Finds motifs in a graph and calls a function for each of them.
+
motifs_randesu_callback, igraph_motifs_randesu_callback —  Finds motifs in a graph and calls a function for each of them.
 

-
motifs_randesu_estimate, igraph_motifs_randesu_estimate —  Estimate the total number of motifs in a graph.
+
motifs_randesu_estimate, igraph_motifs_randesu_estimate —  Estimate the total number of motifs in a graph.
 

-
motifs_randesu_no, igraph_motifs_randesu_no —  Count the total number of motifs in a graph.
+
motifs_randesu_no, igraph_motifs_randesu_no —  Count the total number of motifs in a graph.
 

 

 

 

 
N

 

-
neighborhood, igraph_neighborhood —  Calculate the neighborhood of vertices.
+
neighborhood, igraph_neighborhood —  Calculate the neighborhood of vertices.
 

-
neighborhood_graphs, igraph_neighborhood_graphs —  Create graphs from the neighborhood(s) of some vertex/vertices.
+
neighborhood_graphs, igraph_neighborhood_graphs —  Create graphs from the neighborhood(s) of some vertex/vertices.
 

-
neighborhood_size, igraph_neighborhood_size —  Calculates the size of the neighborhood of a given vertex.
+
neighborhood_size, igraph_neighborhood_size —  Calculates the size of the neighborhood of a given vertex.
 

 
neighbors, igraph_neighbors —  Adjacent vertices to a vertex.
 

@@ -1594,590 +1594,590 @@ 
O

 

 
P

 

-
pagerank, igraph_pagerank —  Calculates the Google PageRank for the specified vertices.
+
pagerank, igraph_pagerank —  Calculates the Google PageRank for the specified vertices.
 

-
pagerank_algo_t, igraph_pagerank_algo_t —  PageRank algorithm implementation.
+
pagerank_algo_t, igraph_pagerank_algo_t —  PageRank algorithm implementation.
 

-
path_length_hist, igraph_path_length_hist — Create a histogram of all shortest path lengths.
+
path_length_hist, igraph_path_length_hist — Create a histogram of all shortest path lengths.
 

-
permute_vertices, igraph_permute_vertices —  Permute the vertices.
+
permute_vertices, igraph_permute_vertices —  Permute the vertices.
 

-
personalized_pagerank, igraph_personalized_pagerank —  Calculates the personalized Google PageRank for the specified vertices.
+
personalized_pagerank, igraph_personalized_pagerank —  Calculates the personalized Google PageRank for the specified vertices.
 

-
personalized_pagerank_vs, igraph_personalized_pagerank_vs —  Calculates the personalized Google PageRank for the specified vertices.
+
personalized_pagerank_vs, igraph_personalized_pagerank_vs —  Calculates the personalized Google PageRank for the specified vertices.
 

-
plfit_result_calculate_p_value, igraph_plfit_result_calculate_p_value —  Calculates the p-value of a fitted power-law model.
+
plfit_result_calculate_p_value, igraph_plfit_result_calculate_p_value —  Calculates the p-value of a fitted power-law model.
 

-
plfit_result_t, igraph_plfit_result_t —  Result of fitting a power-law distribution to a vector.
+
plfit_result_t, igraph_plfit_result_t —  Result of fitting a power-law distribution to a vector.
 

-
power_law_fit, igraph_power_law_fit —  Fits a power-law distribution to a vector of numbers.
+
power_law_fit, igraph_power_law_fit —  Fits a power-law distribution to a vector of numbers.
 

-
preference_game, igraph_preference_game —  Generates a graph with vertex types and connection preferences.
+
preference_game, igraph_preference_game —  Generates a graph with vertex types and connection preferences.
 

-
PROGRESS, IGRAPH_PROGRESS —  Report progress.
+
PROGRESS, IGRAPH_PROGRESS —  Report progress.
 

-
progress, igraph_progress — Report progress
+
progress, igraph_progress — Report progress
 

-
progressf, igraph_progressf — Report progress, printf-like version
+
progressf, igraph_progressf — Report progress, printf-like version
 

-
progress_handler_stderr, igraph_progress_handler_stderr —  A simple predefined progress handler.
+
progress_handler_stderr, igraph_progress_handler_stderr —  A simple predefined progress handler.
 

-
progress_handler_t, igraph_progress_handler_t —  Type of progress handler functions
+
progress_handler_t, igraph_progress_handler_t —  Type of progress handler functions
 

-
pseudo_diameter, igraph_pseudo_diameter —  Approximation and lower bound of diameter.
+
pseudo_diameter, igraph_pseudo_diameter —  Approximation and lower bound of diameter.
 

-
pseudo_diameter_dijkstra, igraph_pseudo_diameter_dijkstra —  Approximation and lower bound of the diameter of a weighted graph.
+
pseudo_diameter_dijkstra, igraph_pseudo_diameter_dijkstra —  Approximation and lower bound of the diameter of a weighted graph.
 

-
psumtree_destroy, igraph_psumtree_destroy —  Destroys a partial prefix sum tree.
+
psumtree_destroy, igraph_psumtree_destroy —  Destroys a partial prefix sum tree.
 

-
psumtree_get, igraph_psumtree_get —  Retrieves the value corresponding to an item in the tree.
+
psumtree_get, igraph_psumtree_get —  Retrieves the value corresponding to an item in the tree.
 

-
psumtree_init, igraph_psumtree_init —  Initializes a partial prefix sum tree.
+
psumtree_init, igraph_psumtree_init —  Initializes a partial prefix sum tree.
 

-
psumtree_reset, igraph_psumtree_reset —  Resets all the values in the tree to zero.
+
psumtree_reset, igraph_psumtree_reset —  Resets all the values in the tree to zero.
 

-
psumtree_search, igraph_psumtree_search —  Finds an item in the tree, given a value.
+
psumtree_search, igraph_psumtree_search —  Finds an item in the tree, given a value.
 

-
psumtree_size, igraph_psumtree_size —  Returns the size of the tree.
+
psumtree_size, igraph_psumtree_size —  Returns the size of the tree.
 

-
psumtree_sum, igraph_psumtree_sum —  Returns the sum of the values of the leaves in the tree.
+
psumtree_sum, igraph_psumtree_sum —  Returns the sum of the values of the leaves in the tree.
 

-
psumtree_update, igraph_psumtree_update —  Updates the value associated to an item in the tree.
+
psumtree_update, igraph_psumtree_update —  Updates the value associated to an item in the tree.
 

 

 

 

 
R

 

-
radius, igraph_radius —  Radius of a graph.
+
radius, igraph_radius —  Radius of a graph.
 

-
radius_dijkstra, igraph_radius_dijkstra —  Radius of a graph, using weighted edges.
+
radius_dijkstra, igraph_radius_dijkstra —  Radius of a graph, using weighted edges.
 

-
random_edge_walk, igraph_random_edge_walk —  Performs a random walk on a graph and returns the traversed edges.
+
random_edge_walk, igraph_random_edge_walk —  Performs a random walk on a graph and returns the traversed edges.
 

-
random_sample, igraph_random_sample —  Generates an increasing random sequence of integers.
+
random_sample, igraph_random_sample —  Generates an increasing random sequence of integers.
 

-
random_spanning_tree, igraph_random_spanning_tree —  Uniformly samples the spanning trees of a graph.
+
random_spanning_tree, igraph_random_spanning_tree —  Uniformly samples the spanning trees of a graph.
 

-
random_walk, igraph_random_walk —  Performs a random walk on a graph.
+
random_walk, igraph_random_walk —  Performs a random walk on a graph.
 

-
reachability, igraph_reachability —  Calculates which vertices are reachable from each vertex in the graph.
+
reachability, igraph_reachability —  Calculates which vertices are reachable from each vertex in the graph.
 

-
read_graph_dimacs, igraph_read_graph_dimacs —  Read a graph in DIMACS format (deprecated alias).
+
read_graph_dimacs, igraph_read_graph_dimacs —  Read a graph in DIMACS format (deprecated alias).
 

-
read_graph_dimacs_flow, igraph_read_graph_dimacs_flow —  Read a graph in DIMACS format.
+
read_graph_dimacs_flow, igraph_read_graph_dimacs_flow —  Read a graph in DIMACS format.
 

-
read_graph_dl, igraph_read_graph_dl —  Reads a file in the DL format of UCINET.
+
read_graph_dl, igraph_read_graph_dl —  Reads a file in the DL format of UCINET.
 

-
read_graph_edgelist, igraph_read_graph_edgelist —  Reads an edge list from a file and creates a graph.
+
read_graph_edgelist, igraph_read_graph_edgelist —  Reads an edge list from a file and creates a graph.
 

-
read_graph_gml, igraph_read_graph_gml —  Read a graph in GML format.
+
read_graph_gml, igraph_read_graph_gml —  Read a graph in GML format.
 

-
read_graph_graphdb, igraph_read_graph_graphdb —  Read a graph in the binary graph database format.
+
read_graph_graphdb, igraph_read_graph_graphdb —  Read a graph in the binary graph database format.
 

-
read_graph_graphml, igraph_read_graph_graphml —  Reads a graph from a GraphML file.
+
read_graph_graphml, igraph_read_graph_graphml —  Reads a graph from a GraphML file.
 

-
read_graph_lgl, igraph_read_graph_lgl —  Reads a graph from an .lgl file.
+
read_graph_lgl, igraph_read_graph_lgl —  Reads a graph from an .lgl file.
 

-
read_graph_ncol, igraph_read_graph_ncol —  Reads an .ncol file used by LGL.
+
read_graph_ncol, igraph_read_graph_ncol —  Reads an .ncol file used by LGL.
 

-
read_graph_pajek, igraph_read_graph_pajek —  Reads a file in Pajek format.
+
read_graph_pajek, igraph_read_graph_pajek —  Reads a file in Pajek format.
 

-
realize_bipartite_degree_sequence, igraph_realize_bipartite_degree_sequence —  Generates a bipartite graph with the given bidegree sequence.
+
realize_bipartite_degree_sequence, igraph_realize_bipartite_degree_sequence —  Generates a bipartite graph with the given bidegree sequence.
 

-
realize_degree_sequence, igraph_realize_degree_sequence —  Generates a graph with the given degree sequence.
+
realize_degree_sequence, igraph_realize_degree_sequence —  Generates a graph with the given degree sequence.
 

 
realloc, igraph_realloc —  Reallocate memory that can be safely deallocated by igraph functions.
 

-
recent_degree_aging_game, igraph_recent_degree_aging_game —  Preferential attachment based on the number of edges gained recently, with aging of vertices.
+
recent_degree_aging_game, igraph_recent_degree_aging_game —  Preferential attachment based on the number of edges gained recently, with aging of vertices.
 

-
recent_degree_game, igraph_recent_degree_game —  Stochastic graph generator based on the number of incident edges a node has gained recently.
+
recent_degree_game, igraph_recent_degree_game —  Stochastic graph generator based on the number of incident edges a node has gained recently.
 

-
reciprocity, igraph_reciprocity —  Calculates the reciprocity of a directed graph.
+
reciprocity, igraph_reciprocity —  Calculates the reciprocity of a directed graph.
 

-
regular_tree, igraph_regular_tree —  Creates a regular tree.
+
regular_tree, igraph_regular_tree —  Creates a regular tree.
 

-
reindex_membership, igraph_reindex_membership —  Makes the IDs in a membership vector contiguous.
+
reindex_membership, igraph_reindex_membership —  Makes the IDs in a membership vector contiguous.
 

-
reverse_edges, igraph_reverse_edges —  Reverses some edges of a directed graph.
+
reverse_edges, igraph_reverse_edges —  Reverses some edges of a directed graph.
 

-
rewire, igraph_rewire —  Randomly rewires a graph while preserving its degree sequence.
+
rewire, igraph_rewire —  Randomly rewires a graph while preserving its degree sequence.
 

-
rewire_directed_edges, igraph_rewire_directed_edges —  Rewires the chosen endpoint of directed edges.
+
rewire_directed_edges, igraph_rewire_directed_edges —  Rewires the chosen endpoint of directed edges.
 

-
rewire_edges, igraph_rewire_edges —  Rewires the edges of a graph with constant probability.
+
rewire_edges, igraph_rewire_edges —  Rewires the edges of a graph with constant probability.
 

-
ring, igraph_ring —  Creates a cycle graph or a path graph.
+
ring, igraph_ring —  Creates a cycle graph or a path graph.
 

-
rngtype_glibc2, igraph_rngtype_glibc2 —  The random number generator introduced in GNU libc 2.
+
rngtype_glibc2, igraph_rngtype_glibc2 —  The random number generator introduced in GNU libc 2.
 

-
rngtype_mt19937, igraph_rngtype_mt19937 —  The MT19937 random number generator.
+
rngtype_mt19937, igraph_rngtype_mt19937 —  The MT19937 random number generator.
 

-
rngtype_pcg32, igraph_rngtype_pcg32 —  The PCG random number generator (32-bit version).
+
rngtype_pcg32, igraph_rngtype_pcg32 —  The PCG random number generator (32-bit version).
 

-
rngtype_pcg64, igraph_rngtype_pcg64 —  The PCG random number generator (64-bit version).
+
rngtype_pcg64, igraph_rngtype_pcg64 —  The PCG random number generator (64-bit version).
 

-
rng_bits, igraph_rng_bits —  The number of random bits that a random number generator can produces in a single round.
+
rng_bits, igraph_rng_bits —  The number of random bits that a random number generator can produces in a single round.
 

-
rng_default, igraph_rng_default —  Query the default random number generator.
+
rng_default, igraph_rng_default —  Query the default random number generator.
 

-
rng_destroy, igraph_rng_destroy —  Deallocates memory associated with a random number generator.
+
rng_destroy, igraph_rng_destroy —  Deallocates memory associated with a random number generator.
 

-
rng_get_binom, igraph_rng_get_binom —  Samples from a binomial distribution.
+
rng_get_binom, igraph_rng_get_binom —  Samples from a binomial distribution.
 

-
rng_get_exp, igraph_rng_get_exp —  Samples from an exponential distribution.
+
rng_get_exp, igraph_rng_get_exp —  Samples from an exponential distribution.
 

-
rng_get_gamma, igraph_rng_get_gamma —  Samples from a gamma distribution.
+
rng_get_gamma, igraph_rng_get_gamma —  Samples from a gamma distribution.
 

-
rng_get_geom, igraph_rng_get_geom —  Samples from a geometric distribution.
+
rng_get_geom, igraph_rng_get_geom —  Samples from a geometric distribution.
 

-
rng_get_integer, igraph_rng_get_integer —  Generate an integer random number from an interval.
+
rng_get_integer, igraph_rng_get_integer —  Generate an integer random number from an interval.
 

-
rng_get_normal, igraph_rng_get_normal —  Samples from a normal distribution.
+
rng_get_normal, igraph_rng_get_normal —  Samples from a normal distribution.
 

-
rng_get_pois, igraph_rng_get_pois —  Samples from a Poisson distribution.
+
rng_get_pois, igraph_rng_get_pois —  Samples from a Poisson distribution.
 

-
rng_get_unif, igraph_rng_get_unif —  Samples real numbers from a given interval.
+
rng_get_unif, igraph_rng_get_unif —  Samples real numbers from a given interval.
 

-
rng_get_unif01, igraph_rng_get_unif01 —  Samples uniformly from the unit interval.
+
rng_get_unif01, igraph_rng_get_unif01 —  Samples uniformly from the unit interval.
 

-
rng_init, igraph_rng_init —  Initializes a random number generator.
+
rng_init, igraph_rng_init —  Initializes a random number generator.
 

-
rng_max, igraph_rng_max —  The maximum possible integer for a random number generator.
+
rng_max, igraph_rng_max —  The maximum possible integer for a random number generator.
 

-
rng_name, igraph_rng_name —  The type of a random number generator.
+
rng_name, igraph_rng_name —  The type of a random number generator.
 

-
rng_seed, igraph_rng_seed —  Seeds a random number generator.
+
rng_seed, igraph_rng_seed —  Seeds a random number generator.
 

-
rng_set_default, igraph_rng_set_default —  Set the default igraph random number generator.
+
rng_set_default, igraph_rng_set_default —  Set the default igraph random number generator.
 

-
roots_for_tree_layout, igraph_roots_for_tree_layout —  Roots suitable for a nice tree layout.
+
roots_for_tree_layout, igraph_roots_for_tree_layout —  Roots suitable for a nice tree layout.
 

-
roulette_wheel_imitation, igraph_roulette_wheel_imitation —  Adopt a strategy via roulette wheel selection.
+
roulette_wheel_imitation, igraph_roulette_wheel_imitation —  Adopt a strategy via roulette wheel selection.
 

-
running_mean, igraph_running_mean —  Calculates the running mean of a vector.
+
running_mean, igraph_running_mean —  Calculates the running mean of a vector.
 

 

 

 

 
S

 

-
sample_dirichlet, igraph_sample_dirichlet —  Sample points from a Dirichlet distribution.
+
sample_dirichlet, igraph_sample_dirichlet —  Sample points from a Dirichlet distribution.
 

-
sample_sphere_surface, igraph_sample_sphere_surface —  Sample points uniformly from the surface of a sphere.
+
sample_sphere_surface, igraph_sample_sphere_surface —  Sample points uniformly from the surface of a sphere.
 

-
sample_sphere_volume, igraph_sample_sphere_volume —  Sample points uniformly from the volume of a sphere.
+
sample_sphere_volume, igraph_sample_sphere_volume —  Sample points uniformly from the volume of a sphere.
 

-
sbm_game, igraph_sbm_game —  Sample from a stochastic block model.
+
sbm_game, igraph_sbm_game —  Sample from a stochastic block model.
 

-
SETEAB, SETEAB — Set a boolean edge attribute
+
SETEAB, SETEAB — Set a boolean edge attribute
 

-
SETEABV, SETEABV — Set a boolean edge attribute for all edges
+
SETEABV, SETEABV — Set a boolean edge attribute for all edges
 

-
SETEAN, SETEAN — Set a numeric edge attribute
+
SETEAN, SETEAN — Set a numeric edge attribute
 

-
SETEANV, SETEANV — Set a numeric edge attribute for all edges
+
SETEANV, SETEANV — Set a numeric edge attribute for all edges
 

-
SETEAS, SETEAS — Set a string edge attribute
+
SETEAS, SETEAS — Set a string edge attribute
 

-
SETEASV, SETEASV — Set a string edge attribute for all edges
+
SETEASV, SETEASV — Set a string edge attribute for all edges
 

-
SETGAB, SETGAB — Set a boolean graph attribute
+
SETGAB, SETGAB — Set a boolean graph attribute
 

-
SETGAN, SETGAN — Set a numeric graph attribute
+
SETGAN, SETGAN — Set a numeric graph attribute
 

-
SETGAS, SETGAS — Set a string graph attribute
+
SETGAS, SETGAS — Set a string graph attribute
 

-
SETVAB, SETVAB — Set a boolean vertex attribute
+
SETVAB, SETVAB — Set a boolean vertex attribute
 

-
SETVABV, SETVABV — Set a boolean vertex attribute for all vertices
+
SETVABV, SETVABV — Set a boolean vertex attribute for all vertices
 

-
SETVAN, SETVAN — Set a numeric vertex attribute
+
SETVAN, SETVAN — Set a numeric vertex attribute
 

-
SETVANV, SETVANV — Set a numeric vertex attribute for all vertices
+
SETVANV, SETVANV — Set a numeric vertex attribute for all vertices
 

-
SETVAS, SETVAS — Set a string vertex attribute
+
SETVAS, SETVAS — Set a string vertex attribute
 

-
SETVASV, SETVASV — Set a string vertex attribute for all vertices
+
SETVASV, SETVASV — Set a string vertex attribute for all vertices
 

-
set_attribute_table, igraph_set_attribute_table —  Attach an attribute table.
+
set_attribute_table, igraph_set_attribute_table —  Attach an attribute table.
 

 
set_error_handler, igraph_set_error_handler —  Sets a new error handler.
 

 
set_fatal_handler, igraph_set_fatal_handler —  Installs a fatal error handler.
 

-
set_progress_handler, igraph_set_progress_handler —  Install a progress handler, or remove the current handler.
+
set_progress_handler, igraph_set_progress_handler —  Install a progress handler, or remove the current handler.
 

-
set_status_handler, igraph_set_status_handler — Install of uninstall a status handler function.
+
set_status_handler, igraph_set_status_handler — Install of uninstall a status handler function.
 

 
set_warning_handler, igraph_set_warning_handler —  Installs a warning handler.
 

-
shortest_paths, igraph_shortest_paths —  Length of the shortest paths between vertices.
+
shortest_paths, igraph_shortest_paths —  Length of the shortest paths between vertices.
 

-
shortest_paths_bellman_ford, igraph_shortest_paths_bellman_ford —  Weighted shortest path lengths between vertices, allowing negative weights (deprecated).
+
shortest_paths_bellman_ford, igraph_shortest_paths_bellman_ford —  Weighted shortest path lengths between vertices, allowing negative weights (deprecated).
 

-
shortest_paths_dijkstra, igraph_shortest_paths_dijkstra —  Weighted shortest path lengths between vertices (deprecated).
+
shortest_paths_dijkstra, igraph_shortest_paths_dijkstra —  Weighted shortest path lengths between vertices (deprecated).
 

-
shortest_paths_johnson, igraph_shortest_paths_johnson —  Weighted shortest path lengths between vertices, using Johnson's algorithm (deprecated).
+
shortest_paths_johnson, igraph_shortest_paths_johnson —  Weighted shortest path lengths between vertices, using Johnson's algorithm (deprecated).
 

-
similarity_dice, igraph_similarity_dice —  Dice similarity coefficient.
+
similarity_dice, igraph_similarity_dice —  Dice similarity coefficient.
 

-
similarity_dice_es, igraph_similarity_dice_es —  Dice similarity coefficient for a given edge selector.
+
similarity_dice_es, igraph_similarity_dice_es —  Dice similarity coefficient for a given edge selector.
 

-
similarity_dice_pairs, igraph_similarity_dice_pairs —  Dice similarity coefficient for given vertex pairs.
+
similarity_dice_pairs, igraph_similarity_dice_pairs —  Dice similarity coefficient for given vertex pairs.
 

-
similarity_inverse_log_weighted, igraph_similarity_inverse_log_weighted —  Vertex similarity based on the inverse logarithm of vertex degrees.
+
similarity_inverse_log_weighted, igraph_similarity_inverse_log_weighted —  Vertex similarity based on the inverse logarithm of vertex degrees.
 

-
similarity_jaccard, igraph_similarity_jaccard —  Jaccard similarity coefficient for the given vertices.
+
similarity_jaccard, igraph_similarity_jaccard —  Jaccard similarity coefficient for the given vertices.
 

-
similarity_jaccard_es, igraph_similarity_jaccard_es —  Jaccard similarity coefficient for a given edge selector.
+
similarity_jaccard_es, igraph_similarity_jaccard_es —  Jaccard similarity coefficient for a given edge selector.
 

-
similarity_jaccard_pairs, igraph_similarity_jaccard_pairs —  Jaccard similarity coefficient for given vertex pairs.
+
similarity_jaccard_pairs, igraph_similarity_jaccard_pairs —  Jaccard similarity coefficient for given vertex pairs.
 

-
simple_interconnected_islands_game, igraph_simple_interconnected_islands_game —  Generates a random graph made of several interconnected islands, each island being a random graph.
+
simple_interconnected_islands_game, igraph_simple_interconnected_islands_game —  Generates a random graph made of several interconnected islands, each island being a random graph.
 

-
simplify, igraph_simplify —  Removes loop and/or multiple edges from the graph.
+
simplify, igraph_simplify —  Removes loop and/or multiple edges from the graph.
 

-
simplify_and_colorize, igraph_simplify_and_colorize —  Simplify the graph and compute self-loop and edge multiplicities.
+
simplify_and_colorize, igraph_simplify_and_colorize —  Simplify the graph and compute self-loop and edge multiplicities.
 

-
sir, igraph_sir —  Performs a number of SIR epidemics model runs on a graph.
+
sir, igraph_sir —  Performs a number of SIR epidemics model runs on a graph.
 

-
sir_destroy, igraph_sir_destroy —  Deallocates memory associated with a SIR simulation run.
+
sir_destroy, igraph_sir_destroy —  Deallocates memory associated with a SIR simulation run.
 

-
sir_t, igraph_sir_t —  The result of one SIR model simulation.
+
sir_t, igraph_sir_t —  The result of one SIR model simulation.
 

-
small, igraph_small —  Shorthand to create a small graph, giving the edges as arguments.
+
small, igraph_small —  Shorthand to create a small graph, giving the edges as arguments.
 

-
spanner, igraph_spanner —  Calculates a spanner of a graph with a given stretch factor.
+
spanner, igraph_spanner —  Calculates a spanner of a graph with a given stretch factor.
 

-
sparsemat, igraph_sparsemat —  Creates an igraph graph from a sparse matrix.
+
sparsemat, igraph_sparsemat —  Creates an igraph graph from a sparse matrix.
 

-
sparsemat_add, igraph_sparsemat_add —  Sum of two sparse matrices.
+
sparsemat_add, igraph_sparsemat_add —  Sum of two sparse matrices.
 

-
sparsemat_add_cols, igraph_sparsemat_add_cols —  Adds columns to a sparse matrix.
+
sparsemat_add_cols, igraph_sparsemat_add_cols —  Adds columns to a sparse matrix.
 

-
sparsemat_add_rows, igraph_sparsemat_add_rows —  Adds rows to a sparse matrix.
+
sparsemat_add_rows, igraph_sparsemat_add_rows —  Adds rows to a sparse matrix.
 

-
sparsemat_arpack_rnsolve, igraph_sparsemat_arpack_rnsolve —  Eigenvalues and eigenvectors of a nonsymmetric sparse matrix via ARPACK.
+
sparsemat_arpack_rnsolve, igraph_sparsemat_arpack_rnsolve —  Eigenvalues and eigenvectors of a nonsymmetric sparse matrix via ARPACK.
 

-
sparsemat_arpack_rssolve, igraph_sparsemat_arpack_rssolve —  Eigenvalues and eigenvectors of a symmetric sparse matrix via ARPACK.
+
sparsemat_arpack_rssolve, igraph_sparsemat_arpack_rssolve —  Eigenvalues and eigenvectors of a symmetric sparse matrix via ARPACK.
 

-
sparsemat_as_matrix, igraph_sparsemat_as_matrix —  Converts a sparse matrix to a dense matrix.
+
sparsemat_as_matrix, igraph_sparsemat_as_matrix —  Converts a sparse matrix to a dense matrix.
 

-
sparsemat_cholsol, igraph_sparsemat_cholsol —  Solves a symmetric linear system via Cholesky decomposition.
+
sparsemat_cholsol, igraph_sparsemat_cholsol —  Solves a symmetric linear system via Cholesky decomposition.
 

-
sparsemat_colsums, igraph_sparsemat_colsums —  Column-wise sums.
+
sparsemat_colsums, igraph_sparsemat_colsums —  Column-wise sums.
 

-
sparsemat_compress, igraph_sparsemat_compress —  Converts a sparse matrix to column-compressed format.
+
sparsemat_compress, igraph_sparsemat_compress —  Converts a sparse matrix to column-compressed format.
 

-
sparsemat_copy, igraph_sparsemat_copy —  Copies a sparse matrix (deprecated alias).
+
sparsemat_copy, igraph_sparsemat_copy —  Copies a sparse matrix (deprecated alias).
 

-
sparsemat_count_nonzero, igraph_sparsemat_count_nonzero —  Counts nonzero elements of a sparse matrix.
+
sparsemat_count_nonzero, igraph_sparsemat_count_nonzero —  Counts nonzero elements of a sparse matrix.
 

-
sparsemat_count_nonzerotol, igraph_sparsemat_count_nonzerotol —  Counts nonzero elements of a sparse matrix, ignoring elements close to zero.
+
sparsemat_count_nonzerotol, igraph_sparsemat_count_nonzerotol —  Counts nonzero elements of a sparse matrix, ignoring elements close to zero.
 

-
sparsemat_destroy, igraph_sparsemat_destroy —  Deallocates memory used by a sparse matrix.
+
sparsemat_destroy, igraph_sparsemat_destroy —  Deallocates memory used by a sparse matrix.
 

-
sparsemat_diag, igraph_sparsemat_diag —  Creates a sparse diagonal matrix (deprecated alias).
+
sparsemat_diag, igraph_sparsemat_diag —  Creates a sparse diagonal matrix (deprecated alias).
 

-
sparsemat_droptol, igraph_sparsemat_droptol —  Drops the almost zero elements from a sparse matrix.
+
sparsemat_droptol, igraph_sparsemat_droptol —  Drops the almost zero elements from a sparse matrix.
 

-
sparsemat_dropzeros, igraph_sparsemat_dropzeros —  Drops the zero elements from a sparse matrix.
+
sparsemat_dropzeros, igraph_sparsemat_dropzeros —  Drops the zero elements from a sparse matrix.
 

-
sparsemat_dupl, igraph_sparsemat_dupl —  Removes duplicate elements from a sparse matrix.
+
sparsemat_dupl, igraph_sparsemat_dupl —  Removes duplicate elements from a sparse matrix.
 

-
sparsemat_entry, igraph_sparsemat_entry —  Adds an element to a sparse matrix.
+
sparsemat_entry, igraph_sparsemat_entry —  Adds an element to a sparse matrix.
 

-
sparsemat_eye, igraph_sparsemat_eye —  Creates a sparse identity matrix (deprecated alias).
+
sparsemat_eye, igraph_sparsemat_eye —  Creates a sparse identity matrix (deprecated alias).
 

-
sparsemat_fkeep, igraph_sparsemat_fkeep —  Filters the elements of a sparse matrix.
+
sparsemat_fkeep, igraph_sparsemat_fkeep —  Filters the elements of a sparse matrix.
 

-
sparsemat_gaxpy, igraph_sparsemat_gaxpy —  Matrix-vector product, added to another vector.
+
sparsemat_gaxpy, igraph_sparsemat_gaxpy —  Matrix-vector product, added to another vector.
 

-
sparsemat_get, igraph_sparsemat_get —  Return the value of a single element from a sparse matrix.
+
sparsemat_get, igraph_sparsemat_get —  Return the value of a single element from a sparse matrix.
 

-
sparsemat_getelements, igraph_sparsemat_getelements —  Returns all elements of a sparse matrix.
+
sparsemat_getelements, igraph_sparsemat_getelements —  Returns all elements of a sparse matrix.
 

-
sparsemat_getelements_sorted, igraph_sparsemat_getelements_sorted —  Returns all elements of a sparse matrix, sorted by row and column indices.
+
sparsemat_getelements_sorted, igraph_sparsemat_getelements_sorted —  Returns all elements of a sparse matrix, sorted by row and column indices.
 

-
sparsemat_index, igraph_sparsemat_index —  Extracts a submatrix or a single element.
+
sparsemat_index, igraph_sparsemat_index —  Extracts a submatrix or a single element.
 

-
sparsemat_init, igraph_sparsemat_init —  Initializes a sparse matrix, in triplet format.
+
sparsemat_init, igraph_sparsemat_init —  Initializes a sparse matrix, in triplet format.
 

-
sparsemat_init_copy, igraph_sparsemat_init_copy —  Copies a sparse matrix.
+
sparsemat_init_copy, igraph_sparsemat_init_copy —  Copies a sparse matrix.
 

-
sparsemat_init_diag, igraph_sparsemat_init_diag —  Creates a sparse diagonal matrix.
+
sparsemat_init_diag, igraph_sparsemat_init_diag —  Creates a sparse diagonal matrix.
 

-
sparsemat_init_eye, igraph_sparsemat_init_eye —  Creates a sparse identity matrix.
+
sparsemat_init_eye, igraph_sparsemat_init_eye —  Creates a sparse identity matrix.
 

-
sparsemat_is_cc, igraph_sparsemat_is_cc —  Is this sparse matrix in column-compressed format?
+
sparsemat_is_cc, igraph_sparsemat_is_cc —  Is this sparse matrix in column-compressed format?
 

-
sparsemat_is_symmetric, igraph_sparsemat_is_symmetric —  Returns whether a sparse matrix is symmetric.
+
sparsemat_is_symmetric, igraph_sparsemat_is_symmetric —  Returns whether a sparse matrix is symmetric.
 

-
sparsemat_is_triplet, igraph_sparsemat_is_triplet —  Is this sparse matrix in triplet format?
+
sparsemat_is_triplet, igraph_sparsemat_is_triplet —  Is this sparse matrix in triplet format?
 

-
sparsemat_iterator_col, igraph_sparsemat_iterator_col —  Return the column of the iterator.
+
sparsemat_iterator_col, igraph_sparsemat_iterator_col —  Return the column of the iterator.
 

-
sparsemat_iterator_end, igraph_sparsemat_iterator_end —  Query if the iterator is past the last element.
+
sparsemat_iterator_end, igraph_sparsemat_iterator_end —  Query if the iterator is past the last element.
 

-
sparsemat_iterator_get, igraph_sparsemat_iterator_get —  Return the element at the current iterator position.
+
sparsemat_iterator_get, igraph_sparsemat_iterator_get —  Return the element at the current iterator position.
 

-
sparsemat_iterator_idx, igraph_sparsemat_iterator_idx —  Returns the element vector index of a sparse matrix iterator.
+
sparsemat_iterator_idx, igraph_sparsemat_iterator_idx —  Returns the element vector index of a sparse matrix iterator.
 

-
sparsemat_iterator_init, igraph_sparsemat_iterator_init —  Initialize a sparse matrix iterator.
+
sparsemat_iterator_init, igraph_sparsemat_iterator_init —  Initialize a sparse matrix iterator.
 

-
sparsemat_iterator_next, igraph_sparsemat_iterator_next —  Let a sparse matrix iterator go to the next element.
+
sparsemat_iterator_next, igraph_sparsemat_iterator_next —  Let a sparse matrix iterator go to the next element.
 

-
sparsemat_iterator_reset, igraph_sparsemat_iterator_reset —  Reset a sparse matrix iterator to the first element.
+
sparsemat_iterator_reset, igraph_sparsemat_iterator_reset —  Reset a sparse matrix iterator to the first element.
 

-
sparsemat_iterator_row, igraph_sparsemat_iterator_row —  Return the row of the iterator.
+
sparsemat_iterator_row, igraph_sparsemat_iterator_row —  Return the row of the iterator.
 

-
sparsemat_lsolve, igraph_sparsemat_lsolve —  Solves a lower-triangular linear system.
+
sparsemat_lsolve, igraph_sparsemat_lsolve —  Solves a lower-triangular linear system.
 

-
sparsemat_ltsolve, igraph_sparsemat_ltsolve —  Solves an upper-triangular linear system.
+
sparsemat_ltsolve, igraph_sparsemat_ltsolve —  Solves an upper-triangular linear system.
 

-
sparsemat_lu, igraph_sparsemat_lu —  LU decomposition of a sparse matrix.
+
sparsemat_lu, igraph_sparsemat_lu —  LU decomposition of a sparse matrix.
 

-
sparsemat_luresol, igraph_sparsemat_luresol —  Solves a linear system using a precomputed LU decomposition.
+
sparsemat_luresol, igraph_sparsemat_luresol —  Solves a linear system using a precomputed LU decomposition.
 

-
sparsemat_lusol, igraph_sparsemat_lusol —  Solves a linear system via LU decomposition.
+
sparsemat_lusol, igraph_sparsemat_lusol —  Solves a linear system via LU decomposition.
 

-
sparsemat_max, igraph_sparsemat_max —  Maximum of a sparse matrix.
+
sparsemat_max, igraph_sparsemat_max —  Maximum of a sparse matrix.
 

-
sparsemat_min, igraph_sparsemat_min —  Minimum of a sparse matrix.
+
sparsemat_min, igraph_sparsemat_min —  Minimum of a sparse matrix.
 

-
sparsemat_minmax, igraph_sparsemat_minmax —  Minimum and maximum of a sparse matrix.
+
sparsemat_minmax, igraph_sparsemat_minmax —  Minimum and maximum of a sparse matrix.
 

-
sparsemat_multiply, igraph_sparsemat_multiply —  Matrix multiplication.
+
sparsemat_multiply, igraph_sparsemat_multiply —  Matrix multiplication.
 

-
sparsemat_ncol, igraph_sparsemat_ncol —  Number of columns.
+
sparsemat_ncol, igraph_sparsemat_ncol —  Number of columns.
 

-
sparsemat_nonzero_storage, igraph_sparsemat_nonzero_storage —  Returns number of stored entries of a sparse matrix.
+
sparsemat_nonzero_storage, igraph_sparsemat_nonzero_storage —  Returns number of stored entries of a sparse matrix.
 

-
sparsemat_nrow, igraph_sparsemat_nrow —  Number of rows.
+
sparsemat_nrow, igraph_sparsemat_nrow —  Number of rows.
 

-
sparsemat_numeric_destroy, igraph_sparsemat_numeric_destroy —  Deallocates memory after a numeric decomposition.
+
sparsemat_numeric_destroy, igraph_sparsemat_numeric_destroy —  Deallocates memory after a numeric decomposition.
 

-
sparsemat_permute, igraph_sparsemat_permute —  Permutes the rows and columns of a sparse matrix.
+
sparsemat_permute, igraph_sparsemat_permute —  Permutes the rows and columns of a sparse matrix.
 

-
sparsemat_print, igraph_sparsemat_print —  Prints a sparse matrix to a file.
+
sparsemat_print, igraph_sparsemat_print —  Prints a sparse matrix to a file.
 

-
sparsemat_qr, igraph_sparsemat_qr —  QR decomposition of a sparse matrix.
+
sparsemat_qr, igraph_sparsemat_qr —  QR decomposition of a sparse matrix.
 

-
sparsemat_qrresol, igraph_sparsemat_qrresol —  Solves a linear system using a precomputed QR decomposition.
+
sparsemat_qrresol, igraph_sparsemat_qrresol —  Solves a linear system using a precomputed QR decomposition.
 

-
sparsemat_realloc, igraph_sparsemat_realloc —  Allocates more (or less) memory for a sparse matrix.
+
sparsemat_realloc, igraph_sparsemat_realloc —  Allocates more (or less) memory for a sparse matrix.
 

-
sparsemat_resize, igraph_sparsemat_resize —  Resizes a sparse matrix and clears all the elements.
+
sparsemat_resize, igraph_sparsemat_resize —  Resizes a sparse matrix and clears all the elements.
 

-
sparsemat_rowsums, igraph_sparsemat_rowsums —  Row-wise sums.
+
sparsemat_rowsums, igraph_sparsemat_rowsums —  Row-wise sums.
 

-
sparsemat_scale, igraph_sparsemat_scale —  Scales a sparse matrix.
+
sparsemat_scale, igraph_sparsemat_scale —  Scales a sparse matrix.
 

-
sparsemat_sort, igraph_sparsemat_sort —  Sorts all elements of a sparse matrix by row and column indices.
+
sparsemat_sort, igraph_sparsemat_sort —  Sorts all elements of a sparse matrix by row and column indices.
 

-
sparsemat_symblu, igraph_sparsemat_symblu —  Symbolic LU decomposition.
+
sparsemat_symblu, igraph_sparsemat_symblu —  Symbolic LU decomposition.
 

-
sparsemat_symbolic_destroy, igraph_sparsemat_symbolic_destroy —  Deallocates memory after a symbolic decomposition.
+
sparsemat_symbolic_destroy, igraph_sparsemat_symbolic_destroy —  Deallocates memory after a symbolic decomposition.
 

-
sparsemat_symbqr, igraph_sparsemat_symbqr —  Symbolic QR decomposition.
+
sparsemat_symbqr, igraph_sparsemat_symbqr —  Symbolic QR decomposition.
 

-
sparsemat_transpose, igraph_sparsemat_transpose —  Transposes a sparse matrix.
+
sparsemat_transpose, igraph_sparsemat_transpose —  Transposes a sparse matrix.
 

-
sparsemat_type, igraph_sparsemat_type —  Type of a sparse matrix (triplet or column-compressed).
+
sparsemat_type, igraph_sparsemat_type —  Type of a sparse matrix (triplet or column-compressed).
 

-
sparsemat_usolve, igraph_sparsemat_usolve —  Solves an upper-triangular linear system.
+
sparsemat_usolve, igraph_sparsemat_usolve —  Solves an upper-triangular linear system.
 

-
sparsemat_utsolve, igraph_sparsemat_utsolve —  Solves a lower-triangular linear system.
+
sparsemat_utsolve, igraph_sparsemat_utsolve —  Solves a lower-triangular linear system.
 

-
sparsemat_view, igraph_sparsemat_view —  Initialize a sparse matrix and set all parameters.
+
sparsemat_view, igraph_sparsemat_view —  Initialize a sparse matrix and set all parameters.
 

-
sparse_adjacency, igraph_sparse_adjacency —  Creates a graph from a sparse adjacency matrix.
+
sparse_adjacency, igraph_sparse_adjacency —  Creates a graph from a sparse adjacency matrix.
 

-
sparse_weighted_adjacency, igraph_sparse_weighted_adjacency —  Creates a graph from a weighted sparse adjacency matrix.
+
sparse_weighted_adjacency, igraph_sparse_weighted_adjacency —  Creates a graph from a weighted sparse adjacency matrix.
 

-
split_join_distance, igraph_split_join_distance —  Calculates the split-join distance of two community structures.
+
split_join_distance, igraph_split_join_distance —  Calculates the split-join distance of two community structures.
 

-
square_lattice, igraph_square_lattice —  Arbitrary dimensional square lattices.
+
square_lattice, igraph_square_lattice —  Arbitrary dimensional square lattices.
 

-
stack_clear, igraph_stack_clear —  Removes all elements from a stack.
+
stack_clear, igraph_stack_clear —  Removes all elements from a stack.
 

-
stack_destroy, igraph_stack_destroy —  Destroys a stack object.
+
stack_destroy, igraph_stack_destroy —  Destroys a stack object.
 

-
stack_empty, igraph_stack_empty —  Decides whether a stack object is empty.
+
stack_empty, igraph_stack_empty —  Decides whether a stack object is empty.
 

-
stack_init, igraph_stack_init —  Initializes a stack.
+
stack_init, igraph_stack_init —  Initializes a stack.
 

-
stack_pop, igraph_stack_pop —  Removes and returns an element from the top of a stack.
+
stack_pop, igraph_stack_pop —  Removes and returns an element from the top of a stack.
 

-
stack_push, igraph_stack_push —  Places an element on the top of a stack.
+
stack_push, igraph_stack_push —  Places an element on the top of a stack.
 

-
stack_reserve, igraph_stack_reserve —  Reserve memory.
+
stack_reserve, igraph_stack_reserve —  Reserve memory.
 

-
stack_size, igraph_stack_size —  Returns the number of elements in a stack.
+
stack_size, igraph_stack_size —  Returns the number of elements in a stack.
 

-
stack_top, igraph_stack_top —  Query top element.
+
stack_top, igraph_stack_top —  Query top element.
 

-
star, igraph_star —  Creates a star graph, every vertex connects only to the center.
+
star, igraph_star —  Creates a star graph, every vertex connects only to the center.
 

-
static_fitness_game, igraph_static_fitness_game —  Non-growing random graph with edge probabilities proportional to node fitness scores.
+
static_fitness_game, igraph_static_fitness_game —  Non-growing random graph with edge probabilities proportional to node fitness scores.
 

-
static_power_law_game, igraph_static_power_law_game —  Generates a non-growing random graph with expected power-law degree distributions.
+
static_power_law_game, igraph_static_power_law_game —  Generates a non-growing random graph with expected power-law degree distributions.
 

-
STATUS, IGRAPH_STATUS — Report the status of an igraph function.
+
STATUS, IGRAPH_STATUS — Report the status of an igraph function.
 

-
status, igraph_status —  Reports status from an igraph function.
+
status, igraph_status —  Reports status from an igraph function.
 

-
STATUSF, IGRAPH_STATUSF — Report the status from an igraph function
+
STATUSF, IGRAPH_STATUSF — Report the status from an igraph function
 

-
statusf, igraph_statusf —  Report status, more flexible printf-like version.
+
statusf, igraph_statusf —  Report status, more flexible printf-like version.
 

-
status_handler_stderr, igraph_status_handler_stderr — A simple predefined status handler function.
+
status_handler_stderr, igraph_status_handler_stderr — A simple predefined status handler function.
 

-
status_handler_t, igraph_status_handler_t — The type of the igraph status handler functions
+
status_handler_t, igraph_status_handler_t — The type of the igraph status handler functions
 

-
stochastic_imitation, igraph_stochastic_imitation —  Adopt a strategy via stochastic imitation with uniform selection.
+
stochastic_imitation, igraph_stochastic_imitation —  Adopt a strategy via stochastic imitation with uniform selection.
 

-
STR, STR —  Indexing string vectors.
+
STR, STR —  Indexing string vectors.
 

-
strength, igraph_strength —  Strength of the vertices, also called weighted vertex degree.
+
strength, igraph_strength —  Strength of the vertices, also called weighted vertex degree.
 

 
strerror, igraph_strerror —  Textual description of an error.
 

-
strvector_add, igraph_strvector_add —  Adds an element to the back of a string vector (deprecated alias).
+
strvector_add, igraph_strvector_add —  Adds an element to the back of a string vector (deprecated alias).
 

-
strvector_append, igraph_strvector_append —  Concatenates two string vectors.
+
strvector_append, igraph_strvector_append —  Concatenates two string vectors.
 

-
strvector_capacity, igraph_strvector_capacity —  Returns the capacity of a string vector.
+
strvector_capacity, igraph_strvector_capacity —  Returns the capacity of a string vector.
 

-
strvector_clear, igraph_strvector_clear —  Removes all elements from a string vector.
+
strvector_clear, igraph_strvector_clear —  Removes all elements from a string vector.
 

-
strvector_copy, igraph_strvector_copy —  Initialization by copying (deprecated alias).
+
strvector_copy, igraph_strvector_copy —  Initialization by copying (deprecated alias).
 

-
strvector_destroy, igraph_strvector_destroy —  Frees the memory allocated for the string vector.
+
strvector_destroy, igraph_strvector_destroy —  Frees the memory allocated for the string vector.
 

-
strvector_get, igraph_strvector_get —  Retrieves an element of a string vector.
+
strvector_get, igraph_strvector_get —  Retrieves an element of a string vector.
 

-
strvector_init, igraph_strvector_init —  Initializes a string vector.
+
strvector_init, igraph_strvector_init —  Initializes a string vector.
 

-
strvector_init_copy, igraph_strvector_init_copy —  Initialization by copying.
+
strvector_init_copy, igraph_strvector_init_copy —  Initialization by copying.
 

-
strvector_merge, igraph_strvector_merge —  Moves the contents of a string vector to the end of another.
+
strvector_merge, igraph_strvector_merge —  Moves the contents of a string vector to the end of another.
 

-
strvector_push_back, igraph_strvector_push_back —  Adds an element to the back of a string vector.
+
strvector_push_back, igraph_strvector_push_back —  Adds an element to the back of a string vector.
 

-
strvector_push_back_len, igraph_strvector_push_back_len —  Adds a string of the given length to the back of a string vector.
+
strvector_push_back_len, igraph_strvector_push_back_len —  Adds a string of the given length to the back of a string vector.
 

-
strvector_remove, igraph_strvector_remove —  Removes a single element from a string vector.
+
strvector_remove, igraph_strvector_remove —  Removes a single element from a string vector.
 

-
strvector_remove_section, igraph_strvector_remove_section —  Removes a section from a string vector.
+
strvector_remove_section, igraph_strvector_remove_section —  Removes a section from a string vector.
 

-
strvector_reserve, igraph_strvector_reserve —  Reserves memory for a string vector.
+
strvector_reserve, igraph_strvector_reserve —  Reserves memory for a string vector.
 

-
strvector_resize, igraph_strvector_resize —  Resizes a string vector.
+
strvector_resize, igraph_strvector_resize —  Resizes a string vector.
 

-
strvector_resize_min, igraph_strvector_resize_min —  Deallocates the unused memory of a string vector.
+
strvector_resize_min, igraph_strvector_resize_min —  Deallocates the unused memory of a string vector.
 

-
strvector_set, igraph_strvector_set —  Sets an element of the string vector from a string.
+
strvector_set, igraph_strvector_set —  Sets an element of the string vector from a string.
 

-
strvector_set2, igraph_strvector_set2 —  Sets an element of the string vector given a buffer and its size (deprecated alias).
+
strvector_set2, igraph_strvector_set2 —  Sets an element of the string vector given a buffer and its size (deprecated alias).
 

-
strvector_set_len, igraph_strvector_set_len —  Sets an element of the string vector given a buffer and its size.
+
strvector_set_len, igraph_strvector_set_len —  Sets an element of the string vector given a buffer and its size.
 

-
strvector_size, igraph_strvector_size —  Returns the size of a string vector.
+
strvector_size, igraph_strvector_size —  Returns the size of a string vector.
 

-
st_edge_connectivity, igraph_st_edge_connectivity —  Edge connectivity of a pair of vertices.
+
st_edge_connectivity, igraph_st_edge_connectivity —  Edge connectivity of a pair of vertices.
 

-
st_mincut, igraph_st_mincut —  Minimum cut between a source and a target vertex.
+
st_mincut, igraph_st_mincut —  Minimum cut between a source and a target vertex.
 

-
st_mincut_value, igraph_st_mincut_value —  The minimum s-t cut in a graph.
+
st_mincut_value, igraph_st_mincut_value —  The minimum s-t cut in a graph.
 

-
st_vertex_connectivity, igraph_st_vertex_connectivity —  The vertex connectivity of a pair of vertices.
+
st_vertex_connectivity, igraph_st_vertex_connectivity —  The vertex connectivity of a pair of vertices.
 

-
subcomponent, igraph_subcomponent —  The vertices reachable from a given vertex.
+
subcomponent, igraph_subcomponent —  The vertices reachable from a given vertex.
 

-
subgraph_edges, igraph_subgraph_edges —  Creates a subgraph with the specified edges and their endpoints (deprecated alias).
+
subgraph_edges, igraph_subgraph_edges —  Creates a subgraph with the specified edges and their endpoints (deprecated alias).
 

-
subgraph_from_edges, igraph_subgraph_from_edges —  Creates a subgraph with the specified edges and their endpoints.
+
subgraph_from_edges, igraph_subgraph_from_edges —  Creates a subgraph with the specified edges and their endpoints.
 

-
subisomorphic, igraph_subisomorphic —  Decide subgraph isomorphism.
+
subisomorphic, igraph_subisomorphic —  Decide subgraph isomorphism.
 

-
subisomorphic_function_vf2, igraph_subisomorphic_function_vf2 —  Generic VF2 function for subgraph isomorphism problems (deprecated alias).
+
subisomorphic_function_vf2, igraph_subisomorphic_function_vf2 —  Generic VF2 function for subgraph isomorphism problems (deprecated alias).
 

-
subisomorphic_lad, igraph_subisomorphic_lad — Check subgraph isomorphism with the LAD algorithm
+
subisomorphic_lad, igraph_subisomorphic_lad — Check subgraph isomorphism with the LAD algorithm
 

-
subisomorphic_vf2, igraph_subisomorphic_vf2 — Decide subgraph isomorphism using VF2
+
subisomorphic_vf2, igraph_subisomorphic_vf2 — Decide subgraph isomorphism using VF2
 

-
symmetric_tree, igraph_symmetric_tree —  Creates a symmetric tree with the specified number of branches at each level.
+
symmetric_tree, igraph_symmetric_tree —  Creates a symmetric tree with the specified number of branches at each level.
 

 

 

 

 
T

 

-
THREAD_SAFE, IGRAPH_THREAD_SAFE — Specifies whether igraph was built in thread-safe mode.
+
THREAD_SAFE, IGRAPH_THREAD_SAFE — Specifies whether igraph was built in thread-safe mode.
 

 
TO, IGRAPH_TO —  The target vertex of an edge.
 

-
topological_sorting, igraph_topological_sorting —  Calculate a possible topological sorting of the graph.
+
topological_sorting, igraph_topological_sorting —  Calculate a possible topological sorting of the graph.
 

-
to_directed, igraph_to_directed —  Convert an undirected graph to a directed one.
+
to_directed, igraph_to_directed —  Convert an undirected graph to a directed one.
 

-
to_prufer, igraph_to_prufer —  Converts a tree to its Prüfer sequence.
+
to_prufer, igraph_to_prufer —  Converts a tree to its Prüfer sequence.
 

-
to_undirected, igraph_to_undirected —  Convert a directed graph to an undirected one.
+
to_undirected, igraph_to_undirected —  Convert a directed graph to an undirected one.
 

-
transitive_closure, igraph_transitive_closure —  Computes the transitive closure of a graph.
+
transitive_closure, igraph_transitive_closure —  Computes the transitive closure of a graph.
 

-
transitivity_avglocal_undirected, igraph_transitivity_avglocal_undirected —  Average local transitivity (clustering coefficient).
+
transitivity_avglocal_undirected, igraph_transitivity_avglocal_undirected —  Average local transitivity (clustering coefficient).
 

-
transitivity_barrat, igraph_transitivity_barrat —  Weighted local transitivity of some vertices, as defined by A. Barrat.
+
transitivity_barrat, igraph_transitivity_barrat —  Weighted local transitivity of some vertices, as defined by A. Barrat.
 

-
transitivity_local_undirected, igraph_transitivity_local_undirected —  The local transitivity (clustering coefficient) of some vertices.
+
transitivity_local_undirected, igraph_transitivity_local_undirected —  The local transitivity (clustering coefficient) of some vertices.
 

-
transitivity_undirected, igraph_transitivity_undirected —  Calculates the transitivity (clustering coefficient) of a graph.
+
transitivity_undirected, igraph_transitivity_undirected —  Calculates the transitivity (clustering coefficient) of a graph.
 

-
tree, igraph_tree —  Creates a k-ary tree in which almost all vertices have k children (deprecated alias).
+
tree, igraph_tree —  Creates a k-ary tree in which almost all vertices have k children (deprecated alias).
 

-
tree_from_parent_vector, igraph_tree_from_parent_vector —  Constructs a tree or forest from a vector encoding the parent of each vertex.
+
tree_from_parent_vector, igraph_tree_from_parent_vector —  Constructs a tree or forest from a vector encoding the parent of each vertex.
 

-
tree_game, igraph_tree_game —  Generates a random tree with the given number of nodes.
+
tree_game, igraph_tree_game —  Generates a random tree with the given number of nodes.
 

-
triad_census, igraph_triad_census —  Triad census, as defined by Davis and Leinhardt.
+
triad_census, igraph_triad_census —  Triad census, as defined by Davis and Leinhardt.
 

-
triangular_lattice, igraph_triangular_lattice —  A triangular lattice with the given shape.
+
triangular_lattice, igraph_triangular_lattice —  A triangular lattice with the given shape.
 

-
trussness, igraph_trussness —  Finding the "trussness" of the edges in a network.
+
trussness, igraph_trussness —  Finding the "trussness" of the edges in a network.
 

-
turan, igraph_turan —  Creates a Turán graph.
+
turan, igraph_turan —  Creates a Turán graph.
 

 

 

 

 
U

 

-
unfold_tree, igraph_unfold_tree —  Unfolding a graph into a tree, by possibly multiplicating its vertices.
+
unfold_tree, igraph_unfold_tree —  Unfolding a graph into a tree, by possibly multiplicating its vertices.
 

-
union, igraph_union —  Calculates the union of two graphs.
+
union, igraph_union —  Calculates the union of two graphs.
 

-
union_many, igraph_union_many —  Creates the union of many graphs.
+
union_many, igraph_union_many —  Creates the union of many graphs.
 

 

 

 

 
V

 

-
VAB, VAB — Query a boolean vertex attribute.
+
VAB, VAB — Query a boolean vertex attribute.
 

-
VABV, VABV — Query a boolean vertex attribute for all vertices.
+
VABV, VABV — Query a boolean vertex attribute for all vertices.
 

-
VAN, VAN — Query a numeric vertex attribute.
+
VAN, VAN — Query a numeric vertex attribute.
 

-
VANV, VANV — Query a numeric vertex attribute for all vertices.
+
VANV, VANV — Query a numeric vertex attribute for all vertices.
 

-
VAS, VAS — Query a string vertex attribute.
+
VAS, VAS — Query a string vertex attribute.
 

-
VASV, VASV — Query a string vertex attribute for all vertices.
+
VASV, VASV — Query a string vertex attribute for all vertices.
 

 
vcount, igraph_vcount —  The number of vertices in a graph.
 

@@ -2203,51 +2203,51 @@ 
V

 
 
vector_append, igraph_vector_append —  Append a vector to another one.
 

-
vector_binsearch, igraph_vector_binsearch —  Finds an element by binary searching a sorted vector.
+
vector_binsearch, igraph_vector_binsearch —  Finds an element by binary searching a sorted vector.
 

-
vector_binsearch2, igraph_vector_binsearch2 —  Binary search, without returning the index.
+
vector_binsearch2, igraph_vector_binsearch2 —  Binary search, without returning the index.
 

-
vector_binsearch_slice, igraph_vector_binsearch_slice —  Finds an element by binary searching a sorted slice of a vector.
+
vector_binsearch_slice, igraph_vector_binsearch_slice —  Finds an element by binary searching a sorted slice of a vector.
 

 
vector_capacity, igraph_vector_capacity —  Returns the allocated capacity of the vector.
 

-
vector_clear, igraph_vector_clear —  Removes all elements from a vector.
+
vector_clear, igraph_vector_clear —  Removes all elements from a vector.
 

 
vector_colex_cmp, igraph_vector_colex_cmp —  Colexicographical comparison of two vectors.
 

 
vector_colex_cmp_untyped, igraph_vector_colex_cmp_untyped —  Colexicographical comparison of two vectors.
 

-
vector_complex_all_almost_e, igraph_vector_complex_all_almost_e —  Are all elements almost equal?
+
vector_complex_all_almost_e, igraph_vector_complex_all_almost_e —  Are all elements almost equal?
 

-
vector_complex_create, igraph_vector_complex_create —  Creates a complex vector from a real and imaginary part.
+
vector_complex_create, igraph_vector_complex_create —  Creates a complex vector from a real and imaginary part.
 

-
vector_complex_create_polar, igraph_vector_complex_create_polar —  Creates a complex matrix from a magnitude and an angle.
+
vector_complex_create_polar, igraph_vector_complex_create_polar —  Creates a complex matrix from a magnitude and an angle.
 

-
vector_complex_imag, igraph_vector_complex_imag —  Gives the imaginary part of a complex vector.
+
vector_complex_imag, igraph_vector_complex_imag —  Gives the imaginary part of a complex vector.
 

-
vector_complex_real, igraph_vector_complex_real —  Gives the real part of a complex vector.
+
vector_complex_real, igraph_vector_complex_real —  Gives the real part of a complex vector.
 

-
vector_complex_realimag, igraph_vector_complex_realimag —  Gives the real and imaginary parts of a complex vector.
+
vector_complex_realimag, igraph_vector_complex_realimag —  Gives the real and imaginary parts of a complex vector.
 

-
vector_complex_zapsmall, igraph_vector_complex_zapsmall —  Replaces small elements of a complex vector by exact zeros.
+
vector_complex_zapsmall, igraph_vector_complex_zapsmall —  Replaces small elements of a complex vector by exact zeros.
 

-
vector_contains, igraph_vector_contains —  Linear search in a vector.
+
vector_contains, igraph_vector_contains —  Linear search in a vector.
 

-
vector_copy, igraph_vector_copy —  Initializes a vector from another vector object (deprecated alias).
+
vector_copy, igraph_vector_copy —  Initializes a vector from another vector object (deprecated alias).
 

 
vector_copy_to, igraph_vector_copy_to —  Copies the contents of a vector to a C array.
 

 
vector_destroy, igraph_vector_destroy —  Destroys a vector object.
 

-
vector_difference_sorted, igraph_vector_difference_sorted —  Set difference of two sorted vectors.
+
vector_difference_sorted, igraph_vector_difference_sorted —  Set difference of two sorted vectors.
 

 
vector_div, igraph_vector_div —  Divide a vector by another one.
 

-
vector_e, igraph_vector_e —  Access an element of a vector (deprecated alias).
+
vector_e, igraph_vector_e —  Access an element of a vector (deprecated alias).
 

 
vector_empty, igraph_vector_empty —  Decides whether the size of the vector is zero.
 

-
vector_e_ptr, igraph_vector_e_ptr —  Get the address of an element of a vector.
+
vector_e_ptr, igraph_vector_e_ptr —  Get the address of an element of a vector.
 

 
vector_fill, igraph_vector_fill —  Fill a vector with a constant element.
 

@@ -2265,87 +2265,87 @@ 
V

 
 
vector_init_range, igraph_vector_init_range —  Initializes a vector with a range.
 

-
vector_init_seq, igraph_vector_init_seq —  Initializes a vector with a sequence, inclusive endpoints (deprecated).
+
vector_init_seq, igraph_vector_init_seq —  Initializes a vector with a sequence, inclusive endpoints (deprecated).
 

-
vector_insert, igraph_vector_insert —  Inserts a single element into a vector.
+
vector_insert, igraph_vector_insert —  Inserts a single element into a vector.
 

-
vector_intersection_size_sorted, igraph_vector_intersection_size_sorted —  Intersection size of two sorted vectors.
+
vector_intersection_size_sorted, igraph_vector_intersection_size_sorted —  Intersection size of two sorted vectors.
 

-
vector_intersect_sorted, igraph_vector_intersect_sorted —  Set intersection of two sorted vectors.
+
vector_intersect_sorted, igraph_vector_intersect_sorted —  Set intersection of two sorted vectors.
 

-
vector_isininterval, igraph_vector_isininterval —  Checks if all elements of a vector are in the given interval.
+
vector_isininterval, igraph_vector_isininterval —  Checks if all elements of a vector are in the given interval.
 

-
vector_is_all_finite, igraph_vector_is_all_finite —  Check if all elements are finite.
+
vector_is_all_finite, igraph_vector_is_all_finite —  Check if all elements are finite.
 

-
vector_is_any_nan, igraph_vector_is_any_nan —  Check if any element is NaN.
+
vector_is_any_nan, igraph_vector_is_any_nan —  Check if any element is NaN.
 

-
vector_is_nan, igraph_vector_is_nan —  Check for each element if it is NaN.
+
vector_is_nan, igraph_vector_is_nan —  Check for each element if it is NaN.
 

 
vector_lex_cmp, igraph_vector_lex_cmp —  Lexicographical comparison of two vectors (type-safe variant).
 

 
vector_lex_cmp_untyped, igraph_vector_lex_cmp_untyped —  Lexicographical comparison of two vectors (non-type-safe).
 

-
vector_list_capacity, igraph_vector_list_capacity —  Returns the allocated capacity of the list.
+
vector_list_capacity, igraph_vector_list_capacity —  Returns the allocated capacity of the list.
 

-
vector_list_clear, igraph_vector_list_clear —  Removes all elements from a list of vectors.
+
vector_list_clear, igraph_vector_list_clear —  Removes all elements from a list of vectors.
 

-
vector_list_destroy, igraph_vector_list_destroy —  Destroys a list of vectors object.
+
vector_list_destroy, igraph_vector_list_destroy —  Destroys a list of vectors object.
 

-
vector_list_discard, igraph_vector_list_discard —  Discard the item at the given index in the vector list.
+
vector_list_discard, igraph_vector_list_discard —  Discards the item at the given index in the vector list.
 

-
vector_list_discard_back, igraph_vector_list_discard_back —  Discard the last item in the vector list.
+
vector_list_discard_back, igraph_vector_list_discard_back —  Discards the last item in the vector list.
 

-
vector_list_discard_fast, igraph_vector_list_discard_fast —  Discard the item at the given index in the vector list and move the last item to its place.
+
vector_list_discard_fast, igraph_vector_list_discard_fast —  Discards the item at the given index in the vector list and moves the last item to its place.
 

-
vector_list_empty, igraph_vector_list_empty —  Decides whether the size of the list is zero.
+
vector_list_empty, igraph_vector_list_empty —  Decides whether the size of the list is zero.
 

-
vector_list_get_ptr, igraph_vector_list_get_ptr —  Retrieve the address of a vector in the vector list.
+
vector_list_get_ptr, igraph_vector_list_get_ptr —  The address of a vector in the vector list.
 

-
vector_list_init, igraph_vector_list_init —  Initializes a list of vectors (constructor).
+
vector_list_init, igraph_vector_list_init —  Initializes a list of vectors (constructor).
 

-
vector_list_insert, igraph_vector_list_insert —  Insert an existing vector into the list, transferring ownership.
+
vector_list_insert, igraph_vector_list_insert —  Inserts an existing vector into the list, transferring ownership.
 

-
vector_list_insert_copy, igraph_vector_list_insert_copy —  Insert the copy of a vector to the list.
+
vector_list_insert_copy, igraph_vector_list_insert_copy —  Inserts the copy of a vector to the list.
 

-
vector_list_insert_new, igraph_vector_list_insert_new —  Insert a new vector into the list.
+
vector_list_insert_new, igraph_vector_list_insert_new —  Inserts a new vector into the list.
 

-
vector_list_permute, igraph_vector_list_permute —  Permutes the elements of a list in place according to an index vector.
+
vector_list_permute, igraph_vector_list_permute —  Permutes the elements of a list in place according to an index vector.
 

-
vector_list_pop_back, igraph_vector_list_pop_back —  Remove the last item from the vector list and transfer ownership to the caller.
+
vector_list_pop_back, igraph_vector_list_pop_back —  Removes the last item from the vector list and transfer ownership to the caller.
 

-
vector_list_push_back, igraph_vector_list_push_back —  Append an existing vector to the list, transferring ownership.
+
vector_list_push_back, igraph_vector_list_push_back —  Appends an existing vector to the list, transferring ownership.
 

-
vector_list_push_back_copy, igraph_vector_list_push_back_copy —  Append the copy of a vector to the list.
+
vector_list_push_back_copy, igraph_vector_list_push_back_copy —  Appends the copy of a vector to the list.
 

-
vector_list_push_back_new, igraph_vector_list_push_back_new —  Append a new vector to the list.
+
vector_list_push_back_new, igraph_vector_list_push_back_new —  Appends a new vector to the list.
 

-
vector_list_remove, igraph_vector_list_remove —  Remove the item at the given index from the vector list and transfer ownership to the caller.
+
vector_list_remove, igraph_vector_list_remove —  Removes the item at the given index from the vector list and transfer ownership to the caller.
 

-
vector_list_remove_fast, igraph_vector_list_remove_fast —  Remove the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.
+
vector_list_remove_fast, igraph_vector_list_remove_fast —  Removes the item at the given index in the vector list, move the last item to its place and transfer ownership to the caller.
 

-
vector_list_replace, igraph_vector_list_replace —  Replaces the vector at the given index in the list with another one.
+
vector_list_replace, igraph_vector_list_replace —  Replaces the vector at the given index in the list with another one.
 

-
vector_list_reserve, igraph_vector_list_reserve —  Reserves memory for a list.
+
vector_list_reserve, igraph_vector_list_reserve —  Reserves memory for a list.
 

-
vector_list_resize, igraph_vector_list_resize —  Resize the list of vectors.
+
vector_list_resize, igraph_vector_list_resize —  Resizes the list of vectors.
 

-
vector_list_set, igraph_vector_list_set —  Sets the vector at the given index in the list.
+
vector_list_set, igraph_vector_list_set —  Sets the vector at the given index in the list.
 

-
vector_list_size, igraph_vector_list_size —  Returns the size (=length) of the vector.
+
vector_list_size, igraph_vector_list_size —  The size of the vector list.
 

-
vector_list_sort, igraph_vector_list_sort —  Sorts the elements of the list into ascending order.
+
vector_list_sort, igraph_vector_list_sort —  Sorts the elements of the list into ascending order.
 

-
vector_list_sort_ind, igraph_vector_list_sort_ind —  Returns a permutation of indices that sorts the list.
+
vector_list_sort_ind, igraph_vector_list_sort_ind —  Returns a permutation of indices that sorts the list.
 

-
vector_list_swap, igraph_vector_list_swap —  Swaps all elements of two vector lists.
+
vector_list_swap, igraph_vector_list_swap —  Swaps all elements of two vector lists.
 

-
vector_list_swap_elements, igraph_vector_list_swap_elements —  Swap two elements in a vector list.
+
vector_list_swap_elements, igraph_vector_list_swap_elements —  Swap two elements in a vector list.
 

-
vector_list_tail_ptr, igraph_vector_list_tail_ptr —  Retrieve the address of the last vector in the vector list.
+
vector_list_tail_ptr, igraph_vector_list_tail_ptr —  The address of the last vector in the vector list.
 

 
vector_max, igraph_vector_max —  Largest element of a vector.
 

-
vector_maxdifference, igraph_vector_maxdifference —  The maximum absolute difference of m1 and m2.
+
vector_maxdifference, igraph_vector_maxdifference —  The maximum absolute difference of m1 and m2.
 

 
vector_min, igraph_vector_min —  Smallest element of a vector.
 

@@ -2357,83 +2357,83 @@ 
V

 
 
vector_permute, igraph_vector_permute —  Permutes the elements of a vector in place according to an index vector.
 

-
vector_pop_back, igraph_vector_pop_back —  Removes and returns the last element of a vector.
+
vector_pop_back, igraph_vector_pop_back —  Removes and returns the last element of a vector.
 

-
vector_prod, igraph_vector_prod —  Calculates the product of the elements in the vector.
+
vector_prod, igraph_vector_prod —  Calculates the product of the elements in the vector.
 

-
vector_ptr_clear, igraph_vector_ptr_clear —  Removes all elements from a pointer vector.
+
vector_ptr_clear, igraph_vector_ptr_clear —  Removes all elements from a pointer vector.
 

-
vector_ptr_copy, igraph_vector_ptr_copy —  Initializes a pointer vector from another one (deprecated alias).
+
vector_ptr_copy, igraph_vector_ptr_copy —  Initializes a pointer vector from another one (deprecated alias).
 

-
vector_ptr_destroy, igraph_vector_ptr_destroy —  Destroys a pointer vector.
+
vector_ptr_destroy, igraph_vector_ptr_destroy —  Destroys a pointer vector.
 

-
vector_ptr_destroy_all, igraph_vector_ptr_destroy_all —  Frees all the elements and destroys the pointer vector.
+
vector_ptr_destroy_all, igraph_vector_ptr_destroy_all —  Frees all the elements and destroys the pointer vector.
 

-
vector_ptr_e, igraph_vector_ptr_e —  Access an element of a pointer vector (deprecated alias).
+
vector_ptr_e, igraph_vector_ptr_e —  Access an element of a pointer vector (deprecated alias).
 

-
vector_ptr_free_all, igraph_vector_ptr_free_all —  Frees all the elements of a pointer vector.
+
vector_ptr_free_all, igraph_vector_ptr_free_all —  Frees all the elements of a pointer vector.
 

-
vector_ptr_get, igraph_vector_ptr_get —  Access an element of a pointer vector.
+
vector_ptr_get, igraph_vector_ptr_get —  Access an element of a pointer vector.
 

-
vector_ptr_get_item_destructor, igraph_vector_ptr_get_item_destructor —  Gets the current item destructor for this pointer vector.
+
vector_ptr_get_item_destructor, igraph_vector_ptr_get_item_destructor —  Gets the current item destructor for this pointer vector.
 

-
vector_ptr_init, igraph_vector_ptr_init —  Initialize a pointer vector (constructor).
+
vector_ptr_init, igraph_vector_ptr_init —  Initialize a pointer vector (constructor).
 

-
vector_ptr_init_copy, igraph_vector_ptr_init_copy —  Initializes a pointer vector from another one (constructor).
+
vector_ptr_init_copy, igraph_vector_ptr_init_copy —  Initializes a pointer vector from another one (constructor).
 

-
vector_ptr_insert, igraph_vector_ptr_insert —  Inserts a single element into a pointer vector.
+
vector_ptr_insert, igraph_vector_ptr_insert —  Inserts a single element into a pointer vector.
 

-
vector_ptr_permute, igraph_vector_ptr_permute —  Permutes the elements of a pointer vector in place according to an index vector.
+
vector_ptr_permute, igraph_vector_ptr_permute —  Permutes the elements of a pointer vector in place according to an index vector.
 

-
vector_ptr_pop_back, igraph_vector_ptr_pop_back —  Removes and returns the last element of a pointer vector.
+
vector_ptr_pop_back, igraph_vector_ptr_pop_back —  Removes and returns the last element of a pointer vector.
 

-
vector_ptr_push_back, igraph_vector_ptr_push_back —  Appends an element to the back of a pointer vector.
+
vector_ptr_push_back, igraph_vector_ptr_push_back —  Appends an element to the back of a pointer vector.
 

-
vector_ptr_resize, igraph_vector_ptr_resize —  Resizes a pointer vector.
+
vector_ptr_resize, igraph_vector_ptr_resize —  Resizes a pointer vector.
 

-
vector_ptr_set, igraph_vector_ptr_set —  Assign to an element of a pointer vector.
+
vector_ptr_set, igraph_vector_ptr_set —  Assign to an element of a pointer vector.
 

-
vector_ptr_set_item_destructor, igraph_vector_ptr_set_item_destructor —  Sets the item destructor for this pointer vector.
+
vector_ptr_set_item_destructor, igraph_vector_ptr_set_item_destructor —  Sets the item destructor for this pointer vector.
 

-
VECTOR_PTR_SET_ITEM_DESTRUCTOR, IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR —  Sets the item destructor for this pointer vector (macro version).
+
VECTOR_PTR_SET_ITEM_DESTRUCTOR, IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR —  Sets the item destructor for this pointer vector (macro version).
 

-
vector_ptr_size, igraph_vector_ptr_size —  Gives the number of elements in the pointer vector.
+
vector_ptr_size, igraph_vector_ptr_size —  Gives the number of elements in the pointer vector.
 

-
vector_ptr_sort, igraph_vector_ptr_sort —  Sorts the pointer vector based on an external comparison function.
+
vector_ptr_sort, igraph_vector_ptr_sort —  Sorts the pointer vector based on an external comparison function.
 

-
vector_ptr_sort_ind, igraph_vector_ptr_sort_ind —  Returns a permutation of indices that sorts a vector of pointers.
+
vector_ptr_sort_ind, igraph_vector_ptr_sort_ind —  Returns a permutation of indices that sorts a vector of pointers.
 

-
vector_push_back, igraph_vector_push_back —  Appends one element to a vector.
+
vector_push_back, igraph_vector_push_back —  Appends one element to a vector.
 

-
vector_qsort_ind, igraph_vector_qsort_ind —  Returns a permutation of indices that sorts a vector.
+
vector_qsort_ind, igraph_vector_qsort_ind —  Returns a permutation of indices that sorts a vector.
 

 
vector_range, igraph_vector_range —  Updates a vector to store a range.
 

-
vector_remove, igraph_vector_remove —  Removes a single element from a vector.
+
vector_remove, igraph_vector_remove —  Removes a single element from a vector.
 

-
vector_remove_section, igraph_vector_remove_section —  Deletes a section from a vector.
+
vector_remove_section, igraph_vector_remove_section —  Deletes a section from a vector.
 

-
vector_reserve, igraph_vector_reserve —  Reserves memory for a vector.
+
vector_reserve, igraph_vector_reserve —  Reserves memory for a vector.
 

-
vector_resize, igraph_vector_resize —  Resize the vector.
+
vector_resize, igraph_vector_resize —  Resize the vector.
 

-
vector_resize_min, igraph_vector_resize_min —  Deallocate the unused memory of a vector.
+
vector_resize_min, igraph_vector_resize_min —  Deallocate the unused memory of a vector.
 

 
vector_reverse, igraph_vector_reverse —  Reverse the elements of a vector.
 

-
vector_reverse_sort, igraph_vector_reverse_sort —  Sorts the elements of the vector into descending order.
+
vector_reverse_sort, igraph_vector_reverse_sort —  Sorts the elements of the vector into descending order.
 

 
vector_scale, igraph_vector_scale —  Multiplies all elements of a vector by a constant.
 

-
vector_search, igraph_vector_search —  Searches in a vector from a given position.
+
vector_search, igraph_vector_search —  Searches in a vector from a given position.
 

 
vector_set, igraph_vector_set —  Assignment to an element of a vector.
 

 
vector_shuffle, igraph_vector_shuffle —  Shuffles a vector in-place using the Fisher-Yates method.
 

-
vector_size, igraph_vector_size —  Returns the size (=length) of the vector.
+
vector_size, igraph_vector_size —  The size of the vector.
 

-
vector_sort, igraph_vector_sort —  Sorts the elements of the vector into ascending order.
+
vector_sort, igraph_vector_sort —  Sorts the elements of the vector into ascending order.
 

 
vector_sub, igraph_vector_sub —  Subtract a vector from another one.
 

@@ -2457,73 +2457,73 @@ 
V

 
 
vector_zapsmall, igraph_vector_zapsmall —  Replaces small elements of a vector by exact zeros.
 

-
version, igraph_version —  The version of the igraph C library.
+
version, igraph_version —  The version of the igraph C library.
 

-
vertex_coloring_greedy, igraph_vertex_coloring_greedy —  Computes a vertex coloring using a greedy algorithm.
+
vertex_coloring_greedy, igraph_vertex_coloring_greedy —  Computes a vertex coloring using a greedy algorithm.
 

-
vertex_connectivity, igraph_vertex_connectivity —  The vertex connectivity of a graph.
+
vertex_connectivity, igraph_vertex_connectivity —  The vertex connectivity of a graph.
 

-
vertex_disjoint_paths, igraph_vertex_disjoint_paths —  Maximum number of vertex-disjoint paths between two vertices.
+
vertex_disjoint_paths, igraph_vertex_disjoint_paths —  Maximum number of vertex-disjoint paths between two vertices.
 

-
vertex_path_from_edge_path, igraph_vertex_path_from_edge_path —  Converts a path of edge IDs to the traversed vertex IDs.
+
vertex_path_from_edge_path, igraph_vertex_path_from_edge_path —  Converts a path of edge IDs to the traversed vertex IDs.
 

-
vit_create, igraph_vit_create —  Creates a vertex iterator from a vertex selector.
+
vit_create, igraph_vit_create —  Creates a vertex iterator from a vertex selector.
 

-
vit_destroy, igraph_vit_destroy —  Destroys a vertex iterator.
+
vit_destroy, igraph_vit_destroy —  Destroys a vertex iterator.
 

-
VIT_END, IGRAPH_VIT_END —  Are we at the end?
+
VIT_END, IGRAPH_VIT_END —  Are we at the end?
 

-
VIT_GET, IGRAPH_VIT_GET —  Query the current position.
+
VIT_GET, IGRAPH_VIT_GET —  Query the current position.
 

-
VIT_NEXT, IGRAPH_VIT_NEXT —  Next vertex.
+
VIT_NEXT, IGRAPH_VIT_NEXT —  Next vertex.
 

-
VIT_RESET, IGRAPH_VIT_RESET —  Reset a vertex iterator.
+
VIT_RESET, IGRAPH_VIT_RESET —  Reset a vertex iterator.
 

-
VIT_SIZE, IGRAPH_VIT_SIZE —  Size of a vertex iterator.
+
VIT_SIZE, IGRAPH_VIT_SIZE —  Size of a vertex iterator.
 

-
voronoi, igraph_voronoi —  Voronoi partitioning of a graph.
+
voronoi, igraph_voronoi —  Voronoi partitioning of a graph.
 

-
vss_1, igraph_vss_1 —  Vertex set with a single vertex (immediate version).
+
vss_1, igraph_vss_1 —  Vertex set with a single vertex (immediate version).
 

-
vss_all, igraph_vss_all —  All vertices of a graph (immediate version).
+
vss_all, igraph_vss_all —  All vertices of a graph (immediate version).
 

-
vss_none, igraph_vss_none —  Empty vertex set (immediate version).
+
vss_none, igraph_vss_none —  Empty vertex set (immediate version).
 

-
vss_range, igraph_vss_range —  An interval of vertices (immediate version).
+
vss_range, igraph_vss_range —  An interval of vertices (immediate version).
 

-
vss_seq, igraph_vss_seq —  An interval of vertices with inclusive endpoints (immediate version, deprecated).
+
vss_seq, igraph_vss_seq —  An interval of vertices with inclusive endpoints (immediate version, deprecated).
 

-
vss_vector, igraph_vss_vector —  Vertex set based on a vector (immediate version).
+
vss_vector, igraph_vss_vector —  Vertex set based on a vector (immediate version).
 

-
vs_1, igraph_vs_1 —  Vertex set with a single vertex.
+
vs_1, igraph_vs_1 —  Vertex set with a single vertex.
 

-
vs_adj, igraph_vs_adj —  Adjacent vertices of a vertex.
+
vs_adj, igraph_vs_adj —  Adjacent vertices of a vertex.
 

-
vs_all, igraph_vs_all —  Vertex set, all vertices of a graph.
+
vs_all, igraph_vs_all —  Vertex set, all vertices of a graph.
 

-
vs_copy, igraph_vs_copy —  Creates a copy of a vertex selector.
+
vs_copy, igraph_vs_copy —  Creates a copy of a vertex selector.
 

-
vs_destroy, igraph_vs_destroy —  Destroy a vertex set.
+
vs_destroy, igraph_vs_destroy —  Destroy a vertex set.
 

-
vs_is_all, igraph_vs_is_all —  Check whether all vertices are included.
+
vs_is_all, igraph_vs_is_all —  Check whether all vertices are included.
 

-
vs_nonadj, igraph_vs_nonadj —  Non-adjacent vertices of a vertex.
+
vs_nonadj, igraph_vs_nonadj —  Non-adjacent vertices of a vertex.
 

-
vs_none, igraph_vs_none —  Empty vertex set.
+
vs_none, igraph_vs_none —  Empty vertex set.
 

-
vs_range, igraph_vs_range —  Vertex set, an interval of vertices.
+
vs_range, igraph_vs_range —  Vertex set, an interval of vertices.
 

-
vs_seq, igraph_vs_seq —  Vertex set, an interval of vertices with inclusive endpoints (deprecated).
+
vs_seq, igraph_vs_seq —  Vertex set, an interval of vertices with inclusive endpoints (deprecated).
 

-
vs_size, igraph_vs_size —  Returns the size of the vertex selector.
+
vs_size, igraph_vs_size —  Returns the size of the vertex selector.
 

-
vs_type, igraph_vs_type —  Returns the type of the vertex selector.
+
vs_type, igraph_vs_type —  Returns the type of the vertex selector.
 

-
vs_vector, igraph_vs_vector —  Vertex set based on a vector.
+
vs_vector, igraph_vs_vector —  Vertex set based on a vector.
 

-
vs_vector_copy, igraph_vs_vector_copy —  Vertex set based on a vector, with copying.
+
vs_vector_copy, igraph_vs_vector_copy —  Vertex set based on a vector, with copying.
 

-
vs_vector_small, igraph_vs_vector_small —  Create a vertex set by giving its elements.
+
vs_vector_small, igraph_vs_vector_small —  Create a vertex set by giving its elements.
 

 

 

@@ -2544,39 +2544,39 @@ 
W

 
 
warning_handler_t, igraph_warning_handler_t —  The type of igraph warning handler functions.
 

-
watts_strogatz_game, igraph_watts_strogatz_game —  The Watts-Strogatz small-world model.
+
watts_strogatz_game, igraph_watts_strogatz_game —  The Watts-Strogatz small-world model.
 

-
weighted_adjacency, igraph_weighted_adjacency —  Creates a graph from a weighted adjacency matrix.
+
weighted_adjacency, igraph_weighted_adjacency —  Creates a graph from a weighted adjacency matrix.
 

-
weighted_cliques, igraph_weighted_cliques —  Finds all cliques in a given weight range in a vertex weighted graph.
+
weighted_cliques, igraph_weighted_cliques —  Finds all cliques in a given weight range in a vertex weighted graph.
 

-
weighted_clique_number, igraph_weighted_clique_number —  Finds the weight of the largest weight clique in the graph.
+
weighted_clique_number, igraph_weighted_clique_number —  Finds the weight of the largest weight clique in the graph.
 

-
wheel, igraph_wheel —  Creates a wheel graph, a union of a star and a cycle graph.
+
wheel, igraph_wheel —  Creates a wheel graph, a union of a star and a cycle graph.
 

-
widest_path_widths_dijkstra, igraph_widest_path_widths_dijkstra —  Widths of widest paths between vertices.
+
widest_path_widths_dijkstra, igraph_widest_path_widths_dijkstra —  Widths of widest paths between vertices.
 

-
widest_path_widths_floyd_warshall, igraph_widest_path_widths_floyd_warshall —  Widths of widest paths between vertices.
+
widest_path_widths_floyd_warshall, igraph_widest_path_widths_floyd_warshall —  Widths of widest paths between vertices.
 

-
write_graph_dimacs, igraph_write_graph_dimacs —  Write a graph in DIMACS format (deprecated alias).
+
write_graph_dimacs, igraph_write_graph_dimacs —  Write a graph in DIMACS format (deprecated alias).
 

-
write_graph_dimacs_flow, igraph_write_graph_dimacs_flow —  Write a graph in DIMACS format.
+
write_graph_dimacs_flow, igraph_write_graph_dimacs_flow —  Write a graph in DIMACS format.
 

-
write_graph_dot, igraph_write_graph_dot —  Write the graph to a stream in DOT format.
+
write_graph_dot, igraph_write_graph_dot —  Write the graph to a stream in DOT format.
 

-
write_graph_edgelist, igraph_write_graph_edgelist —  Writes the edge list of a graph to a file.
+
write_graph_edgelist, igraph_write_graph_edgelist —  Writes the edge list of a graph to a file.
 

-
write_graph_gml, igraph_write_graph_gml —  Write the graph to a stream in GML format.
+
write_graph_gml, igraph_write_graph_gml —  Write the graph to a stream in GML format.
 

-
write_graph_graphml, igraph_write_graph_graphml —  Writes the graph to a file in GraphML format.
+
write_graph_graphml, igraph_write_graph_graphml —  Writes the graph to a file in GraphML format.
 

-
write_graph_leda, igraph_write_graph_leda —  Write a graph in LEDA native graph format.
+
write_graph_leda, igraph_write_graph_leda —  Write a graph in LEDA native graph format.
 

-
write_graph_lgl, igraph_write_graph_lgl —  Writes the graph to a file in .lgl format.
+
write_graph_lgl, igraph_write_graph_lgl —  Writes the graph to a file in .lgl format.
 

-
write_graph_ncol, igraph_write_graph_ncol —  Writes the graph to a file in .ncol format.
+
write_graph_ncol, igraph_write_graph_ncol —  Writes the graph to a file in .ncol format.
 

-
write_graph_pajek, igraph_write_graph_pajek —  Writes a graph to a file in Pajek format.
+
write_graph_pajek, igraph_write_graph_pajek —  Writes a graph to a file in Pajek format.
 

 

 

diff --git a/docs/sitemap.xml b/docs/sitemap.xml
index dc2a4aa12..4a71c6edf 100644
--- a/docs/sitemap.xml
+++ b/docs/sitemap.xml
@@ -18870,99 +18870,99 @@
 
 
 https://igraph.org/c/pdf/0.10.0/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.1/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.10/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.11/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.12/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.13/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.2/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.3/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.4/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.5/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.6/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.7/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.8/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.10.9/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.9.0/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.9.10/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.9.4/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.9.5/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.9.6/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.9.7/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.9.8/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/0.9.9/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/develop/igraph-docs.pdf
-2024-06-28T12:18:16+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/c/pdf/master/igraph-docs.pdf
-2024-06-28T12:18:17+02:00
+2024-07-08T11:27:23+02:00
 
 
 https://igraph.org/python/tutorial/0.9.10/search.html