# igraph v0.4.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 | |

diameter | Diameter of a graph | |

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

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

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

layout.merge | Merging graph layouts | |

grg.game | Geometric random graphs | |

graph-isomorphism | Graph Isomorphism | |

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

betweenness | Vertex and edge betweenness centrality | |

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

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

preference.game | Trait-based random generation | |

girth | Girth of a graph | |

clusters | Connected components of a graph | |

graph.laplacian | Graph Laplacian | |

communities | Common functions supporting community detection algorithms | |

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

transitivity | Transitivity of a graph | |

graph.density | Graph density | |

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

graph-operators | Graph operators | |

Drawing graphs | Drawing graphs | |

traits | Graph generation based on different vertex types | |

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

closeness | Closeness centrality of vertices | |

layout | Generate coordinates for plotting graphs | |

attributes | Graph, vertex and edge attributes | |

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

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

decompose.graph | Decompose a graph into components | |

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

minimum.spanning.tree | Minimum spanning tree | |

neighborhood | Neighborhood of graph vertices | |

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

graph.constructors | Various methods for creating graphs | |

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

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

constraint | Burt's constraint | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

igraph.sample | Sampling a random integer sequence | |

revolver | Measuring the driving force in evolving networks | |

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

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

graph.maxflow | Maximum flow in a network | |

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

read.graph | Reading foreign file formats | |

rglplot | 3D plotting of graphs with OpenGL | |

independent.vertex.sets | Independent vertex sets | |

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

igraph.undocumented | Undocumented and unsupportted igraph functions | |

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

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

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

igraph-parameters | Parameters for the igraph package | |

edge.connectivity | Edge connectivity. | |

reciprocity | Reciprocity of graphs | |

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

iterators | Vertex and edge sequences and iterators | |

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

cocitation | Cocitation coupling | |

degree | Degree and degree distribution of the vertices | |

subgraph | Subgraph of a graph | |

rewire | Graph rewiring | |

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

page.rank | The Page Rank algorithm | |

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

print.igraph | Print graphs to the terminal | |

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

vertex.connectivity | Vertex connectivity. | |

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

structure.info | Gaining information about graph structure | |

tkplot | Interactive plotting of graphs | |

plot.igraph | Plotting of graphs | |

graph-motifs | Graph motifs | |

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

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

No Results! |

## Last month downloads

## Details

Date | May 28, 2007 |

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

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

Packaged | Wed Jun 6 19:47:34 2007; csardi |

suggests | rgl , stats4 |

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