# igraph v0.6.6

0

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 | |

biconnected.components | Biconnected components | |

betweenness | Vertex and edge betweenness centrality | |

alpha.centrality | Find Bonacich alpha centrality scores of network positions | |

centralization | Centralization of a graph.tmax | |

is.mutual | Find mutual edges in a directed graph | |

clusters | Connected components of a graph | |

interconnected.islands | A graph with subgraphs that are each a random graph. | |

optimal.community | Optimal community structure | |

kleinberg | Kleinberg's centrality scores. | |

similarity | Similarity measures of two vertices | |

dendPlot.igraphHRG | HRG dendrogram plot | |

barabasi.game | Generate scale-free graphs according to the Barabasi-Albert model | |

revolver | Measuring the driving force in evolving networks | |

k.regular.game | Create a random regular graph | |

fastgreedy.community | Community structure via greedy optimization of modularity | |

components | In- or out- component of a vertex | |

static.fitness.game | Random graphs from vertex fitness scores | |

igraphtest | Run package tests | |

graph-operators | Graph operators | |

arpack | ARPACK eigenvector calculation | |

layout | Generate coordinates for plotting graphs | |

get.incidence | Incidence matrix of a bipartite graph | |

graph.diversity | Graph diversity | |

graph.strength | Strength or weighted vertex degree | |

Drawing graphs | Drawing graphs | |

nexus | Query and download from the Nexus network repository | |

bipartite.projection | Project a bipartite graph | |

maximum.cardinality.search | Maximum cardinality search | |

graph.dfs | Depth-first search | |

diameter | Diameter of a graph | |

constraint | Burt's constraint | |

graph.full.bipartite | Create a full bipartite graph | |

graph.laplacian | Graph Laplacian | |

graph.incidence | Create graphs from an incidence matrix | |

iterators | Vertex and edge sequences and iterators | |

rewire.edges | Rewires the endpoints of the edges of a graph randomly | |

contract.vertices | Contract several vertices into a single one | |

igraphdemo | Run igraph demos, step by step | |

subgraph | Subgraph of a graph | |

traits | Graph generation based on different vertex types | |

multilevel.community | Finding community structure by multi-level optimization of modularity | |

label.propagation.community | Finding communities based on propagating labels | |

Vertex shapes | Various vertex shapes when plotting igraph graphs | |

igraph options | Parameters for the igraph package | |

spinglass.community | Finding communities in graphs based on statistical meachanics | |

get.stochastic | Stochastic matrix of a graph | |

layout.merge | Merging graph layouts | |

static.power.law.game | Scale-free random graphs, from vertex fitness scores | |

graph.maxflow | Maximum flow in a network | |

bonpow | Find Bonacich Power Centrality Scores of Network Positions | |

closeness | Closeness centrality of vertices | |

Spectral coarse graining | Spectral Coarse Graining | |

autocurve.edges | Optimal edge curvature when plotting graphs | |

running.mean | Running mean of a time series | |

topological.sort | Topological sorting of vertices in a graph | |

compare.communities | Compares community structures using various metrics | |

graph.knn | Average nearest neighbor degree | |

subgraph.centrality | Find subgraph centrality scores of network positions | |

plot.igraph | Plotting of graphs | |

permute.vertices | Permute the vertices of a graph | |

graph.bipartite | Create a bipartite graph | |

is.chordal | Chordality of a graph | |

transitivity | Transitivity of a graph | |

structure.info | Gaining information about graph structure | |

tkplot | Interactive plotting of graphs | |

graph.coreness | K-core decomposition of graphs | |

degree | Degree and degree distribution of the vertices | |

community.to.membership | Common functions supporting community detection algorithms | |

igraph.undocumented | Undocumented and unsupportted igraph functions | |

is.degree.sequence | Degree sequences of graphs | |

write.graph | Writing the graph to a file in some format | |

graph.constructors | Various methods for creating graphs | |

igraph-package | The igraph package | |

minimum.spanning.tree | Minimum spanning tree | |

dendPlot | Plot dendrograms | |

preference.game | Trait-based random generation | |

neighborhood | Neighborhood of graph vertices | |

attributes | Graph, vertex and edge attributes | |

eccentricity | Eccentricity and radius | |

conversion between igraph and graphNEL graphs | Convert igraph graphs to graphNEL objects or back | |

print.igraph | Print graphs to the terminal | |

stCuts | List all (s,t)-cuts of a graph | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

assortativity | Assortativity coefficient | |

cliques | The functions find cliques, ie. complete subgraphs in a graph | |

igraph console | The igraph console | |

infomap.community | Infomap community finding | |

layout.drl | The DrL graph layout generator | |

minimal.st.separators | Minimum size vertex separators | |

decompose.graph | Decompose a graph into components | |

scgGrouping | SCG Problem Solver | |

