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