List all minimum $(s,t)$-cuts of a graph
In- or out- component of a vertex
Graphs from adjacency lists
Create graphs from adjacency lists
List all (s,t)-cuts of a graph
Assortativity coefficient
Generate random graphs according to the Erdos-Renyi model
edge.betweenness.community
Community structure detection based on edge betweenness
Fitting a power-law distribution function to discrete data
Create a random regular graph
Difference of graphs
Subgraph of a graph
Geometric random graphs
Incidence matrix of a bipartite graph
Directed acyclic graphs
How igraph functions handle attributes when the graph changes
Generate random graphs with a given degree sequence
Find the edge ids based on the incident vertices of the edges
maximum.cardinality.search
Maximum cardinality search
Graph Isomorphism
Vertex separators
Rewires the endpoints of the edges of a graph randomly
Reading foreign file formats
Hierarchical random graphs
Hierarchical random graphs
Simple graphs
Chordality of a graph
SCG Problem Solver
Biconnected components
All-in-one Function for the SCG of Matrices and Graphs
Gaining information about graph structure
Community structure dendrogram plots
Dyad census of a graph
Vertex and edge betweenness centrality
Decompose a graph into components
Common functions supporting community detection algorithms
Eccentricity and radius
Edge connectivity.
Set random seed of the C library's RNG
The Watts-Strogatz small-world model
Depth-first search
The functions find cliques, ie. complete subgraphs in a graph
Generate an evolving random graph with preferential attachment
and aging
Girth of a graph
Convex hull of a set of vertices
Independent vertex sets
Create a bipartite graph
Graph density
Forest Fire Network Model
Complementer of a graph
conversion between igraph and graphNEL graphs
Convert igraph graphs to graphNEL objects or back
Growing random graph generation
Kleinberg's centrality scores.
Decide whether a graph is bipartite
Graph, vertex and edge attributes
Minimum size vertex separators
K-core decomposition of graphs
Connected components of a graph
Sampling a random integer sequence
Query and download from the Nexus network repository
Creating (small) graphs via a simple interface
label.propagation.community
Finding communities based on propagating labels
Calculate Cohesive Blocks
Find Bonacich alpha centrality scores of network positions
Maximum flow in a network
Create graphs from adjacency matrices
Various vertex shapes when plotting igraph graphs
SIR model on graphs
Number of automorphisms
Graph rewiring
Generate coordinates to place the vertices of a graph in a
star-shape
Graphlet decomposition of a graph
Create graphs from an incidence matrix
Degree sequences of graphs
Named graphs
Minimum size vertex separators
Merging graph layouts
Generate coordinates for plotting graphs
Optimal community structure
Minimum spanning tree
Graph layout by multidimensional scaling
Permute the vertices of a graph
Neighborhood of graph vertices
Community strucure via short random walks
Print graphs to the terminal
Transitivity of a graph
Load a graph from the graph database for testing graph
isomorphism.
Finding community structure by multi-level optimization of
modularity
Graph matching
Is this object a graph?
Parameters for the igraph package
Experimental basic igraph GUI
Running mean of a time series
Convert a general graph into a forest
Stochastic matrix of a graph
Drawing graphs
Graph generation based on different vertex types
ARPACK eigenvector calculation
Bipartite random graphs
Articulation points of a graph
Closeness centrality of vertices
Run package tests
Random graphs from vertex fitness scores
Weighted graphs
Optimal edge curvature when plotting graphs
3D plotting of graphs with OpenGL
Generate scale-free graphs according to the Barabasi-Albert
model
Shortest (directed or undirected) paths between vertices
Reciprocity of graphs
Similarity measures of two vertices
Find Eigenvector Centrality Scores of Network Positions
Cocitation coupling
Convert a graph to an adjacency matrix or an edge list
Vertex and edge sequences and iterators
Compares community structures using various metrics
Find Bonacich Power Centrality Scores of Network Positions
Creating named graphs
Strength or weighted vertex degree
Sample stochastic block model
Semi-Projectors
Using pie charts as vertices in graph plots
Disjoint union of graphs
Modularity of a community structure of a graph
Eigenvalues and eigenvectors of the adjacency matrix of a graph
Triad census, subgraphs with three vertices
Create a full bipartite graph
Query igraph's version string
Find the multiple or loop edges in a graph
Trait-based random generation
SCG Extra Functions
Simple two-row layout for bipartite graphs
Undocumented and unsupportted igraph functions
Centralization of a graph.tmax
Contract several vertices into a single one
Dominator tree
The DrL graph layout generator
The Sugiyama graph layout generator
Plotting the results on multiple SIR model runs
HRG dendrogram plot
Graph Laplacian
Creating a graph from LCF notation
Graph motifs
Method for structural manipulation of graphs
Simple grid layout
leading.eigenvector.community
Community structure detecting based on the leading eigenvector
of the community matrix
Finding communities in graphs based on statistical meachanics
Interactive plotting of graphs
Conversion to igraph
Canonical permutation of a graph
Adjacency lists
Various methods for creating graphs
Creating igraph graphs from data frames or vice-versa
Average nearest neighbor degree
Run igraph demos, step by step
The Page Rank algorithm
Find subgraph centrality scores of network positions
Plot dendrograms
Community structure via greedy optimization of modularity
The igraph console
Plotting of graphs
Writing the graph to a file in some format
Spectral Coarse Graining
Compose two graphs as binary relations
De Bruijn graphs.
Graph diversity
Intersection of graphs
A graph with subgraphs that are each a random graph.
Degree and degree distribution of the vertices
Diameter of a graph
Line graph of a graph
Find mutual edges in a directed graph
Count adjacenct triangles
Project a bipartite graph
Measuring the driving force in evolving networks
Kautz graphs
Union of graphs
Infomap community finding
Vertex connectivity.
Topological sorting of vertices in a graph
Functions to deal with the result of network community detection
The igraph package
Burt's constraint
Convert between directed and undirected graphs
Breadth-first search
Scale-free random graphs, from vertex fitness scores