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