igraph v0.6-2


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

Last month downloads


Date Jun 20, 2012
License GPL (>= 2)
URL http://igraph.sourceforge.net
SystemRequirements gmp, libxml2
Packaged 2012-06-20 13:51:24 UTC; gaborcsardi
Repository CRAN
Date/Publication 2012-06-20 14:54:12

Include our badge in your README