graph.data.frame | Creating igraph graphs from data frames or vice-versa | |

erdos.renyi.game | Generate random graphs according to the Erdos-Renyi model | |

reciprocity | Reciprocity of graphs | |

get.edge.ids | Find the edge ids based on the incident vertices of the edges | |

graph.lcf | Creating a graph from LCF notation | |

shortest.paths | Shortest (directed or undirected) paths between vertices | |

graph-operators-by-name | Graph operators based on symbolic vertex names | |

articulation.points | Articulation points of a graph | |

unfold.tree | Convert a general graph into a forest | |

watts.strogatz.game | The Watts-Strogatz small-world model | |

read.graph | Reading foreign file formats | |

layout.mds | Graph layout by multidimensional scaling | |

modularity | Modularity of a community structure of a graph | |

graph.bfs | Breadth-first search | |

graph-isomorphism | Graph Isomorphism | |

graph-motifs | Graph motifs | |

graph.kautz | Kautz graphs | |

is.dag | Directed acyclic graphs | |

scgExtra | SCG Extra Functions | |

is.named | Named graphs | |

grg.game | Geometric random graphs | |

leading.eigenvector.community | Community structure detecting based on the leading eigenvector of the community matrix | |

is.weighted | Weighted graphs | |

minimum.size.separators | Minimum size vertex separators | |

tkigraph | Experimental basic igraph GUI | |

page.rank | The Page Rank algorithm | |

is.igraph | Is this object a graph? | |

triad.census | Triad census, subgraphs with three vertices | |

igraph.sample | Sampling a random integer sequence | |

power.law.fit | Fitting a power-law distribution function to discrete data | |

Pie charts as vertices | Using pie charts as vertices in graph plots | |

cohesive.blocks | Calculate Cohesive Blocks | |

graph.graphdb | Load a graph from the graph database for testing graph isomorphism. | |

Hierarchical random graphs | Hierarchical random graphs | |

layout.star | Generate coordinates to place the vertices of a graph in a star-shape | |

graph.adjacency | Create graphs from adjacency matrices | |

canonical.permutation | Canonical permutation of a graph | |

girth | Girth of a graph | |

graph.density | Graph density | |

independent.vertex.sets | Independent vertex sets | |

convex.hull | Convex hull of a set of vertices | |

dyad.census | Dyad census of a graph | |

conversion | Convert a graph to an adjacency matrix or an edge list | |

degree.sequence.game | Generate random graphs with a given degree sequence | |

Graphs from adjacency lists | Create graphs from adjacency lists | |

graph.automorphisms | Number of automorphisms | |

dominator.tree | Dominator tree | |

bipartite.mapping | Decide whether a graph is bipartite | |

graph.de.bruijn | De Bruijn graphs. | |

stMincuts | List all minimum $(s,t)$-cuts of a graph | |

as.directed | Convert between directed and undirected graphs | |

dendPlot.communities | Community structure dendrogram plots | |

layout.sugiyama | The Sugiyama graph layout generator | |

forest.fire.game | Forest Fire Network Model | |

is.separator | Vertex separators | |

walktrap.community | Community strucure via short random walks | |

scgSemiProjectors | Semi-Projectors | |

get.adjlist | Adjacency lists | |

graph.formula | Creating (small) graphs via a simple interface | |

graph.famous | Creating named graphs | |

edge.connectivity | Edge connectivity. | |

layout.grid | Simple grid layout | |

rewire | Graph rewiring | |

cocitation | Cocitation coupling | |

edge.betweenness.community | Community structure detection based on edge betweenness | |

growing.random.game | Growing random graph generation | |

communities | Functions to deal with the result of network community detection | |

graph.matching | Graph matching | |

rglplot | 3D plotting of graphs with OpenGL | |

vertex.connectivity | Vertex connectivity. | |

aging.prefatt.game | Generate an evolving random graph with preferential attachment and aging | |

as.igraph | Conversion to igraph | |

Combining attributes | How igraph functions handle attributes when the graph changes | |

graph.structure | Method for structural manipulation of graphs | |

line.graph | Line graph of a graph | |

is.multiple | Find the multiple or loop edges in a graph | |

scg | All-in-one Function for the SCG of Matrices and Graphs | |

simplify | Simple graphs | |

No Results! |

## Last month downloads

## Details

Date | 2013-10-28 |

License | GPL (>= 2) |

URL | http://igraph.sourceforge.net |

SystemRequirements | gmp, libxml2 |

Packaged | 2013-10-28 19:01:56 UTC; gaborcsardi |

NeedsCompilation | yes |

Repository | CRAN |

Date/Publication | 2013-10-28 21:46:12 |

#### Include our badge in your README

```
[![Rdoc](http://www.rdocumentation.org/badges/version/igraph)](http://www.rdocumentation.org/packages/igraph)
```