Diameter of a graph
Generate scale-free graphs according to the Barabasi-Albert
model
leading.eigenvector.community
Community structure detecting based on the leading eigenvector
of the community matrix
Generate an evolving random graph with preferential attachment
and aging
Merging graph layouts
Geometric random graphs
Graph Isomorphism
edge.betweenness.community
Community structure detection based on edge betweenness
Vertex and edge betweenness centrality
Find Bonacich alpha centrality scores of network positions
Convert a graph to an adjacency matrix or an edge list
Trait-based random generation
Girth of a graph
Connected components of a graph
Graph Laplacian
Common functions supporting community detection algorithms
K-core decomposition of graphs
Transitivity of a graph
Graph density
Remove loop and/or multiple edges from a graph
Graph operators
Drawing graphs
Graph generation based on different vertex types
Method for structural manipulation of graphs
Closeness centrality of vertices
Generate coordinates for plotting graphs
Graph, vertex and edge attributes
Modularity of a community structure of a graph
Running mean of a time series
Decompose a graph into components
Growing random graph generation
Minimum spanning tree
Neighborhood of graph vertices
Convert between directed and undirected graphs
Various methods for creating graphs
Community structure via greedy optimization of modularity
Find Bonacich Power Centrality Scores of Network Positions
Burt's constraint
Find Eigenvector Centrality Scores of Network Positions
Sampling a random integer sequence
Measuring the driving force in evolving networks
Measuring the driving force in evolving networks
Rewires the endpoints of the edges of a graph randomly
Maximum flow in a network
The functions find cliques, ie. complete subgraphs in a graph
Reading foreign file formats
3D plotting of graphs with OpenGL
Independent vertex sets
In- or out- component of a vertex
Undocumented and unsupportted igraph functions
Shortest (directed or undirected) paths between vertices
Generate random graphs with a given degree sequence
Community strucure via short random walks
Parameters for the igraph package
Edge connectivity.
Reciprocity of graphs
Is this object a graph?
Vertex and edge sequences and iterators
Generate random graphs according to the Erdos-Renyi model
Cocitation coupling
Degree and degree distribution of the vertices
Subgraph of a graph
Graph rewiring
Load a graph from the graph database for testing graph
isomorphism.
The Page Rank algorithm
Fitting a power-law distribution function to discrete data
Print graphs to the terminal
The Watts-Strogatz small-world model
Vertex connectivity.
Topological sorting of vertices in a graph
Gaining information about graph structure
Interactive plotting of graphs
Plotting of graphs
Graph motifs
Writing the graph to a file in some format
Finding communities in graphs based on statistical meachanics