igraph v0.6.4


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

Last month downloads


Date 2013-02-02
License GPL (>= 2)
URL http://igraph.sourceforge.net
SystemRequirements gmp, libxml2
Packaged 2013-02-04 20:19:36 UTC; gaborcsardi
Repository CRAN
Date/Publication 2013-02-04 22:20:28

Include our badge in your README