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