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