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