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