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