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