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