# igraph v0.3.2

0

Monthly downloads

by Gabor Csardi

## Routines for simple graphs, network analysis.

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

closeness | Closeness centrality of vertices | |

graph-isomorphism | Graph Isomorphism | |

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

attributes | Graph, vertex and edge attributes | |

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

iterators | Vertex and edge sequences and iterators | |

diameter | Diameter of a graph | |

igraph-parameters | Parameters for the igraph package | |

neighborhood | Neighborhood of graph vertices | |

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

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

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

graph-operators | Graph operators | |

rewire | Graph rewiring | |

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

graph.density | Graph density | |

degree | Degree and degree distribution of the vertices | |

constraint | Burt's constraint | |

cocitation | Cocitation coupling | |

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

igraph.sample | Sampling a random integer sequence | |

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

read.graph | Reading foreign file formats | |

preference.game | Trait-based random generation | |

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

minimum.spanning.tree | Minimum spanning tree | |

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

graph-motifs | Graph motifs | |

graph.constructors | Various methods for creating graphs | |

layout | Generate coordinates for plotting graphs | |

grg.game | Geometric random graphs | |

structure.info | Gaining information about graph structure | |

reciprocity | Reciprocity of graphs | |

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

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

traits | Graph generation based on different vertex types | |

layout.merge | Merging graph layouts | |

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

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

rglplot | 3D plotting of graphs with OpenGL | |

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

graph.maxflow | Maximum flow in a network | |

clusters | Connected components of a graph | |

decompose.graph | Decompose a graph into components | |

community | Undocumented functions for community structure detection | |

simplify | Remove loop and/or multiple edges from a graph | |

betweenness | Vertex and edge betweenness centrality | |

page.rank | The Page Rank algorithm | |

edge.connectivity | Edge connectivity. | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

plot.igraph | Plotting of graphs | |

graph.laplacian | Graph Laplacian | |

subgraph | Subgraph of a graph | |

vertex.connectivity | Vertex connectivity. | |

print.igraph | Print graphs to the terminal | |

tkplot | Interactive plotting of graphs | |

transitivity | Transitivity of a graph | |

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

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

No Results! |

## Last month downloads

## Details

Date | December 5, 2006 |

License | GPL version 2 or later (June, 1991) |

URL | http://cneurocvs.rmki.kfki.hu/igraph |

Packaged | Thu Dec 14 13:45:22 2006; csardi |

suggests | rgl , stats4 |

Contributors | Gabor Csardi |

#### Include our badge in your README

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