# igraph v0.7.0

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

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

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

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

graph-motifs | Graph motifs | |

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

graph.bipartite | Create a bipartite graph | |

igraphtest | Run package tests | |

is.dag | Directed acyclic graphs | |

graph.automorphisms | Number of automorphisms | |

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

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

Hierarchical random graphs | Hierarchical random graphs | |

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

igraph-package | The igraph package | |

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

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

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

graph.difference | Difference of graphs | |

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

cocitation | Cocitation coupling | |

cohesive.blocks | Calculate Cohesive Blocks | |

line.graph | Line graph of a graph | |

sbm.game | Sample stochastic block model | |

simplify | Simple graphs | |

scgExtra | SCG Extra Functions | |

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

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

graph.famous | Creating named graphs | |

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

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

attributes | Graph, vertex and edge attributes | |

infomap.community | Infomap community finding | |

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

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

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

is.separator | Vertex separators | |

igraph options | Parameters for the igraph package | |

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

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

layout.sugiyama | The Sugiyama graph layout generator | |

get.adjlist | Adjacency lists | |

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

similarity | Similarity measures of two vertices | |

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

graph.eigen | Eigenvalues and eigenvectors of the adjacency matrix of a graph | |

layout.mds | Graph layout by multidimensional scaling | |

graph.maxflow | Maximum flow in a network | |

igraph.version | Query igraph's version string | |

read.graph | Reading foreign file formats | |

rewire | Graph rewiring | |

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

closeness | Closeness centrality of vertices | |

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

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

graph.diversity | Graph diversity | |

layout.drl | The DrL graph layout generator | |

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

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

graph.union | Union of graphs | |

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

as.igraph | Conversion to igraph | |

bipartite.projection | Project a bipartite graph | |

is.weighted | Weighted graphs | |

graph.knn | Average nearest neighbor degree | |

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

igraph console | The igraph console | |

kleinberg | Kleinberg's centrality scores. | |

graph.disjoint.union | Disjoint union of graphs | |

grg.game | Geometric random graphs | |

graph.dfs | Depth-first search | |

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

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

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

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

preference.game | Trait-based random generation | |

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

maximum.cardinality.search | Maximum cardinality search | |

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

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

subgraph | Subgraph of a graph | |

traits | Graph generation based on different vertex types | |

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

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

dendPlot | Plot dendrograms | |

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

constraint | Burt's constraint | |

graph.density | Graph density | |

dendPlot.communities | Community structure dendrogram plots | |

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

is.chordal | Chordality of a graph | |

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

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

plot.igraph | Plotting of graphs | |

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

assortativity | Assortativity coefficient | |

canonical.permutation | Canonical permutation of a graph | |

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

adjacent.triangles | Count adjacenct triangles | |

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

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

betweenness | Vertex and edge betweenness centrality | |

biconnected.components | Biconnected components | |

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

graph.complementer | Complementer of a graph | |

arpack | ARPACK eigenvector calculation | |

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

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

girth | Girth of a graph | |

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

independent.vertex.sets | Independent vertex sets | |

iterators | Vertex and edge sequences and iterators | |

layout | Generate coordinates for plotting graphs | |

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

tkplot | Interactive plotting of graphs | |

get.stochastic | Stochastic matrix of a graph | |

structure.info | Gaining information about graph structure | |

diameter | Diameter of a graph | |

eccentricity | Eccentricity and radius | |

evcent | Find Eigenvector Centrality Scores of Network Positions | |

tkigraph | Experimental basic igraph GUI | |

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

is.named | Named graphs | |

igraphdemo | Run igraph demos, step by step | |

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

graph.intersection | Intersection of graphs | |

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

neighborhood | Neighborhood of graph vertices | |

transitivity | Transitivity of a graph | |

graph.matching | Graph matching | |

plot.sir | Plotting the results on multiple SIR model runs | |

scgGrouping | SCG Problem Solver | |

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

bipartite.random.game | Bipartite random graphs | |

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

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

Graphlets | Graphlet decomposition of a graph | |

graph.constructors | Various methods for creating graphs | |

layout.bipartite | Simple two-row layout for bipartite graphs | |

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

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

graph.compose | Compose two graphs as binary relations | |

layout.grid | Simple grid layout | |

sir | SIR model on graphs | |

srand | Set random seed of the C library's RNG | |

decompose.graph | Decompose a graph into components | |

print.igraph | Print graphs to the terminal | |

dominator.tree | Dominator tree | |

igraph.undocumented | Undocumented and unsupportted igraph functions | |

vertex.connectivity | Vertex connectivity. | |

clusters | Connected components of a graph | |

graph.laplacian | Graph Laplacian | |

scgSemiProjectors | Semi-Projectors | |

dyad.census | Dyad census of a graph | |

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

Spectral coarse graining | Spectral Coarse Graining | |

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

centralization | Centralization of a graph.tmax | |

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

dendPlot.igraphHRG | HRG dendrogram plot | |

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

rglplot | 3D plotting of graphs with OpenGL | |

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

layout.merge | Merging graph layouts | |

page.rank | The Page Rank algorithm | |

articulation.points | Articulation points of a graph | |

Drawing graphs | Drawing graphs | |

igraph.sample | Sampling a random integer sequence | |

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

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

degree | Degree and degree distribution of the vertices | |

graph.adjacency | Create graphs from adjacency matrices | |

edge.connectivity | Edge connectivity. | |

revolver | Measuring the driving force in evolving networks | |

graph.bfs | Breadth-first search | |

graph.strength | Strength or weighted vertex degree | |

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

minimum.spanning.tree | Minimum spanning tree | |

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

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

graph-isomorphism | Graph Isomorphism | |

graph.kautz | Kautz graphs | |

optimal.community | Optimal community structure | |

reciprocity | Reciprocity of graphs | |

No Results! |

## Last month downloads

## Details

Date | 2014-02-04 |

License | GPL (>= 2) |

URL | http://igraph.org |

SystemRequirements | gmp, libxml2 |

BugReports | https://github.com/igraph/igraph/issues |

Packaged | 2014-02-04 21:57:23 UTC; gaborcsardi |

NeedsCompilation | yes |

Repository | CRAN |

Date/Publication | 2014-02-05 08:45:17 |

#### Include our badge in your README

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