igraph v0.7.1


Monthly downloads



by Gabor Csardi

Network analysis and visualization

Routines for simple graphs and network analysis. igraph can handle large graphs very well and provides functions for generating random and regular graphs, graph visualization, centrality indices and much more.

Functions in igraph

Name Description
stMincuts List all minimum $(s,t)$-cuts of a graph
components In- or out- component of a vertex
Graphs from adjacency lists Create graphs from adjacency lists
stCuts List all (s,t)-cuts of a graph
assortativity Assortativity coefficient
erdos.renyi.game Generate random graphs according to the Erdos-Renyi model
edge.betweenness.community Community structure detection based on edge betweenness
power.law.fit Fitting a power-law distribution function to discrete data
k.regular.game Create a random regular graph
graph.difference Difference of graphs
subgraph Subgraph of a graph
grg.game Geometric random graphs
get.incidence Incidence matrix of a bipartite graph
is.dag Directed acyclic graphs
Combining attributes How igraph functions handle attributes when the graph changes
degree.sequence.game Generate random graphs with a given degree sequence
get.edge.ids Find the edge ids based on the incident vertices of the edges
maximum.cardinality.search Maximum cardinality search
graph-isomorphism Graph Isomorphism
is.separator Vertex separators
rewire.edges Rewires the endpoints of the edges of a graph randomly
read.graph Reading foreign file formats
Hierarchical random graphs Hierarchical random graphs
simplify Simple graphs
is.chordal Chordality of a graph
scgGrouping SCG Problem Solver
biconnected.components Biconnected components
scg All-in-one Function for the SCG of Matrices and Graphs
structure.info Gaining information about graph structure
dendPlot.communities Community structure dendrogram plots
dyad.census Dyad census of a graph
betweenness Vertex and edge betweenness centrality
decompose.graph Decompose a graph into components
community.to.membership Common functions supporting community detection algorithms
eccentricity Eccentricity and radius
edge.connectivity Edge connectivity.
srand Set random seed of the C library's RNG
watts.strogatz.game The Watts-Strogatz small-world model
graph.dfs Depth-first search
cliques The functions find cliques, ie. complete subgraphs in a graph
aging.prefatt.game Generate an evolving random graph with preferential attachment and aging
girth Girth of a graph
convex.hull Convex hull of a set of vertices
independent.vertex.sets Independent vertex sets
graph.bipartite Create a bipartite graph
graph.density Graph density
forest.fire.game Forest Fire Network Model
graph.complementer Complementer of a graph
conversion between igraph and graphNEL graphs Convert igraph graphs to graphNEL objects or back
growing.random.game Growing random graph generation
kleinberg Kleinberg's centrality scores.
bipartite.mapping Decide whether a graph is bipartite
attributes Graph, vertex and edge attributes
minimal.st.separators Minimum size vertex separators
graph.coreness K-core decomposition of graphs
clusters Connected components of a graph
igraph.sample Sampling a random integer sequence
nexus Query and download from the Nexus network repository
graph.formula Creating (small) graphs via a simple interface
label.propagation.community Finding communities based on propagating labels
cohesive.blocks Calculate Cohesive Blocks
alpha.centrality Find Bonacich alpha centrality scores of network positions
graph.maxflow Maximum flow in a network
graph.adjacency Create graphs from adjacency matrices
Vertex shapes Various vertex shapes when plotting igraph graphs
sir SIR model on graphs
graph.automorphisms Number of automorphisms
rewire Graph rewiring
layout.star Generate coordinates to place the vertices of a graph in a star-shape
Graphlets Graphlet decomposition of a graph
graph.incidence Create graphs from an incidence matrix
is.degree.sequence Degree sequences of graphs
is.named Named graphs
minimum.size.separators Minimum size vertex separators
layout.merge Merging graph layouts
layout Generate coordinates for plotting graphs
optimal.community Optimal community structure
minimum.spanning.tree Minimum spanning tree
layout.mds Graph layout by multidimensional scaling
permute.vertices Permute the vertices of a graph
neighborhood Neighborhood of graph vertices
walktrap.community Community strucure via short random walks
print.igraph Print graphs to the terminal
transitivity Transitivity of a graph
graph.graphdb Load a graph from the graph database for testing graph isomorphism.
multilevel.community Finding community structure by multi-level optimization of modularity
graph.matching Graph matching
is.igraph Is this object a graph?
igraph options Parameters for the igraph package
tkigraph Experimental basic igraph GUI
running.mean Running mean of a time series
unfold.tree Convert a general graph into a forest
get.stochastic Stochastic matrix of a graph
Drawing graphs Drawing graphs
traits Graph generation based on different vertex types
arpack ARPACK eigenvector calculation
bipartite.random.game Bipartite random graphs
articulation.points Articulation points of a graph
closeness Closeness centrality of vertices
igraphtest Run package tests
static.fitness.game Random graphs from vertex fitness scores
is.weighted Weighted graphs
autocurve.edges Optimal edge curvature when plotting graphs
rglplot 3D plotting of graphs with OpenGL
barabasi.game Generate scale-free graphs according to the Barabasi-Albert model
shortest.paths Shortest (directed or undirected) paths between vertices
reciprocity Reciprocity of graphs
similarity Similarity measures of two vertices
evcent Find Eigenvector Centrality Scores of Network Positions
cocitation Cocitation coupling
conversion Convert a graph to an adjacency matrix or an edge list
iterators Vertex and edge sequences and iterators
compare.communities Compares community structures using various metrics
bonpow Find Bonacich Power Centrality Scores of Network Positions
graph.famous Creating named graphs
graph.strength Strength or weighted vertex degree
sbm.game Sample stochastic block model
scgSemiProjectors Semi-Projectors
Pie charts as vertices Using pie charts as vertices in graph plots
graph.disjoint.union Disjoint union of graphs
modularity Modularity of a community structure of a graph
graph.eigen Eigenvalues and eigenvectors of the adjacency matrix of a graph
triad.census Triad census, subgraphs with three vertices
graph.full.bipartite Create a full bipartite graph
igraph.version Query igraph's version string
is.multiple Find the multiple or loop edges in a graph
preference.game Trait-based random generation
scgExtra SCG Extra Functions
layout.bipartite Simple two-row layout for bipartite graphs
igraph.undocumented Undocumented and unsupportted igraph functions
centralization Centralization of a graph.tmax
contract.vertices Contract several vertices into a single one
dominator.tree Dominator tree
layout.drl The DrL graph layout generator
layout.sugiyama The Sugiyama graph layout generator
plot.sir Plotting the results on multiple SIR model runs
dendPlot.igraphHRG HRG dendrogram plot
graph.laplacian Graph Laplacian
graph.lcf Creating a graph from LCF notation
graph-motifs Graph motifs
graph.structure Method for structural manipulation of graphs
layout.grid Simple grid layout
leading.eigenvector.community Community structure detecting based on the leading eigenvector of the community matrix
spinglass.community Finding communities in graphs based on statistical meachanics
tkplot Interactive plotting of graphs
as.igraph Conversion to igraph
canonical.permutation Canonical permutation of a graph
get.adjlist Adjacency lists
graph.constructors Various methods for creating graphs
graph.data.frame Creating igraph graphs from data frames or vice-versa
graph.knn Average nearest neighbor degree
igraphdemo Run igraph demos, step by step
page.rank The Page Rank algorithm
subgraph.centrality Find subgraph centrality scores of network positions
dendPlot Plot dendrograms
fastgreedy.community Community structure via greedy optimization of modularity
igraph console The igraph console
plot.igraph Plotting of graphs
write.graph Writing the graph to a file in some format
Spectral coarse graining Spectral Coarse Graining
graph.compose Compose two graphs as binary relations
graph.de.bruijn De Bruijn graphs.
graph.diversity Graph diversity
graph.intersection Intersection of graphs
interconnected.islands A graph with subgraphs that are each a random graph.
degree Degree and degree distribution of the vertices
diameter Diameter of a graph
line.graph Line graph of a graph
is.mutual Find mutual edges in a directed graph
adjacent.triangles Count adjacenct triangles
bipartite.projection Project a bipartite graph
revolver Measuring the driving force in evolving networks
graph.kautz Kautz graphs
graph.union Union of graphs
infomap.community Infomap community finding
vertex.connectivity Vertex connectivity.
topological.sort Topological sorting of vertices in a graph
communities Functions to deal with the result of network community detection
igraph-package The igraph package
constraint Burt's constraint
as.directed Convert between directed and undirected graphs
graph.bfs Breadth-first search
static.power.law.game Scale-free random graphs, from vertex fitness scores
No Results!

Last month downloads


Date 2014-04-22
License GPL (>= 2)
URL http://igraph.org
SystemRequirements gmp, libxml2
BugReports https://github.com/igraph/igraph/issues
Packaged 2014-04-22 18:00:26 UTC; gaborcsardi
NeedsCompilation yes
Repository CRAN
Date/Publication 2014-04-22 23:08:29

Include our badge in your README