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