Add layout to graph
Find Bonacich alpha centrality scores of network positions
The igraph package
Edges of a graph
Vertices of a graph
Adjacent vertices of multiple vertices in a graph
Add edges to a graph
Add vertices to a graph
Are two vertices adjacent?
List all simple paths from one source
ARPACK eigenvector calculation
Conversion to igraph
Convert between directed and undirected graphs
Convert a graph to an adjacency matrix
Convert a graph to an edge list
Convert a vertex or edge sequence to an ordinary vector
Assortativity coefficient
Convert a graph to a long data frame
Convert igraph graphs to graphNEL objects from the graph package
Declare a numeric vector as a membership vector
Incidence matrix of a bipartite graph
Convert igraph objects to adjacency or edge list matrices
Articulation points and bridges of a graph
Adjacency lists
Centralize a graph according to the betweenness of vertices
Number of automorphisms
Decide whether a graph is bipartite
Vertex and edge betweenness centrality
Project a bipartite graph
Canonical permutation of a graph
Theoretical maximum for betweenness centralization
Palette for categories
Community structure via greedy optimization of modularity
cluster_fluid_communities
Community detection algorithm based on interacting fluids
Closeness centrality of vertices
Functions to find cliques, ie. complete subgraphs in a graph
Theoretical maximum for closeness centralization
Centralize a graph according to the closeness of vertices
Centralization of a graph
Centralize a graph according to the degrees of vertices
Generating set of the automorphism group of a graph
Kleinberg's authority centrality scores.
Finding communities in graphs based on statistical meachanics
Community structure detection based on edge betweenness
Concatenate edge sequences
Concatenate vertex sequences
Breadth-first search
Cocitation coupling
Biconnected components
Finding community structure by multi-level optimization of modularity
Burt's constraint
Community structure via short random walks
Calculate Cohesive Blocks
Optimal community structure
Component-wise layout
Complementer of a graph
Contract several vertices into a single one
Delete an edge attribute
Degree and degree distribution of the vertices
Centralize a graph according to the eigenvector centrality of vertices
Theoretical maximum for degree centralization
.extract_constructor_and_modifiers
Takes an argument list and extracts the constructor specification and
constructor modifiers from it.
Delete a graph attribute
Delete edges from a graph
Theoretical maximum for betweenness centralization
Connected components of a graph
Dyad census of a graph
Compose two graphs as binary relations
Find triangles in graphs
count_subgraph_isomorphisms
Count the isomorphic mappings between a graph and the subgraphs of
another graph
Community structure detecting based on the leading eigenvector of the
community matrix
Finding community structure of a graph using the Leiden algorithm of Traag,
van Eck & Waltman.
Difference of edge sequences
Count the number of isomorphic mappings between two graphs
Depth-first search
Graph motifs
Difference of two sets
Incident vertices of some graph edges
Generate random graphs according to the Erdos-Renyi model
Convert graphNEL objects from the graph package to igraph
Load a graph from the graph database for testing graph isomorphism.
Create a consensus tree from several hierarchical random graph models
Edge connectivity.
Difference of graphs
Dominator tree
Graph diversity
Difference of vertex sequences
The igraph console
Diameter of a graph
Graph density
List names of edge attributes
Query edge attributes of a graph
.data
and .env
pronouns
Applies a set of constructor modifiers to an already constructed graph.
Finding a feedback arc set in a graph
Fit a hierarchical random graph model
Creating igraph graphs from data frames or vice-versa
Decompose a graph into components
Optimal edge curvature when plotting graphs
Order (number of vertices) of a graph
Infomap community finding
Create a graph from an edge list matrix
Get the id of a graph
Create an igraph graph from a hierarchical random graph model
Create a hierarchical random graph from an igraph graph
Query or set attributes of the vertices in a vertex sequence
Indexing vertex sequences
Delete a vertex attribute
Finding communities based on propagating labels
igraph data structure versions
Shortest (directed or undirected) paths between vertices
Delete vertices from a graph
Diverging palette
Convert object to a graph
Parameters for the igraph package
Run package tests
graph_from_incidence_matrix
Create graphs from an incidence matrix
Helper function for adding and deleting edges
Check if a degree sequence is valid for a multi-graph
Eccentricity of the vertices in a graph
Rewires the endpoints of the edges of a graph to a random vertex
Compares community structures using various metrics
Functions to deal with the result of network community detection
Girth of a graph
Check whether a graph is directed
Convex hull of a set of vertices
K-core decomposition of graphs
Set one or more edge attributes
igraph-attribute-combination
How igraph functions handle attributes when the graph changes
Head of the edge(s) in a graph
Find Eulerian paths or cycles in a graph
Spectral Embedding of the Laplacian of a Graph
Spectral Embedding of Adjacency Matrices
Getting and setting graph attributes, shortcut
Efficiency of a graph
Incident edges of a vertex in a graph
Query igraph's version string
graph_from_isomorphism_class
Create a graph from an isomorphism class
graph_from_adjacency_matrix
Create graphs from adjacency matrices
Calculate all isomorphic mappings between the vertices of two graphs
Independent vertex sets
Graph attributes of a graph
Set all or some graph attributes
Disjoint union of graphs
Dimensionality selection for singular values using profile likelihood.
Is a degree sequence graphical?
Is this object an igraph graph?
Graphlet decomposition of a graph
Deprecated layout functions
Graph Laplacian
Greedy vertex coloring
Graph layouts
SVD layout, this was removed from igraph
Create a graph from the Graph Atlas
The Fruchterman-Reingold layout algorithm
The Davidson-Harel layout algorithm
The DrL graph layout generator
Find Eigenvector Centrality Scores of Network Positions
Neighborhood of graph vertices
Fitting a power-law distribution function to discrete data
Find the edge ids based on the incident vertices of the edges
List names of graph attributes
Create graphs from adjacency lists
Query or set attributes of the edges in an edge sequence
Indexing edge sequences
De Bruijn graphs
A graph with no edges
Print the only the head of an R object
Hierarchical random graphs
Decide if two graphs are identical
Kleinberg's hub centrality scores.
Harmonic centrality of vertices
Common handler for vertex type arguments in igraph functions
Creating (small) graphs via a simple interface
Creating a graph from LCF notation
The GEM layout algorithm
The size of the graph (number of edges)
Groups of a vertex partitioning
Select edges and show their metadata
Incident edges of multiple vertices in a graph
Delete vertices or edges from a graph
Indent a printout
Select vertices and show their metadata
Create a ring graph
Create a star graph, a tree with n vertices and n - 1 leaves
Run igraph demos, step by step
Directed acyclic graphs
Make a new graph
Chordality of a graph
Create a bipartite graph
Minimal vertex separators
Named graphs
Is this a printer callback?
Intersection of two or more sets
Vertex separators
Intersection of graphs
Graph matching
Create a complete (full) citation graph
layout.fruchterman.reingold.grid
Grid Fruchterman-Reingold layout, this was removed from igraph
Minimum size vertex separators
Create a full graph
Intersection of edge sequences
Modularity of a community structure of a graph
Spring layout, this was removed from igraph
Choose an appropriate graph layout algorithm automatically
Isomorphism class of a graph
Maximum cardinality search
Decide if two graphs are isomorphic
Simple grid layout
Intersection of vertex sequences
The Reingold-Tilford graph layout algorithm
Normalize layout
Normalize coordinates for plotting graphs
Average nearest neighbor degree
Generate coordinates to place the vertices of a graph in a star-shape
Graph rewiring while preserving the degree distribution
Simple two-row layout for bipartite graphs
Weighted graphs
Decide whether a graph is a tree.
Graph layout with vertices on a circle.
Graph layout with vertices on the surface of a sphere
Randomly place vertices on a plane or in 3d space
Generate random graphs with a given degree sequence
The Sugiyama graph layout generator
Compute local scan statistics on graphs
Create a lattice graph
Line graph of a graph
Creates a communities object.
Create an extended chordal ring graph
Sample from a Dirichlet distribution
Neighboring (adjacent) vertices in a graph
Create an igraph graph from a list of edges, or a notable graph
Sample the hierarchical stochastic block model
Replicate a graph multiple times
Query and download from the Nexus network repository
Reciprocity of graphs
Sample from a hierarchical random graph model
Random walk on a graph
Graph motifs
Maximum flow in a graph
Merging graph layouts
Kautz graphs
Minimum spanning tree
Plotting the results on multiple SIR model runs
Print an edge sequence to the screen
Print graphs to the terminal
Sample trees randomly and uniformly
make_full_bipartite_graph
Create a full bipartite graph
Create an undirected tree graph from its Prufer sequence
Scan statistics on a time series of graphs
Constructor modifier to drop multiple edges
Sample from a random graph model
Reading foreign file formats
Add vertices, edges or another graph to a graph
plot_dendrogram.igraphHRG
HRG dendrogram plot
The graphopt layout algorithm
The Kamada-Kawai layout algorithm
Bipartite random graphs
Creating a graph from a given degree sequence, deterministically
Forest Fire Network Model
Scale-free random graphs, from vertex fitness scores
Random citation graphs
Set vertex attributes
Graph motifs
Set one or more vertex attributes
Sample vectors uniformly from the volume of a sphere
Radius of a graph
Graph generation based on different vertex types
Minimum size vertex separators
Minimum cut in a graph
Magrittr's pipes
Permute the vertices of a graph
Reverse edges in a graph
The default R palette
Rewiring edges of a graph
Community structure dendrogram plots
Growing random graph generation
Reverse the order in an edge sequence
Reverse the order in a vertex sequence
Functions to find weighted cliques, ie. weighted complete subgraphs in a graph
Various vertex shapes when plotting igraph graphs
Union of graphs
Error of the spectral coarse graining (SCG) approximation
Interactive plotting of graphs
Print a hierarchical random graph consensus tree to the screen
Predict edges based on a hierarchical random graph model
Find Bonacich Power Centrality Scores of Network Positions
Better printing of R packages
Geometric random graphs
Large Graph Layout
List all minimum \((s,t)\)-cuts of a graph
Generate random graphs according to the G(n,m) Erdos-Renyi model
Strength or weighted vertex degree
Generate an evolving random graph with preferential attachment and aging
Graph layout by multidimensional scaling
Generate scale-free graphs according to the Barabasi-Albert model
Query and manipulate a graph as it were an adjacency list
Create a printer callback function
Union of edge sequences
A graph with subgraphs that are each a random graph.
3D plotting of graphs with OpenGL
Running mean of a time series
Generate random graphs according to the random dot product graph model
Random graphs from vertex fitness scores
In- or out- component of a vertex
The Watts-Strogatz small-world model
Sampling a random integer sequence
Simple graphs
Generate random graphs according to the G(n,p) Erdos-Renyi model
Create tree graphs
SIR model on graphs
SCG Problem Solver
Similarity measures of two vertices
Constructor modifier to drop multiple and loop edges
Vertex connectivity.
Writing the graph to a file in some format
Convert a tree graph to its Prufer sequence
Constructor modifier to drop loop edges
Query and manipulate a graph as it were an adjacency matrix
Match Graphs given a seeding of vertex correspondences
Union of two or more sets
Using pie charts as vertices in graph plots
Transitivity of a graph
Topological sorting of vertices in a graph
Construtor modifier to remove all attributes from a graph
Semi-Projectors
Create a random regular graph
Sequential palette
Stochastic matrix of a graph
Triad census, subgraphs with three vertices
Run code with a temporary igraph options setting
Tails of the edge(s) in a graph
Experimental basic igraph GUI
Subgraph of a graph
Helper function to add or delete edges along a path
The Page Rank algorithm
Convert a general graph into a forest
Remove duplicate edges from an edge sequence
Set a graph attribute
Drawing graphs
Trait-based random generation
Remove duplicate vertices from a vertex sequence
Sample stochastic block model
Deprecated function, used to set random seed of the C library's RNG
All-in-one Function for the SCG of Matrices and Graphs
Constructor modifier to add vertex attributes
Spectral Coarse Graining
Show a vertex sequence on the screen
Query vertex attributes of a graph
Plotting of graphs
Print a hierarchical random graph model to the screen
List all (s,t)-cuts of a graph
Find mutual edges in a directed graph
Find subgraph centrality scores of network positions
Find the multiple or loop edges in a graph
Eigenvalues and eigenvectors of the adjacency matrix of a graph
Union of vertex sequences
List names of vertex attributes
sample_correlated_gnp_pair
Sample a pair of correlated G(n,p) random graphs
Generate a new random graph from a given graph by randomly
adding/removing edges
Sample vectors uniformly from the surface of a sphere
Samples from the spanning trees of a graph randomly and uniformly
All isomorphic mappings between a graph and subgraphs of another graph
Constructor modifier to add graph attributes
Set edge attributes
Split-join distance of two community structures
Decide if a graph is subgraph isomorphic to another one
igraph data structure versions
Constructor modifier to add edge attributes
Helper function for adding and deleting vertices