# igraph v0.5.1

0

Monthly downloads

by Gabor Csardi

## Routines for simple graphs, network analysis.

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

layout.drl | The DrL graph layout generator | |

minimum.spanning.tree | Minimum spanning tree | |

plot.igraph | Plotting of graphs | |

subgraph | Subgraph of a graph | |

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

communities | Common functions supporting community detection algorithms | |

graph.density | Graph density | |

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

graph-isomorphism | Graph Isomorphism | |

read.graph | Reading foreign file formats | |

canonical.permutation | Canonical permutation of a graph | |

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

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

biconnected.components | Biconnected components | |

graph.kautz | Kautz graphs | |

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

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

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

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

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

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

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

traits | Graph generation based on different vertex types | |

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

Drawing graphs | Drawing graphs | |

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

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

revolver | Measuring the driving force in evolving networks | |

graph-motifs | Graph motifs | |

line.graph | Line graph of a graph | |

transitivity | Transitivity of a graph | |

graph-operators | Graph operators | |

closeness | Closeness centrality of vertices | |

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

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

rewire | Graph rewiring | |

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

kleinberg | Kleinberg's centrality scores. | |

tkplot | Interactive plotting of graphs | |

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

graph.adjacency | Create graphs from adjacency matrices | |

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

layout | Generate coordinates for plotting graphs | |

page.rank | The Page Rank algorithm | |

dyad.census | Dyad census of a graph | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

rglplot | 3D plotting of graphs with OpenGL | |

clusters | Connected components of a graph | |

girth | Girth of a graph | |

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

neighborhood | Neighborhood of graph vertices | |

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

igraph-parameters | Parameters for the igraph package | |

iterators | Vertex and edge sequences and iterators | |

articulation.points | Articulation points of a graph | |

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

constraint | Burt's constraint | |

similarity | Similarity measures of two vertices | |

diameter | Diameter of a graph | |

graph.constructors | Various methods for creating graphs | |

graph.famous | Creating named graphs | |

preference.game | Trait-based random generation | |

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

igraph.sample | Sampling a random integer sequence | |

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

betweenness | Vertex and edge betweenness centrality | |

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

vertex.connectivity | Vertex connectivity. | |

print.igraph | Print graphs to the terminal | |

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

measure.dynamics | Measuring the driving force in evolving networks | |

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

arpack | ARPACK eigenvector calculation | |

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

graph.maxflow | Maximum flow in a network | |

igraph.undocumented | Undocumented and unsupportted igraph functions | |

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

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

layout.merge | Merging graph layouts | |

igraph-package | The igraph package | |

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

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

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

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

structure.info | Gaining information about graph structure | |

graph.automorphisms | Number of automorphisms | |

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

cocitation | Cocitation coupling | |

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

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

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

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

simplify | Simple graphs | |

cohesive.blocks | Calculate Cohesive Blocks | |

get.adjlist | Adjacency lists | |

decompose.graph | Decompose a graph into components | |

edge.connectivity | Edge connectivity. | |

reciprocity | Reciprocity of graphs | |

graph.laplacian | Graph Laplacian | |

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

grg.game | Geometric random graphs | |

independent.vertex.sets | Independent vertex sets | |

attributes | Graph, vertex and edge attributes | |

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

degree | Degree and degree distribution of the vertices | |

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

bipartite.projection | Project a bipartite graph | |

graph.strength | Strength or weighted vertex degree | |

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

graph.bipartite | Create a bipartite graph | |

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

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

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

tkigraph | Experimental basic igraph GUI | |

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

graph.knn | Average nearest neighbor degree | |

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

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

No Results! |

## Last month downloads

## Details

Date | Feb 14, 2008 |

License | GPL (>= 2) |

URL | http://cneurocvs.rmki.kfki.hu/igraph |

Packaged | Sat Jul 12 12:44:04 2008; csardi |

#### Include our badge in your README

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