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