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