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

Spectral coarse graining | Spectral Coarse Graining | |

convex.hull | Convex hull of a set of vertices | |

biconnected.components | Biconnected components | |

compare.communities | Compares community structures using various metrics | |

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

closeness | Closeness centrality of vertices | |

eccentricity | Eccentricity and radius | |

dendPlot.igraphHRG | HRG dendrogram plot | |

community.to.membership | Common functions supporting community detection algorithms | |

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

contract.vertices | Contract several vertices into a single one | |

get.adjlist | Adjacency lists | |

attributes | Graph, vertex and edge attributes | |

diameter | Diameter of a graph | |

autocurve.edges | Optimal edge curvature when plotting graphs | |

stMincuts | List all minimum $(s,t)$-cuts of a graph | |

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

evcent | Find Eigenvector Centrality Scores of Network Positions | |

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

graph.data.frame | Creating igraph graphs from data frames or vice-versa | |

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

dyad.census | Dyad census of a graph | |

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

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

graph.density | Graph density | |

assortativity | Assortativity coefficient | |

betweenness | Vertex and edge betweenness centrality | |

dendPlot | Plot dendrograms | |

communities | Functions to deal with the result of network community detection | |

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

page.rank | The Page Rank algorithm | |

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

graph.knn | Average nearest neighbor degree | |

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

graph-isomorphism | Graph Isomorphism | |

graph.strength | Strength or weighted vertex degree | |

preference.game | Trait-based random generation | |

girth | Girth of a graph | |

articulation.points | Articulation points of a graph | |

iterators | Vertex and edge sequences and iterators | |

k.regular.game | Create a random regular graph | |

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

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

graph-motifs | Graph motifs | |

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

graph.diversity | Graph diversity | |

dominator.tree | Dominator tree | |

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

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

static.power.law.game | Scale-free random graphs, from vertex fitness scores | |

is.dag | Directed acyclic graphs | |

grg.game | Geometric random graphs | |

graph.bfs | Breadth-first search | |

graph.adjacency | Create graphs from adjacency matrices | |

arpack | ARPACK eigenvector calculation | |

infomap.community | Infomap community finding | |

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

graph.laplacian | Graph Laplacian | |

Combining attributes | How igraph functions handle attributes when the graph changes | |

graph.maxflow | Maximum flow in a network | |

layout.drl | The DrL graph layout generator | |

layout.grid | Simple grid layout | |

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

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

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

is.chordal | Chordality of a graph | |

layout.merge | Merging graph layouts | |

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

graph.kautz | Kautz graphs | |

Pie charts as vertices | Using pie charts as vertices in graph plots | |

interconnected.islands | A graph with subgraphs that are each a random graph. | |

multilevel.community | Finding community structure by multi-level optimization of modularity | |

scgExtra | SCG Extra Functions | |

layout.sugiyama | The Sugiyama graph layout generator | |

clusters | Connected components of a graph | |

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

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

plot.igraph | Plotting of graphs | |

vertex.connectivity | Vertex connectivity. | |

Drawing graphs | Drawing graphs | |

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

graph.matching | Graph matching | |

maximum.cardinality.search | Maximum cardinality search | |

tkplot | Interactive plotting of graphs | |

Hierarchical random graphs | Hierarchical random graphs | |

structure.info | Gaining information about graph structure | |

reciprocity | Reciprocity of graphs | |

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

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

print.igraph | Print graphs to the terminal | |

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

transitivity | Transitivity of a graph | |

get.edge.ids | Find the edge ids based on the incident vertices of the edges | |

traits | Graph generation based on different vertex types | |

read.graph | Reading foreign file formats | |

rewire | Graph rewiring | |

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

get.stochastic | Stochastic matrix of a graph | |

degree | Degree and degree distribution of the vertices | |

rglplot | 3D plotting of graphs with OpenGL | |

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

is.degree.sequence | Degree sequences of graphs | |

is.named | Named graphs | |

minimum.spanning.tree | Minimum spanning tree | |

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

graph.automorphisms | Number of automorphisms | |

igraph.sample | Sampling a random integer sequence | |

simplify | Simple graphs | |

graph-operators-by-name | Graph operators based on symbolic vertex names | |

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

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

graph.dfs | Depth-first search | |

subgraph | Subgraph of a graph | |

scgGrouping | SCG Problem Solver | |

optimal.community | Optimal community structure | |

subgraph.centrality | Find subgraph centrality scores of network positions | |

static.fitness.game | Random graphs from vertex fitness scores | |

stCuts | List all (s,t)-cuts of a graph | |

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

nexus | Query and download from the Nexus network repository | |

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

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

is.separator | Vertex separators | |

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

tkigraph | Experimental basic igraph GUI | |

kleinberg | Kleinberg's centrality scores. | |

layout | Generate coordinates for plotting graphs | |

layout.mds | Graph layout by multidimensional scaling | |

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

igraph-package | The igraph package | |

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

scg | All-in-one Function for the SCG of Matrices and Graphs | |

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

cocitation | Cocitation coupling | |

revolver | Measuring the driving force in evolving networks | |

graph.constructors | Various methods for creating graphs | |

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

canonical.permutation | Canonical permutation of a graph | |

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

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

bipartite.projection | Project a bipartite graph | |

is.weighted | Weighted graphs | |

neighborhood | Neighborhood of graph vertices | |

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

line.graph | Line graph of a graph | |

minimal.st.separators | Minimum size vertex separators | |

igraph console | The igraph console | |

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

edge.connectivity | Edge connectivity. | |

graph.bipartite | Create a bipartite graph | |

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

independent.vertex.sets | Independent vertex sets | |

igraph.undocumented | Undocumented and unsupportted igraph functions | |

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

scgSemiProjectors | Semi-Projectors | |

decompose.graph | Decompose a graph into components | |

as.igraph | Conversion to igraph | |

cohesive.blocks | Calculate Cohesive Blocks | |

dendPlot.communities | Community structure dendrogram plots | |

igraphdemo | Run igraph demos, step by step | |

similarity | Similarity measures of two vertices | |

centralization | Centralization of a graph.tmax | |

constraint | Burt's constraint | |

graph.famous | Creating named graphs | |

minimum.size.separators | Minimum size vertex separators | |

graph-operators | Graph operators | |

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

igraph options | Parameters for the igraph package | |

No Results! |

## Last month downloads

## Details

Date | 2013-05-16 |

License | GPL (>= 2) |

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

SystemRequirements | gmp, libxml2 |

Packaged | 2013-05-23 13:11:38 UTC; gaborcsardi |

NeedsCompilation | yes |

Repository | CRAN |

Date/Publication | 2013-05-23 17:39:35 |

#### Include our badge in your README

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