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

bipartite.projection | Project a bipartite graph | |

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

constraint | Burt's constraint | |

graph-motifs | Graph motifs | |

grg.game | Geometric random graphs | |

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

igraph-package | The igraph package | |

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

graph.bipartite | Create a bipartite graph | |

tkplot | Interactive plotting of graphs | |

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

decompose.graph | Decompose a graph into components | |

graph.laplacian | Graph Laplacian | |

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

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

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

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

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

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

layout.merge | Merging graph layouts | |

diameter | Diameter of a graph | |

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

girth | Girth of a graph | |

get.adjlist | Adjacency lists | |

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

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

similarity | Similarity measures of two vertices | |

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

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

layout | Generate coordinates for plotting graphs | |

Drawing graphs | Drawing graphs | |

cohesive.blocks | Calculate Cohesive Blocks | |

kleinberg | Kleinberg's centrality scores. | |

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

graph-operators | Graph operators | |

subgraph | Subgraph of a graph | |

tkigraph | Experimental basic igraph GUI | |

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

reciprocity | Reciprocity of graphs | |

igraph-parameters | Parameters for the igraph package | |

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

clusters | Connected components of a graph | |

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

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

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

graph.automorphisms | Number of automorphisms | |

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

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

graph.constructors | Various methods for creating graphs | |

graph.famous | Creating named graphs | |

graph.knn | Average nearest neighbor degree | |

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

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

line.graph | Line graph of a graph | |

betweenness | Vertex and edge betweenness centrality | |

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

minimum.spanning.tree | Minimum spanning tree | |

read.graph | Reading foreign file formats | |

rewire | Graph rewiring | |

communities | Common functions supporting community detection algorithms | |

plot.igraph | Plotting of graphs | |

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

degree | Degree and degree distribution of the vertices | |

articulation.points | Articulation points of a graph | |

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

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

graph.strength | Strength or weighted vertex degree | |

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

print.igraph | Print graphs to the terminal | |

graph-isomorphism | Graph Isomorphism | |

graph.density | Graph density | |

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

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

transitivity | Transitivity of a graph | |

iterators | Vertex and edge sequences and iterators | |

arpack | ARPACK eigenvector calculation | |

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

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

cocitation | Cocitation coupling | |

layout.drl | The DrL graph layout generator | |

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

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

edge.connectivity | Edge connectivity. | |

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

page.rank | The Page Rank algorithm | |

graph.kautz | Kautz graphs | |

structure.info | Gaining information about graph structure | |

traits | Graph generation based on different vertex types | |

neighborhood | Neighborhood of graph vertices | |

simplify | Simple graphs | |

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

canonical.permutation | Canonical permutation of a graph | |

independent.vertex.sets | Independent vertex sets | |

igraph.sample | Sampling a random integer sequence | |

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

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

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

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

preference.game | Trait-based random generation | |

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

biconnected.components | Biconnected components | |

attributes | Graph, vertex and edge attributes | |

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

dyad.census | Dyad census of a graph | |

graph.adjacency | Create graphs from adjacency matrices | |

rglplot | 3D plotting of graphs with OpenGL | |

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

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

vertex.connectivity | Vertex connectivity. | |

closeness | Closeness centrality of vertices | |

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

evcent | Find Eigenvector Centrality Scores of Network Positions | |

graph.maxflow | Maximum flow in a network | |

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

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

No Results! |

## Last month downloads

## Details

Date | Aug 19, 2010 |

License | GPL (>= 2) |

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

SystemRequirements | gmp, libxml2 |

Packaged | 2010-08-19 11:17:23 UTC; gaborcsardi |

Repository | CRAN |

Date/Publication | 2010-08-19 12:12:22 |

#### Include our badge in your README

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