# igraph v0.2.1

0

Monthly downloads

by Gabor Csardi

## IGraph class

Routines for simple graphs.

## Functions in igraph

Name | Description | |

attributes | Graph, vertex and edge attributes | |

cocitation | Cocitation coupling | |

diameter | Diameter of a graph | |

constraint | Burt's constraint | |

closeness | Closeness centrality of vertices | |

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

community | Undocumented functions for community structure detection | |

clusters | Connected components of a graph | |

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

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

betweenness | Vertex and edge betweenness centrality | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

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

degree | Degree and degree distribution of the vertices | |

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

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

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

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

rewire | Graph rewiring | |

igraph.sample | Sampling a random integer sequence | |

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

layout.merge | Merging graph layouts | |

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

rglplot | 3D plotting of graphs with OpenGL | |

graph-motifs | Graph motifs | |

page.rank | The Page Rank algorithm | |

plot.igraph | Plotting of graphs | |

igraph-parameters | Parameters for the igraph package | |

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

iterators | Vertex and edge sequences and iterators | |

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

graph.laplacian | Graph Laplacian | |

traits | Graph generation based on different vertex types | |

transitivity | Transitivity of a graph | |

decompose.graph | Decompose a graph into components | |

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

structure.info | Gaining information about graph structure | |

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

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

graph-operators | Graph operators | |

graph.constructors | Various methods for creating graphs | |

read.graph | Reading foreign file formats | |

graph-isomorphism | Graph Isomorphism | |

subgraph | Subgraph of a graph | |

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

minimum.spanning.tree | Minimum spanning tree | |

tkplot | Interactive plotting of graphs | |

reciprocity | Reciprocity of graphs | |

print.igraph | Print graphs to the terminal | |

layout | Generate coordinates for plotting graphs | |

No Results! |

## Last month downloads

## Details

Date | Januar 25, 2005 |

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

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

Packaged | Wed Aug 23 23:13:10 2006; csardi |

Contributors | Gabor Csardi |

#### Include our badge in your README

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