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