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