# igraph v0.5.5-2

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

betweenness | Vertex and edge betweenness centrality | |

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

constraint | Burt's constraint | |

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

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

articulation.points | Articulation points of a graph | |

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

graph.laplacian | Graph Laplacian | |

closeness | Closeness centrality of vertices | |

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

diameter | Diameter of a graph | |

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

graph.constructors | Various methods for creating graphs | |

graph.famous | Creating named graphs | |

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

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

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

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

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

bipartite.projection | Project a bipartite graph | |

graph.knn | Average nearest neighbor degree | |

decompose.graph | Decompose a graph into components | |

graph.kautz | Kautz graphs | |

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

subgraph | Subgraph of a graph | |

communities | Common functions supporting community detection algorithms | |

canonical.permutation | Canonical permutation of a graph | |

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

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

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

graph.strength | Strength or weighted vertex degree | |

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

neighborhood | Neighborhood of graph vertices | |

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

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

independent.vertex.sets | Independent vertex sets | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

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

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

Drawing graphs | Drawing graphs | |

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

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

structure.info | Gaining information about graph structure | |

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

graph-motifs | Graph motifs | |

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

preference.game | Trait-based random generation | |

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

attributes | Graph, vertex and edge attributes | |

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

dyad.census | Dyad census of a graph | |

kleinberg | Kleinberg's centrality scores. | |

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

igraph-parameters | Parameters for the igraph package | |

iterators | Vertex and edge sequences and iterators | |

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

layout.merge | Merging graph layouts | |

edge.connectivity | Edge connectivity. | |

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

vertex.connectivity | Vertex connectivity. | |

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

graph.maxflow | Maximum flow in a network | |

degree | Degree and degree distribution of the vertices | |

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

rglplot | 3D plotting of graphs with OpenGL | |

graph.bipartite | Create a bipartite graph | |

biconnected.components | Biconnected components | |

minimum.spanning.tree | Minimum spanning tree | |

get.adjlist | Adjacency lists | |

graph.automorphisms | Number of automorphisms | |

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

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

traits | Graph generation based on different vertex types | |

girth | Girth of a graph | |

clusters | Connected components of a graph | |

similarity | Similarity measures of two vertices | |

graph-isomorphism | Graph Isomorphism | |

layout.drl | The DrL graph layout generator | |

page.rank | The Page Rank algorithm | |

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

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

igraph.sample | Sampling a random integer sequence | |

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

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

rewire | Graph rewiring | |

graph-operators | Graph operators | |

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

reciprocity | Reciprocity of graphs | |

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

read.graph | Reading foreign file formats | |

simplify | Simple graphs | |

grg.game | Geometric random graphs | |

plot.igraph | Plotting of graphs | |

arpack | ARPACK eigenvector calculation | |

graph.density | Graph density | |

print.igraph | Print graphs to the terminal | |

tkigraph | Experimental basic igraph GUI | |

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

cohesive.blocks | Calculate Cohesive Blocks | |

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

igraph-package | The igraph package | |

cocitation | Cocitation coupling | |

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

layout | Generate coordinates for plotting graphs | |

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

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

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

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

graph.adjacency | Create graphs from adjacency matrices | |

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

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

line.graph | Line graph of a graph | |

transitivity | Transitivity of a graph | |

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

tkplot | Interactive plotting of graphs | |

No Results! |

## Last month downloads

## Details

Date | Mar 21 , 2011 |

License | GPL (>= 2) |

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

SystemRequirements | gmp, libxml2 |

Packaged | 2011-03-21 16:13:28 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2011-03-21 17:32:37 |

#### Include our badge in your README

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