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