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

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

graph.incidence | Create graphs from an incidence matrix | |

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

Drawing graphs | Drawing graphs | |

minimum.spanning.tree | Minimum spanning tree | |

clusters | Connected components of a graph | |

graph.data.frame | Creating igraph graphs from data frames | |

graph.full.bipartite | Create a full bipartite graph | |

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

igraph from/to graphNEL conversion | Convert igraph graphs to graphNEL objects or back | |

closeness | Closeness centrality of vertices | |

dyad.census | Dyad census of a graph | |

graph.automorphisms | Number of automorphisms | |

biconnected.components | Biconnected components | |

attributes | Graph, vertex and edge attributes | |

graph-motifs | Graph motifs | |

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

graph-isomorphism | Graph Isomorphism | |

neighborhood | Neighborhood of graph vertices | |

graph.constructors | Various methods for creating graphs | |

layout.merge | Merging graph layouts | |

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

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

graph.strength | Strength or weighted vertex degree | |

preference.game | Trait-based random generation | |

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

graph.density | Graph density | |

decompose.graph | Decompose a graph into components | |

igraph-parameters | Parameters for the igraph package | |

layout | Generate coordinates for plotting graphs | |

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

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

igraph.sample | Sampling a random integer sequence | |

kleinberg | Kleinberg's centrality scores. | |

vertex.connectivity | Vertex connectivity. | |

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

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

diameter | Diameter of a graph | |

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

get.incidence | Incidence matrix of a bipartite graph | |

forest.fire.game | Forest Fire Network Model | |

cohesive.blocks | Calculate Cohesive Blocks | |

is.multiple | Find the multiple or loop edges in a graph | |

is.mutual | Find mutual edges in a directed graph | |

girth | Girth of a graph | |

reciprocity | Reciprocity of graphs | |

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

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

iterators | Vertex and edge sequences and iterators | |

rglplot | 3D plotting of graphs with OpenGL | |

transitivity | Transitivity of a graph | |

structure.info | Gaining information about graph structure | |

traits | Graph generation based on different vertex types | |

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

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

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

evcent | Find Eigenvector Centrality Scores of Network Positions | |

permute.vertices | Permute the vertices of a graph | |

cocitation | Cocitation coupling | |

print.igraph | Print graphs to the terminal | |

constraint | Burt's constraint | |

graph.lcf | Creating a graph from LCF notation | |

Vertex shapes | Various vertex shapes when plotting igraph graphs | |

layout.drl | The DrL graph layout generator | |

subgraph | Subgraph of a graph | |

get.adjlist | Adjacency lists | |

graph.bipartite | Create a bipartite graph | |

bipartite.projection | Project a bipartite graph | |

graph.laplacian | Graph Laplacian | |

revolver | Measuring the driving force in evolving networks | |

line.graph | Line graph of a graph | |

unfold.tree | Convert a general graph into a forest | |

simplify | Simple graphs | |

edge.connectivity | Edge connectivity. | |

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

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

grg.game | Geometric random graphs | |

similarity | Similarity measures of two vertices | |

canonical.permutation | Canonical permutation of a graph | |

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

independent.vertex.sets | Independent vertex sets | |

is.bipartite | Decide whether a graph is bipartite | |

label.propagation.community | Finding communities based on propagating labels | |

plot.igraph | Plotting of graphs | |

articulation.points | Articulation points of a graph | |

graph.adjacency | Create graphs from adjacency matrices | |

igraph.undocumented | Undocumented and unsupportted igraph functions | |

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

arpack | ARPACK eigenvector calculation | |

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

degree | Degree and degree distribution of the vertices | |

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

page.rank | The Page Rank algorithm | |

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

graph.knn | Average nearest neighbor degree | |

graph.de.bruijn | De Bruijn graphs. | |

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

read.graph | Reading foreign file formats | |

graph.formula | Creating (small) graphs via a simple interface | |

graph.maxflow | Maximum flow in a network | |

graph-operators | Graph operators | |

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

Graphs from adjacency lists | Create graphs from adjacency lists | |

graph.kautz | Kautz graphs | |

rewire | Graph rewiring | |

tkigraph | Experimental basic igraph GUI | |

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

igraph-package | The igraph package | |

tkplot | Interactive plotting of graphs | |

betweenness | Vertex and edge betweenness centrality | |

graph.famous | Creating named graphs | |

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

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

triad.census | Triad census, subgraphs with three vertices | |

communities | Common functions supporting community detection algorithms | |

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

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

No Results! |

## Last month downloads

## Details

Date | Apr 10, 2009 |

License | GPL (>= 2) |

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

Repository | CRAN |

Date/Publication | 2009-05-08 11:36:36 |

Packaged | 2009-05-08 11:26:59 UTC; csardi |

#### Include our badge in your README

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