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