# igraph v0.5.5-1

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

cocitation | Cocitation coupling | |

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

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

kleinberg | Kleinberg's centrality scores. | |

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

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

plot.igraph | Plotting of graphs | |

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

rglplot | 3D plotting of graphs with OpenGL | |

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

grg.game | Geometric random graphs | |

subgraph | Subgraph of a graph | |

diameter | Diameter of a graph | |

arpack | ARPACK eigenvector calculation | |

graph-motifs | Graph motifs | |

igraph-package | The igraph package | |

page.rank | The Page Rank algorithm | |

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

biconnected.components | Biconnected components | |

clusters | Connected components of a graph | |

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

simplify | Simple graphs | |

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

graph-isomorphism | Graph Isomorphism | |

graph.maxflow | Maximum flow in a network | |

line.graph | Line graph of a graph | |

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

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

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

graph.bipartite | Create a bipartite graph | |

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

articulation.points | Articulation points of a graph | |

independent.vertex.sets | Independent vertex sets | |

cohesive.blocks | Calculate Cohesive Blocks | |

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

canonical.permutation | Canonical permutation of a graph | |

print.igraph | Print graphs to the terminal | |

graph.constructors | Various methods for creating graphs | |

structure.info | Gaining information about graph structure | |

attributes | Graph, vertex and edge attributes | |

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

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

tkplot | Interactive plotting of graphs | |

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

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

transitivity | Transitivity of a graph | |

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

get.adjlist | Adjacency lists | |

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

neighborhood | Neighborhood of graph vertices | |

edge.connectivity | Edge connectivity. | |

graph.density | Graph density | |

rewire | Graph rewiring | |

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

graph.strength | Strength or weighted vertex degree | |

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

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

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

vertex.connectivity | Vertex connectivity. | |

degree | Degree and degree distribution of the vertices | |

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

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

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

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

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

reciprocity | Reciprocity of graphs | |

communities | Common functions supporting community detection algorithms | |

Drawing graphs | Drawing graphs | |

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

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

traits | Graph generation based on different vertex types | |

closeness | Closeness centrality of vertices | |

constraint | Burt's constraint | |

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

graph.famous | Creating named graphs | |

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

graph.kautz | Kautz graphs | |

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

layout | Generate coordinates for plotting graphs | |

layout.drl | The DrL graph layout generator | |

girth | Girth of a graph | |

graph.knn | Average nearest neighbor degree | |

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

similarity | Similarity measures of two vertices | |

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

dyad.census | Dyad census of a graph | |

graph.laplacian | Graph Laplacian | |

layout.merge | Merging graph layouts | |

graph-operators | Graph operators | |

tkigraph | Experimental basic igraph GUI | |

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

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

graph.automorphisms | Number of automorphisms | |

iterators | Vertex and edge sequences and iterators | |

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

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

bipartite.projection | Project a bipartite graph | |

decompose.graph | Decompose a graph into components | |

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

evcent | Find Eigenvector Centrality Scores of Network Positions | |

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

igraph-parameters | Parameters for the igraph package | |

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

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

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

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

igraph.sample | Sampling a random integer sequence | |

preference.game | Trait-based random generation | |

read.graph | Reading foreign file formats | |

graph.adjacency | Create graphs from adjacency matrices | |

betweenness | Vertex and edge betweenness centrality | |

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

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

minimum.spanning.tree | Minimum spanning tree | |

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

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

No Results! |

## Last month downloads

## Details

Date | Dec 17, 2010 |

License | GPL (>= 2) |

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

SystemRequirements | gmp, libxml2 |

Repository | CRAN |

Date/Publication | 2010-12-17 07:35:39 |

Packaged | 2010-12-17 00:24:53 UTC; gaborcsardi |

#### Include our badge in your README

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