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