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