igraph v0.6-3


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

Last month downloads


Date Oct 16, 2012
License GPL (>= 2)
URL http://igraph.sourceforge.net
SystemRequirements gmp, libxml2
Packaged 2012-10-17 12:55:30 UTC; gaborcsardi
Repository CRAN
Date/Publication 2012-10-17 14:09:19

Include our badge in your README