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