# igraph v0.5.5-3

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.lcf | Creating a graph from LCF notation | |

layout.drl | The DrL graph layout generator | |

similarity | Similarity measures of two vertices | |

closeness | Closeness centrality of vertices | |

betweenness | Vertex and edge betweenness centrality | |

graph.famous | Creating named graphs | |

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

graph.maxflow | Maximum flow in a network | |

graph.density | Graph density | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

line.graph | Line graph of a graph | |

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

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

graph.laplacian | Graph Laplacian | |

kleinberg | Kleinberg's centrality scores. | |

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

plot.igraph | Plotting of graphs | |

graph.kautz | Kautz graphs | |

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

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

Drawing graphs | Drawing graphs | |

graph-motifs | Graph motifs | |

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

graph-operators | Graph operators | |

minimum.spanning.tree | Minimum spanning tree | |

graph-isomorphism | Graph Isomorphism | |

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

traits | Graph generation based on different vertex types | |

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

attributes | Graph, vertex and edge attributes | |

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

layout | Generate coordinates for plotting graphs | |

bipartite.projection | Project a bipartite graph | |

clusters | Connected components of a graph | |

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

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

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

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

girth | Girth of a graph | |

graph.bipartite | Create a bipartite graph | |

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

read.graph | Reading foreign file formats | |

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

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

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

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

print.igraph | Print graphs to the terminal | |

preference.game | Trait-based random generation | |

structure.info | Gaining information about graph structure | |

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

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

constraint | Burt's constraint | |

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

transitivity | Transitivity of a graph | |

graph.adjacency | Create graphs from adjacency matrices | |

subgraph | Subgraph of a graph | |

rglplot | 3D plotting of graphs with OpenGL | |

graph.strength | Strength or weighted vertex degree | |

neighborhood | Neighborhood of graph vertices | |

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

tkplot | Interactive plotting of graphs | |

independent.vertex.sets | Independent vertex sets | |

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

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

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

igraph-package | The igraph package | |

canonical.permutation | Canonical permutation of a graph | |

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

cohesive.blocks | Calculate Cohesive Blocks | |

get.adjlist | Adjacency lists | |

diameter | Diameter of a graph | |

grg.game | Geometric random graphs | |

vertex.connectivity | Vertex connectivity. | |

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

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

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

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

graph.knn | Average nearest neighbor degree | |

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

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

simplify | Simple graphs | |

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

cocitation | Cocitation coupling | |

decompose.graph | Decompose a graph into components | |

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

igraph.sample | Sampling a random integer sequence | |

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

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

communities | Common functions supporting community detection algorithms | |

dyad.census | Dyad census of a graph | |

edge.connectivity | Edge connectivity. | |

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

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

igraph-parameters | Parameters for the igraph package | |

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

reciprocity | Reciprocity of graphs | |

rewire | Graph rewiring | |

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

biconnected.components | Biconnected components | |

arpack | ARPACK eigenvector calculation | |

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

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

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

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

tkigraph | Experimental basic igraph GUI | |

page.rank | The Page Rank algorithm | |

graph.automorphisms | Number of automorphisms | |

articulation.points | Articulation points of a graph | |

degree | Degree and degree distribution of the vertices | |

graph.constructors | Various methods for creating graphs | |

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

iterators | Vertex and edge sequences and iterators | |

layout.merge | Merging graph layouts | |

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

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

No Results! |

## Last month downloads

## Details

Date | Oct 18 , 2011 |

License | GPL (>= 2) |

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

SystemRequirements | gmp, libxml2 |

Packaged | 2011-10-19 00:30:59 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2011-10-20 08:47:43 |

#### Include our badge in your README

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