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