# igraph v0.6-1

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

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

decompose.graph | Decompose a graph into components | |

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

arpack | ARPACK eigenvector calculation | |

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

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

dendPlot.igraphHRG | HRG dendrogram plot | |

dendPlot.communities | Plot fully hierarchical community structures as dendrograms | |

graph-motifs | Graph motifs | |

graph.strength | Strength or weighted vertex degree | |

graph.dfs | Depth-first search | |

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

layout.sugiyama | The Sugiyama graph layout generator | |

betweenness | Vertex and edge betweenness centrality | |

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

eccentricity | Eccentricity and radius | |

is.weighted | Weighted graphs | |

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

is.dag | Directed acyclic graphs | |

graph.automorphisms | Number of automorphisms | |

edge.connectivity | Edge connectivity. | |

Drawing graphs | Drawing graphs | |

simplify | Simple graphs | |

graph.constructors | Various methods for creating graphs | |

Hierarchical random graphs | Hierarchical random graphs | |

scgExtra | SCG Extra Functions | |

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

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

Spectral coarse graining | Spectral Coarse Graining | |

igraphdemo | Run igraph demos, step by step | |

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

graph.matching | Graph matching | |

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

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

preference.game | Trait-based random generation | |

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

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

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

graph.kautz | Kautz graphs | |

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

dominator.tree | Dominator tree | |

igraph console | The igraph console | |

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

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

cocitation | Cocitation coupling | |

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

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

get.adjlist | Adjacency lists | |

graph.famous | Creating named graphs | |

igraph.sample | Sampling a random integer sequence | |

transitivity | Transitivity of a graph | |

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

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

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

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

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

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

constraint | Burt's constraint | |

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

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

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

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

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

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

canonical.permutation | Canonical permutation of a graph | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

revolver | Measuring the driving force in evolving networks | |

graph.bfs | Breadth-first search | |

dyad.census | Dyad census of a graph | |

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

grg.game | Geometric random graphs | |

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

graph.data.frame | Creating igraph graphs from data frames | |

structure.info | Gaining information about graph structure | |

layout.grid | Simple grid layout | |

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

graph-isomorphism | Graph Isomorphism | |

layout | Generate coordinates for plotting graphs | |

tkplot | Interactive plotting of graphs | |

layout.merge | Merging graph layouts | |

reciprocity | Reciprocity of graphs | |

graph.bipartite | Create a bipartite graph | |

subgraph | Subgraph of a graph | |

get.stochastic | Stochastic matrix of a graph | |

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

minimum.spanning.tree | Minimum spanning tree | |

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

tkigraph | Experimental basic igraph GUI | |

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

closeness | Closeness centrality of vertices | |

clusters | Connected components of a graph | |

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

line.graph | Line graph of a graph | |

scgGrouping | SCG Problem Solver | |

scgSemiProjectors | Semi-Projectors | |

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

articulation.points | Articulation points of a graph | |

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

as.igraph | Conversion to igraph | |

attributes | Graph, vertex and edge attributes | |

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

dendPlot | Plot dendrograms | |

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

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

igraph-package | The igraph package | |

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

rglplot | 3D plotting of graphs with OpenGL | |

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

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

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

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

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

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

graph.laplacian | Graph Laplacian | |

plot.igraph | Plotting of graphs | |

similarity | Similarity measures of two vertices | |

vertex.connectivity | Vertex connectivity. | |

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

biconnected.components | Biconnected components | |

bipartite.projection | Project a bipartite graph | |

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

graph.maxflow | Maximum flow in a network | |

is.named | Named graphs | |

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

traits | Graph generation based on different vertex types | |

assortativity | Assortativity coefficient | |

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

graph.adjacency | Create graphs from adjacency matrices | |

graph.density | Graph density | |

graph.knn | Average nearest neighbor degree | |

centralization | Centralization of a graph.tmax | |

igraph options | Parameters for the igraph package | |

infomap.community | Infomap community finding | |

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

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

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

print.igraph | Print graphs to the terminal | |

read.graph | Reading foreign file formats | |

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

independent.vertex.sets | Independent vertex sets | |

layout.drl | The DrL graph layout generator | |

neighborhood | Neighborhood of graph vertices | |

iterators | Vertex and edge sequences and iterators | |

girth | Girth of a graph | |

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

kleinberg | Kleinberg's centrality scores. | |

page.rank | The Page Rank algorithm | |

igraph.undocumented | Undocumented and unsupportted igraph functions | |

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

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

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

diameter | Diameter of a graph | |

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

is.chordal | Chordality of a graph | |

is.separator | Vertex separators | |

optimal.community | Optimal community structure | |

rewire | Graph rewiring | |

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

cohesive.blocks | Calculate Cohesive Blocks | |

degree | Degree and degree distribution of the vertices | |

graph.diversity | Graph diversity | |

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

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

maximum.cardinality.search | Maximum cardinality search | |

graph-operators | Graph operators | |

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

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

layout.mds | Graph layout by multidimensional scaling | |

No Results! |

## Last month downloads

## Details

Date | Jun 11, 2012 |

License | GPL (>= 2) |

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

SystemRequirements | gmp, libxml2 |

Packaged | 2012-06-17 01:48:50 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2012-06-17 02:30:00 |

suggests | ape , graph , igraphdata , Matrix , rgl , stats4 , tcltk |

depends | stats |

Contributors | Gabor Csardi |

#### Include our badge in your README

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