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

Last month downloads


Date 2013-02-27
License GPL (>= 2)
URL http://igraph.sourceforge.net
SystemRequirements gmp, libxml2
Packaged 2013-02-27 16:49:18 UTC; gaborcsardi
NeedsCompilation yes
Repository CRAN
Date/Publication 2013-02-28 07:57:40

Include our badge in your README