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