# igraph v0.5.3

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

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

layout.drl | The DrL graph layout generator | |

graph.maxflow | Maximum flow in a network | |

structure.info | Gaining information about graph structure | |

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

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

arpack | ARPACK eigenvector calculation | |

revolver | Measuring the driving force in evolving networks | |

igraph.sample | Sampling a random integer sequence | |

minimum.spanning.tree | Minimum spanning tree | |

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

articulation.points | Articulation points of a graph | |

kleinberg | Kleinberg's centrality scores. | |

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

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

attributes | Graph, vertex and edge attributes | |

write.pajek.bgraph | Write graphs and their cohesive block hierarchy as Pajek files | |

graph.famous | Creating named graphs | |

layout | Generate coordinates for plotting graphs | |

read.graph | Reading foreign file formats | |

graph.automorphisms | Number of automorphisms | |

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

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

igraph from/to graphNEL conversion | Convert igraph graphs to graphNEL objects or back | |

subgraph | Subgraph of a graph | |

constraint | Burt's constraint | |

graph-isomorphism | Graph Isomorphism | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

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

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

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

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

graph.strength | Strength or weighted vertex degree | |

plot.igraph | Plotting of graphs | |

degree | Degree and degree distribution of the vertices | |

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

similarity | Similarity measures of two vertices | |

graph-motifs | Graph motifs | |

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

preference.game | Trait-based random generation | |

graph.laplacian | Graph Laplacian | |

traits | Graph generation based on different vertex types | |

graph.adjacency | Create graphs from adjacency matrices | |

tkplot | Interactive plotting of graphs | |

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

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

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

reciprocity | Reciprocity of graphs | |

diameter | Diameter of a graph | |

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

graph.kautz | Kautz graphs | |

decompose.graph | Decompose a graph into components | |

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

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

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

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

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

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

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

closeness | Closeness centrality of vertices | |

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

girth | Girth of a graph | |

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

transitivity | Transitivity of a graph | |

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

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

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

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

print.igraph | Print graphs to the terminal | |

neighborhood | Neighborhood of graph vertices | |

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

line.graph | Line graph of a graph | |

Drawing graphs | Drawing graphs | |

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

bipartite.projection | Project a bipartite graph | |

cocitation | Cocitation coupling | |

edge.connectivity | Edge connectivity. | |

biconnected.components | Biconnected components | |

betweenness | Vertex and edge betweenness centrality | |

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

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

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

layout.merge | Merging graph layouts | |

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

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

page.rank | The Page Rank algorithm | |

graph.density | Graph density | |

canonical.permutation | Canonical permutation of a graph | |

grg.game | Geometric random graphs | |

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

vertex.connectivity | Vertex connectivity. | |

graph-operators | Graph operators | |

igraph-package | The igraph package | |

cohesive.blocks | Calculate Cohesive Blocks | |

communities | Common functions supporting community detection algorithms | |

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

rewire | Graph rewiring | |

graph.constructors | Various methods for creating graphs | |

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

clusters | Connected components of a graph | |

graph.bipartite | Create a bipartite graph | |

get.adjlist | Adjacency lists | |

dyad.census | Dyad census of a graph | |

graph.knn | Average nearest neighbor degree | |

rglplot | 3D plotting of graphs with OpenGL | |

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

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

simplify | Simple graphs | |

independent.vertex.sets | Independent vertex sets | |

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

plot.bgraph | Plot graphs and their cohesive block hierarchy | |

tkigraph | Experimental basic igraph GUI | |

measure.dynamics | Measuring the driving force in evolving networks | |

igraph-parameters | Parameters for the igraph package | |

igraph.undocumented | Undocumented and unsupportted igraph functions | |

iterators | Vertex and edge sequences and iterators | |

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

No Results! |

## Last month downloads

## Details

Date | Nov 22, 2009 |

License | GPL (>= 2) |

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

Packaged | 2009-11-22 12:32:44 UTC; csardi |

Repository | CRAN |

Date/Publication | 2009-11-22 16:20:35 |

#### Include our badge in your README

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