# igraph v0.4.3

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

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

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

communities | Common functions supporting community detection algorithms | |

decompose.graph | Decompose a graph into components | |

closeness | Closeness centrality of vertices | |

edge.connectivity | Edge connectivity. | |

betweenness | Vertex and edge betweenness centrality | |

iterators | Vertex and edge sequences and iterators | |

minimum.spanning.tree | Minimum spanning tree | |

graph-isomorphism | Graph Isomorphism | |

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

layout.merge | Merging graph layouts | |

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

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

graph.density | Graph density | |

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

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

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

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

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

igraph.undocumented | Undocumented and unsupportted igraph functions | |

graph.laplacian | Graph Laplacian | |

print.igraph | Print graphs to the terminal | |

tkplot | Interactive plotting of graphs | |

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

diameter | Diameter of a graph | |

neighborhood | Neighborhood of graph vertices | |

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

independent.vertex.sets | Independent vertex sets | |

attributes | Graph, vertex and edge attributes | |

graph-motifs | Graph motifs | |

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

layout | Generate coordinates for plotting graphs | |

rewire | Graph rewiring | |

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

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

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

page.rank | The Page Rank algorithm | |

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

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

graph-operators | Graph operators | |

grg.game | Geometric random graphs | |

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

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

preference.game | Trait-based random generation | |

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

girth | Girth of a graph | |

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

reciprocity | Reciprocity of graphs | |

igraph-parameters | Parameters for the igraph package | |

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

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

revolver | Measuring the driving force in evolving networks | |

subgraph | Subgraph of a graph | |

clusters | Connected components of a graph | |

Drawing graphs | Drawing graphs | |

cocitation | Cocitation coupling | |

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

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

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

plot.igraph | Plotting of graphs | |

constraint | Burt's constraint | |

traits | Graph generation based on different vertex types | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

structure.info | Gaining information about graph structure | |

transitivity | Transitivity of a graph | |

read.graph | Reading foreign file formats | |

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

graph.constructors | Various methods for creating graphs | |

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

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

degree | Degree and degree distribution of the vertices | |

igraph.sample | Sampling a random integer sequence | |

rglplot | 3D plotting of graphs with OpenGL | |

graph.maxflow | Maximum flow in a network | |

vertex.connectivity | Vertex connectivity. | |

No Results! |

## Last month downloads

## Details

Date | Aug 7, 2007 |

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

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

Packaged | Thu Aug 9 17:59:04 2007; csardi |

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