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