edge.betweenness.community
Community structure detection based on edge betweenness
Decompose a graph into components
In- or out- component of a vertex
ARPACK eigenvector calculation
Contract several vertices into a single one
Graphs from adjacency lists
Create graphs from adjacency lists
HRG dendrogram plot
Plot fully hierarchical community structures as dendrograms
Graph motifs
Strength or weighted vertex degree
Depth-first search
Method for structural manipulation of graphs
The Sugiyama graph layout generator
Vertex and edge betweenness centrality
How igraph functions handle attributes when the graph changes
Eccentricity and radius
Weighted graphs
Common functions supporting community detection algorithms
Directed acyclic graphs
Number of automorphisms
Edge connectivity.
Drawing graphs
Simple graphs
Various methods for creating graphs
Hierarchical random graphs
Hierarchical random graphs
SCG Extra Functions
A graph with subgraphs that are each a random graph.
Random graphs from vertex fitness scores
Spectral Coarse Graining
Run igraph demos, step by step
Find the edge ids based on the incident vertices of the edges
Graph matching
Find mutual edges in a directed graph
Permute the vertices of a graph
Trait-based random generation
Find subgraph centrality scores of network positions
Functions to deal with the result of network community detection
Modularity of a community structure of a graph
Kautz graphs
Minimum size vertex separators
Dominator tree
The igraph console
Convert between directed and undirected graphs
Growing random graph generation
Cocitation coupling
label.propagation.community
Finding communities based on propagating labels
Rewires the endpoints of the edges of a graph randomly
Adjacency lists
Creating named graphs
Sampling a random integer sequence
Transitivity of a graph
Using pie charts as vertices in graph plots
K-core decomposition of graphs
leading.eigenvector.community
Community structure detecting based on the leading eigenvector
of the community matrix
Find Bonacich Power Centrality Scores of Network Positions
Shortest (directed or undirected) paths between vertices
Triad census, subgraphs with three vertices
Burt's constraint
Convert a graph to an adjacency matrix or an edge list
Create a full bipartite graph
Minimum size vertex separators
Fitting a power-law distribution function to discrete data
Generate coordinates to place the vertices of a graph in a
star-shape
Generate scale-free graphs according to the Barabasi-Albert
model
Canonical permutation of a graph
Find Eigenvector Centrality Scores of Network Positions
Measuring the driving force in evolving networks
Breadth-first search
Dyad census of a graph
Incidence matrix of a bipartite graph
Geometric random graphs
Creating a graph from LCF notation
Creating igraph graphs from data frames
Gaining information about graph structure
Simple grid layout
Generate random graphs with a given degree sequence
Graph Isomorphism
Generate coordinates for plotting graphs
Interactive plotting of graphs
Merging graph layouts
Reciprocity of graphs
Create a bipartite graph
Subgraph of a graph
Stochastic matrix of a graph
Graph operators based on symbolic vertex names
Minimum spanning tree
Topological sorting of vertices in a graph
Experimental basic igraph GUI
The Watts-Strogatz small-world model
Closeness centrality of vertices
Connected components of a graph
De Bruijn graphs.
Line graph of a graph
SCG Problem Solver
Semi-Projectors
Convert a general graph into a forest
Articulation points of a graph
Find Bonacich alpha centrality scores of network positions
Conversion to igraph
Graph, vertex and edge attributes
Convex hull of a set of vertices
Plot dendrograms
Is this object a graph?
Community structure via greedy optimization of modularity
The igraph package
Forest Fire Network Model
3D plotting of graphs with OpenGL
Scale-free random graphs, from vertex fitness scores
Community strucure via short random walks
Writing the graph to a file in some format
Generate an evolving random graph with preferential attachment
and aging
Compares community structures using various metrics
Creating (small) graphs via a simple interface
Graph Laplacian
Plotting of graphs
Similarity measures of two vertices
Vertex connectivity.
Finding community structure by multi-level optimization of
modularity
Biconnected components
Project a bipartite graph
Create graphs from an incidence matrix
Maximum flow in a network
Named graphs
All-in-one Function for the SCG of Matrices and Graphs
Graph generation based on different vertex types
Assortativity coefficient
Generate random graphs according to the Erdos-Renyi model
Create graphs from adjacency matrices
Graph density
Average nearest neighbor degree
Centralization of a graph.tmax
Parameters for the igraph package
Infomap community finding
Query and download from the Nexus network repository
conversion between igraph and graphNEL graphs
Convert igraph graphs to graphNEL objects or back
Running mean of a time series
Print graphs to the terminal
Reading foreign file formats
List all (s,t)-cuts of a graph
Independent vertex sets
The DrL graph layout generator
Neighborhood of graph vertices
Vertex and edge sequences and iterators
Girth of a graph
Load a graph from the graph database for testing graph
isomorphism.
Kleinberg's centrality scores.
The Page Rank algorithm
Undocumented and unsupportted igraph functions
List all minimum $(s,t)$-cuts of a graph
Optimal edge curvature when plotting graphs
The functions find cliques, ie. complete subgraphs in a graph
Diameter of a graph
Various vertex shapes when plotting igraph graphs
Chordality of a graph
Vertex separators
Optimal community structure
Graph rewiring
Finding communities in graphs based on statistical meachanics
Calculate Cohesive Blocks
Degree and degree distribution of the vertices
Graph diversity
Decide whether a graph is bipartite
Find the multiple or loop edges in a graph
maximum.cardinality.search
Maximum cardinality search
Graph operators
Create a random regular graph
Degree sequences of graphs
Graph layout by multidimensional scaling