# igraph v0.4.1

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

betweenness | Vertex and edge betweenness centrality | |

revolver | Measuring the driving force in evolving networks | |

clusters | Connected components of a graph | |

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

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

decompose.graph | Decompose a graph into components | |

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

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

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

attributes | Graph, vertex and edge attributes | |

constraint | Burt's constraint | |

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

evcent | Find Eigenvector Centrality Scores of Network Positions | |

degree | Degree and degree distribution of the vertices | |

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

diameter | Diameter of a graph | |

grg.game | Geometric random graphs | |

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

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

communities | Common functions supporting community detection algorithms | |

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

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

igraph.sample | Sampling a random integer sequence | |

girth | Girth of a graph | |

graph-operators | Graph operators | |

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

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

graph-motifs | Graph motifs | |

graph.maxflow | Maximum flow in a network | |

graph.density | Graph density | |

graph.constructors | Various methods for creating graphs | |

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

cocitation | Cocitation coupling | |

graph.laplacian | Graph Laplacian | |

reciprocity | Reciprocity of graphs | |

iterators | Vertex and edge sequences and iterators | |

graph-isomorphism | Graph Isomorphism | |

igraph-parameters | Parameters for the igraph package | |

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

layout | Generate coordinates for plotting graphs | |

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

neighborhood | Neighborhood of graph vertices | |

page.rank | The Page Rank algorithm | |

layout.merge | Merging graph layouts | |

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

plot.igraph | Plotting of graphs | |

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

minimum.spanning.tree | Minimum spanning tree | |

read.graph | Reading foreign file formats | |

structure.info | Gaining information about graph structure | |

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

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

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

print.igraph | Print graphs to the terminal | |

closeness | Closeness centrality of vertices | |

rewire | Graph rewiring | |

rglplot | 3D plotting of graphs with OpenGL | |

edge.connectivity | Edge connectivity. | |

preference.game | Trait-based random generation | |

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

independent.vertex.sets | Independent vertex sets | |

igraph.undocumented | Undocumented and unsupportted igraph functions | |

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

transitivity | Transitivity of a graph | |

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

tkplot | Interactive plotting of graphs | |

Drawing graphs | Drawing graphs | |

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

traits | Graph generation based on different vertex types | |

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

vertex.connectivity | Vertex connectivity. | |

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

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

subgraph | Subgraph of a graph | |

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

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

articulation.points | Articulation points of a graph | |

biconnected.components | Biconnected components | |

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

cohesive.blocks | Calculate Cohesive Blocks | |

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

No Results! |

## Last month downloads

## Details

Date | May 10, 2007 |

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

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

Packaged | Tue May 22 23:04:16 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)
```