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