Generate random graphs according to the Erdos-Renyi model
Create graphs from an incidence matrix
leading.eigenvector.community
Community structure detecting based on the leading eigenvector
of the community matrix
Drawing graphs
Minimum spanning tree
Connected components of a graph
Creating igraph graphs from data frames
Create a full bipartite graph
Growing random graph generation
igraph from/to graphNEL conversion
Convert igraph graphs to graphNEL objects or back
Closeness centrality of vertices
Dyad census of a graph
Number of automorphisms
Biconnected components
Graph, vertex and edge attributes
Graph motifs
Is this object a graph?
Graph Isomorphism
Neighborhood of graph vertices
Various methods for creating graphs
Merging graph layouts
Fitting a power-law distribution function to discrete data
Convert between directed and undirected graphs
Strength or weighted vertex degree
Trait-based random generation
Finding communities in graphs based on statistical meachanics
Graph density
Decompose a graph into components
Parameters for the igraph package
Generate coordinates for plotting graphs
K-core decomposition of graphs
Community structure via greedy optimization of modularity
Sampling a random integer sequence
Kleinberg's centrality scores.
Vertex connectivity.
Generate scale-free graphs according to the Barabasi-Albert
model
Generate an evolving random graph with preferential attachment
and aging
Diameter of a graph
The functions find cliques, ie. complete subgraphs in a graph
Incidence matrix of a bipartite graph
Forest Fire Network Model
Calculate Cohesive Blocks
Find the multiple or loop edges in a graph
Find mutual edges in a directed graph
Girth of a graph
Reciprocity of graphs
Rewires the endpoints of the edges of a graph randomly
Community strucure via short random walks
Vertex and edge sequences and iterators
3D plotting of graphs with OpenGL
Transitivity of a graph
Gaining information about graph structure
Graph generation based on different vertex types
Writing the graph to a file in some format
edge.betweenness.community
Community structure detection based on edge betweenness
Find Bonacich alpha centrality scores of network positions
Find Eigenvector Centrality Scores of Network Positions
Permute the vertices of a graph
Cocitation coupling
Print graphs to the terminal
Burt's constraint
Creating a graph from LCF notation
Various vertex shapes when plotting igraph graphs
The DrL graph layout generator
Subgraph of a graph
Adjacency lists
Create a bipartite graph
Project a bipartite graph
Graph Laplacian
Measuring the driving force in evolving networks
Line graph of a graph
Convert a general graph into a forest
Simple graphs
Edge connectivity.
Measuring the driving force in evolving networks
Topological sorting of vertices in a graph
Geometric random graphs
Similarity measures of two vertices
Canonical permutation of a graph
Convert a graph to an adjacency matrix or an edge list
Independent vertex sets
Decide whether a graph is bipartite
label.propagation.community
Finding communities based on propagating labels
Plotting of graphs
Articulation points of a graph
Create graphs from adjacency matrices
Undocumented and unsupportted igraph functions
Find Bonacich Power Centrality Scores of Network Positions
ARPACK eigenvector calculation
Running mean of a time series
Degree and degree distribution of the vertices
Generate random graphs with a given degree sequence
The Page Rank algorithm
Write graphs and their cohesive block hierarchy as Pajek files
Average nearest neighbor degree
De Bruijn graphs.
Method for structural manipulation of graphs
Reading foreign file formats
Creating (small) graphs via a simple interface
Maximum flow in a network
Graph operators
Modularity of a community structure of a graph
Graphs from adjacency lists
Create graphs from adjacency lists
Kautz graphs
Graph rewiring
Experimental basic igraph GUI
The Watts-Strogatz small-world model
The igraph package
Interactive plotting of graphs
Vertex and edge betweenness centrality
Creating named graphs
Load a graph from the graph database for testing graph
isomorphism.
Shortest (directed or undirected) paths between vertices
Triad census, subgraphs with three vertices
Common functions supporting community detection algorithms
In- or out- component of a vertex
Plot graphs and their cohesive block hierarchy