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