# igraph v0.5.5-4

0

Monthly downloads

by Gabor Csardi

## Network analysis and visualization

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

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

diameter | Diameter of a graph | |

igraph-package | The igraph package | |

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

decompose.graph | Decompose a graph into components | |

layout.drl | The DrL graph layout generator | |

constraint | Burt's constraint | |

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

arpack | ARPACK eigenvector calculation | |

betweenness | Vertex and edge betweenness centrality | |

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

graph.laplacian | Graph Laplacian | |

graph.constructors | Various methods for creating graphs | |

reciprocity | Reciprocity of graphs | |

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

graph.density | Graph density | |

girth | Girth of a graph | |

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

igraph-parameters | Parameters for the igraph package | |

Drawing graphs | Drawing graphs | |

graph.bipartite | Create a bipartite graph | |

graph.knn | Average nearest neighbor degree | |

dyad.census | Dyad census of a graph | |

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

graph.maxflow | Maximum flow in a network | |

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

line.graph | Line graph of a graph | |

attributes | Graph, vertex and edge attributes | |

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

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

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

independent.vertex.sets | Independent vertex sets | |

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

cocitation | Cocitation coupling | |

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

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

cohesive.blocks | Calculate Cohesive Blocks | |

graph.kautz | Kautz graphs | |

rewire | Graph rewiring | |

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

clusters | Connected components of a graph | |

preference.game | Trait-based random generation | |

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

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

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

degree | Degree and degree distribution of the vertices | |

page.rank | The Page Rank algorithm | |

rglplot | 3D plotting of graphs with OpenGL | |

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

communities | Common functions supporting community detection algorithms | |

graph-motifs | Graph motifs | |

igraph.sample | Sampling a random integer sequence | |

print.igraph | Print graphs to the terminal | |

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

minimum.spanning.tree | Minimum spanning tree | |

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

subgraph | Subgraph of a graph | |

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

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

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

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

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

graph-operators | Graph operators | |

read.graph | Reading foreign file formats | |

simplify | Simple graphs | |

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

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

conversion between igraph and graphNEL graphs | Convert igraph graphs to graphNEL objects or back | |

tkplot | Interactive plotting of graphs | |

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

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

vertex.connectivity | Vertex connectivity. | |

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

bipartite.projection | Project a bipartite graph | |

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

graph.famous | Creating named graphs | |

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

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

evcent | Find Eigenvector Centrality Scores of Network Positions | |

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

graph-isomorphism | Graph Isomorphism | |

iterators | Vertex and edge sequences and iterators | |

graph.strength | Strength or weighted vertex degree | |

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

structure.info | Gaining information about graph structure | |

neighborhood | Neighborhood of graph vertices | |

biconnected.components | Biconnected components | |

grg.game | Geometric random graphs | |

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

layout.star | Generate coordinates to place the vertices of a graph in a star-shape | |

plot.igraph | Plotting of graphs | |

similarity | Similarity measures of two vertices | |

graph.adjacency | Create graphs from adjacency matrices | |

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

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

kleinberg | Kleinberg's centrality scores. | |

closeness | Closeness centrality of vertices | |

edge.connectivity | Edge connectivity. | |

layout | Generate coordinates for plotting graphs | |

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

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

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

canonical.permutation | Canonical permutation of a graph | |

traits | Graph generation based on different vertex types | |

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

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

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

transitivity | Transitivity of a graph | |

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

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

tkigraph | Experimental basic igraph GUI | |

articulation.points | Articulation points of a graph | |

graph.automorphisms | Number of automorphisms | |

get.adjlist | Adjacency lists | |

layout.merge | Merging graph layouts | |

No Results! |

## Last month downloads

## Details

Date | Dec 12 , 2011 |

License | GPL (>= 2) |

URL | http://igraph.sourceforge.net |

SystemRequirements | gmp, libxml2 |

Packaged | 2011-12-12 14:04:08 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2011-12-13 08:36:26 |

#### Include our badge in your README

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