# Network analysis and visualization

## Documentation for package ‘igraph’ version 0.5.3-1

- DESCRIPTION file.

## Help Pages

A B C D E F G H I L M N P R S T U V W misc

## -- --

igraph-package | The igraph package

## -- --

$.igraph.es | Vertex and edge sequences and iterators
$.igraph.vs | Vertex and edge sequences and iterators
$<-.igraph.es | Vertex and edge sequences and iterators
$<-.igraph.vs | Vertex and edge sequences and iterators
%--% | Vertex and edge sequences and iterators
%->% | Vertex and edge sequences and iterators
%<-% | Vertex and edge sequences and iterators
%c% | Graph operators
%du% | Graph operators
%m% | Graph operators
%s% | Graph operators
%u% | Graph operators

## -- A --

add.edges | Method for structural manipulation of graphs
add.vertices | Method for structural manipulation of graphs
aging.ba.game | Generate an evolving random graph with preferential attachment and aging
aging.barabasi.game | Generate an evolving random graph with preferential attachment and aging
aging.prefatt.game | Generate an evolving random graph with preferential attachment and aging
alpha.centrality | Find Bonacich alpha centrality scores of network positions
are.connected | Gaining information about graph structure
arpack | ARPACK eigenvector calculation
arpack-options | ARPACK eigenvector calculation
arpack.unpack.complex | ARPACK eigenvector calculation
articulation.points | Articulation points of a graph
as.directed | Convert between directed and undirected graphs
as.undirected | Convert between directed and undirected graphs
asymmetric.preference.game | Trait-based random generation
attributes | Graph, vertex and edge attributes
authority.score | Kleinberg's centrality scores.
average.path.length | Shortest (directed or undirected) paths between vertices

## -- B --

ba.game | Generate scale-free graphs according to the Barabasi-Albert model
barabasi.game | Generate scale-free graphs according to the Barabasi-Albert model
betweenness | Vertex and edge betweenness centrality
betweenness.estimate | Vertex and edge betweenness centrality
bibcoupling | Cocitation coupling
biconnected.components | Biconnected components
bipartite.projection | Project a bipartite graph
bipartite.projection.size | Project a bipartite graph
bonpow | Find Bonacich Power Centrality Scores of Network Positions

## -- C --

callaway.traits.game | Graph generation based on different vertex types
canonical.permutation | Canonical permutation of a graph
cited.type.game | Undocumented and unsupportted igraph functions
citing.cited.type.game | Undocumented and unsupportted igraph functions
clique.number | The functions find cliques, ie. complete subgraphs in a graph
cliques | The functions find cliques, ie. complete subgraphs in a graph
closeness | Closeness centrality of vertices
closeness.estimate | Closeness centrality of vertices
cluster.distribution | Connected components of a graph
clusters | Connected components of a graph
cocitation | Cocitation coupling
cohesive.blocks | Calculate Cohesive Blocks
communities | Common functions supporting community detection algorithms
community.le.to.membership | Community structure detecting based on the leading eigenvector of the community matrix
community.to.membership | Common functions supporting community detection algorithms
connect.neighborhood | Neighborhood of graph vertices
constraint | Burt's constraint
count.multiple | Find the multiple or loop edges in a graph

## -- D --

decompose.graph | Decompose a graph into components
degree | Degree and degree distribution of the vertices
degree.distribution | Degree and degree distribution of the vertices
degree.sequence.game | Generate random graphs with a given degree sequence
delete.edges | Method for structural manipulation of graphs
delete.vertices | Method for structural manipulation of graphs
diameter | Diameter of a graph
dyad.census | Dyad census of a graph

## -- E --

E | Vertex and edge sequences and iterators
E<- | Vertex and edge sequences and iterators
ecount | Gaining information about graph structure
edge.betweenness | Vertex and edge betweenness centrality
edge.betweenness.community | Community structure detection based on edge betweenness
edge.betweenness.community.merges | Community structure detection based on edge betweenness
edge.betweenness.estimate | Vertex and edge betweenness centrality
edge.connectivity | Edge connectivity.
edge.disjoint.paths | Edge connectivity.
erdos.renyi.game | Generate random graphs according to the Erdos-Renyi model
establishment.game | Graph generation based on different vertex types
evcent | Find Eigenvector Centrality Scores of Network Positions
evolver | Measuring the driving force in evolving networks
evolver.d | Measuring the driving force in evolving networks

## -- F --

farthest.nodes | Diameter of a graph
fastgreedy.community | Community structure via greedy optimization of modularity
forest.fire.game | Forest Fire Network Model

## -- G --

get.adjacency | Convert a graph to an adjacency matrix or an edge list
get.adjedgelist | Adjacency lists
get.adjlist | Adjacency lists
get.all.shortest.paths | Shortest (directed or undirected) paths between vertices
get.diameter | Diameter of a graph
get.edge | Gaining information about graph structure
get.edge.attribute | Graph, vertex and edge attributes
get.edgelist | Convert a graph to an adjacency matrix or an edge list
get.edges | Gaining information about graph structure
get.graph.attribute | Graph, vertex and edge attributes
get.incidence | Incidence matrix of a bipartite graph
get.shortest.paths | Shortest (directed or undirected) paths between vertices
get.vertex.attribute | Graph, vertex and edge attributes
girth | Girth of a graph
GML | Reading foreign file formats
graph | Various methods for creating graphs
graph.adhesion | Edge connectivity.
graph.adjacency | Create graphs from adjacency matrices
graph.adjlist | Create graphs from adjacency lists
graph.atlas | Various methods for creating graphs
graph.automorphisms | Number of automorphisms
graph.bipartite | Create a bipartite graph
graph.cohesion | Vertex connectivity.
graph.complementer | Graph operators
graph.compose | Graph operators
graph.constructors | Various methods for creating graphs
graph.coreness | K-core decomposition of graphs
graph.count.isomorphisms.vf2 | Graph Isomorphism
graph.count.subisomorphisms.vf2 | Graph Isomorphism
graph.data.frame | Creating igraph graphs from data frames
graph.de.bruijn | De Bruijn graphs.
graph.density | Graph density
graph.difference | Graph operators
graph.disjoint.union | Graph operators
graph.edgelist | Various methods for creating graphs
graph.empty | Various methods for creating graphs
graph.extended.chordal.ring | Various methods for creating graphs
graph.famous | Creating named graphs
graph.formula | Creating (small) graphs via a simple interface
graph.full | Various methods for creating graphs
graph.full.bipartite | Create a full bipartite graph
graph.full.citation | Various methods for creating graphs
graph.get.isomorphisms.vf2 | Graph Isomorphism
graph.get.subisomorphisms.vf2 | Graph Isomorphism
graph.graphdb | Load a graph from the graph database for testing graph isomorphism.
graph.incidence | Create graphs from an incidence matrix
graph.intersection | Graph operators
graph.isoclass | Graph Isomorphism
graph.isoclass.subgraph | Graph Isomorphism
graph.isocreate | Graph Isomorphism
graph.isomorphic | Graph Isomorphism
graph.isomorphic.34 | Graph Isomorphism
graph.isomorphic.bliss | Graph Isomorphism
graph.isomorphic.vf2 | Graph Isomorphism
graph.kautz | Kautz graphs
graph.knn | Average nearest neighbor degree
graph.laplacian | Graph Laplacian
graph.lattice | Various methods for creating graphs
graph.lcf | Creating a graph from LCF notation
graph.maxflow | Maximum flow in a network
graph.mincut | Maximum flow in a network
graph.motifs | Graph motifs
graph.motifs.est | Graph motifs
graph.motifs.no | Graph motifs
graph.neighborhood | Neighborhood of graph vertices
graph.ring | Various methods for creating graphs
graph.star | Various methods for creating graphs
graph.strength | Strength or weighted vertex degree
graph.subisomorphic.vf2 | Graph Isomorphism
graph.tree | Various methods for creating graphs
graph.union | Graph operators
GraphML | Reading foreign file formats
grg.game | Geometric random graphs
growing.random.game | Growing random graph generation

## -- H --

hub.score | Kleinberg's centrality scores.

## -- I --

igraph | The igraph package
igraph.arpack.default | ARPACK eigenvector calculation
igraph.drl.coarsen | The DrL graph layout generator
igraph.drl.coarsest | The DrL graph layout generator
igraph.drl.default | The DrL graph layout generator
igraph.drl.final | The DrL graph layout generator
igraph.drl.refine | The DrL graph layout generator
igraph.from.graphNEL | Convert igraph graphs to graphNEL objects or back
igraph.par | Parameters for the igraph package
igraph.plotting | Drawing graphs
igraph.sample | Sampling a random integer sequence
igraph.to.graphNEL | Convert igraph graphs to graphNEL objects or back
igraph.vertex.shapes | Various vertex shapes when plotting igraph graphs
independence.number | Independent vertex sets
independent.vertex.sets | Independent vertex sets
is.bgraph | Calculate Cohesive Blocks
is.bipartite | Decide whether a graph is bipartite
is.connected | Connected components of a graph
is.directed | Gaining information about graph structure
is.igraph | Is this object a graph?
is.loop | Find the multiple or loop edges in a graph
is.multiple | Find the multiple or loop edges in a graph
is.mutual | Find mutual edges in a directed graph
is.simple | Simple graphs
iterators | Vertex and edge sequences and iterators

## -- L --

label.propagation.community | Finding communities based on propagating labels
largest.cliques | The functions find cliques, ie. complete subgraphs in a graph
largest.independent.vertex.sets | Independent vertex sets
lastcit.game | Undocumented and unsupportted igraph functions
layout | Generate coordinates for plotting graphs
layout.circle | Generate coordinates for plotting graphs
layout.drl | The DrL graph layout generator
layout.fruchterman.reingold | Generate coordinates for plotting graphs
layout.fruchterman.reingold.grid | Generate coordinates for plotting graphs
layout.graphopt | Generate coordinates for plotting graphs
layout.kamada.kawai | Generate coordinates for plotting graphs
layout.lgl | Generate coordinates for plotting graphs
layout.mds | Generate coordinates for plotting graphs
layout.merge | Merging graph layouts
layout.norm | Generate coordinates for plotting graphs
layout.random | Generate coordinates for plotting graphs
layout.reingold.tilford | Generate coordinates for plotting graphs
layout.sphere | Generate coordinates for plotting graphs
layout.spring | Generate coordinates for plotting graphs
layout.svd | Generate coordinates for plotting graphs
leading.eigenvector.community | Community structure detecting based on the leading eigenvector of the community matrix
leading.eigenvector.community.naive | Community structure detecting based on the leading eigenvector of the community matrix
leading.eigenvector.community.step | Community structure detecting based on the leading eigenvector of the community matrix
LGL | Reading foreign file formats
line.graph | Line graph of a graph
list.edge.attributes | Graph, vertex and edge attributes
list.graph.attributes | Graph, vertex and edge attributes
list.vertex.attributes | Graph, vertex and edge attributes

## -- M --

maximal.cliques | The functions find cliques, ie. complete subgraphs in a graph
maximal.independent.vertex.sets | Independent vertex sets
measure.dynamics | Measuring the driving force in evolving networks
measure.dynamics.age | Measuring the driving force in evolving networks
measure.dynamics.citedcat | Measuring the driving force in evolving networks
measure.dynamics.citedcat.id.age | Measuring the driving force in evolving networks
measure.dynamics.citingcat.citedcat | Measuring the driving force in evolving networks
measure.dynamics.citingcat.id.age | Measuring the driving force in evolving networks
measure.dynamics.d.d | Measuring the driving force in evolving networks
measure.dynamics.id | Measuring the driving force in evolving networks
measure.dynamics.idage | Measuring the driving force in evolving networks
measure.dynamics.lastcit | Measuring the driving force in evolving networks
minimum.spanning.tree | Minimum spanning tree
modularity | Modularity of a community structure of a graph

## -- N --

neighborhood | Neighborhood of graph vertices
neighborhood.size | Neighborhood of graph vertices
neighbors | Gaining information about graph structure
no.clusters | Connected components of a graph

## -- P --

page.rank | The Page Rank algorithm
page.rank.old | The Page Rank algorithm
Pajek | Reading foreign file formats
path.length.hist | Shortest (directed or undirected) paths between vertices
permute.vertices | Permute the vertices of a graph
piecewise.layout | Merging graph layouts
plot.bgraph | Plot graphs and their cohesive block hierarchy
plot.igraph | Plotting of graphs
power.law.fit | Fitting a power-law distribution function to discrete data
preference.game | Trait-based random generation
print.bgraph | Print graphs to the terminal
print.igraph | Print graphs to the terminal
print.igraph.es | Vertex and edge sequences and iterators
print.igraph.vs | Vertex and edge sequences and iterators

## -- R --

random.graph.game | Generate random graphs according to the Erdos-Renyi model
read.graph | Reading foreign file formats
reciprocity | Reciprocity of graphs
remove.edge.attribute | Graph, vertex and edge attributes
remove.graph.attribute | Graph, vertex and edge attributes
remove.vertex.attribute | Graph, vertex and edge attributes
revolver | Measuring the driving force in evolving networks
revolver.ad | Measuring the driving force in evolving networks
revolver.ade | Measuring the driving force in evolving networks
revolver.adi | Measuring the driving force in evolving networks
revolver.air | Measuring the driving force in evolving networks
revolver.ar | Measuring the driving force in evolving networks
revolver.d | Measuring the driving force in evolving networks
revolver.d.d | Measuring the driving force in evolving networks
revolver.de | Measuring the driving force in evolving networks
revolver.di | Measuring the driving force in evolving networks
revolver.dl | Measuring the driving force in evolving networks
revolver.e | Measuring the driving force in evolving networks
revolver.el | Measuring the driving force in evolving networks
revolver.error.ad | Measuring the driving force in evolving networks
revolver.error.ade | Measuring the driving force in evolving networks
revolver.error.adi | Measuring the driving force in evolving networks
revolver.error.air | Measuring the driving force in evolving networks
revolver.error.ar | Measuring the driving force in evolving networks
revolver.error.d | Measuring the driving force in evolving networks
revolver.error.de | Measuring the driving force in evolving networks
revolver.error.di | Measuring the driving force in evolving networks
revolver.error.dl | Measuring the driving force in evolving networks
revolver.error.e | Measuring the driving force in evolving networks
revolver.error.el | Measuring the driving force in evolving networks
revolver.error.il | Measuring the driving force in evolving networks
revolver.error.ir | Measuring the driving force in evolving networks
revolver.error.l | Measuring the driving force in evolving networks
revolver.error.r | Measuring the driving force in evolving networks
revolver.il | Measuring the driving force in evolving networks
revolver.ir | Measuring the driving force in evolving networks
revolver.l | Measuring the driving force in evolving networks
revolver.ml.ad | Measuring the driving force in evolving networks
revolver.ml.AD.alpha.a.beta | Measuring the driving force in evolving networks
revolver.ml.AD.dpareto | Measuring the driving force in evolving networks
revolver.ml.AD.dpareto.eval | Measuring the driving force in evolving networks
revolver.ml.ade | Measuring the driving force in evolving networks
revolver.ml.ADE.alpha.a.beta | Measuring the driving force in evolving networks
revolver.ml.ADE.dpareto | Measuring the driving force in evolving networks
revolver.ml.ADE.dpareto.eval | Measuring the driving force in evolving networks
revolver.ml.ADE.dpareto.evalf | Measuring the driving force in evolving networks
revolver.ml.d | Measuring the driving force in evolving networks
revolver.ml.D.alpha | Measuring the driving force in evolving networks
revolver.ml.D.alpha.a | Measuring the driving force in evolving networks
revolver.ml.de | Measuring the driving force in evolving networks
revolver.ml.DE.alpha.a | Measuring the driving force in evolving networks
revolver.ml.df | Measuring the driving force in evolving networks
revolver.ml.f | Measuring the driving force in evolving networks
revolver.ml.l | Measuring the driving force in evolving networks
revolver.p.p | Measuring the driving force in evolving networks
revolver.probs.ad | Measuring the driving force in evolving networks
revolver.probs.ade | Measuring the driving force in evolving networks
revolver.probs.ADE.dpareto | Measuring the driving force in evolving networks
revolver.probs.d | Measuring the driving force in evolving networks
revolver.probs.de | Measuring the driving force in evolving networks
revolver.r | Measuring the driving force in evolving networks
rewire | Graph rewiring
rewire.edges | Rewires the endpoints of the edges of a graph randomly
rglplot | 3D plotting of graphs with OpenGL
rglplot.igraph | 3D plotting of graphs with OpenGL
running.mean | Running mean of a time series

## -- S --

set.edge.attribute | Graph, vertex and edge attributes
set.graph.attribute | Graph, vertex and edge attributes
set.vertex.attribute | Graph, vertex and edge attributes
shortest.paths | Shortest (directed or undirected) paths between vertices
similarity.dice | Similarity measures of two vertices
similarity.invlogweighted | Similarity measures of two vertices
similarity.jaccard | Similarity measures of two vertices
simplify | Simple graphs
spinglass.community | Finding communities in graphs based on statistical meachanics
structurally.cohesive.blocks | Calculate Cohesive Blocks
subcomponent | In- or out- component of a vertex
subgraph | Subgraph of a graph
summary.igraph | Print graphs to the terminal

## -- T --

tkigraph | Experimental basic igraph GUI
tkplot | Interactive plotting of graphs
tkplot.center | Interactive plotting of graphs
tkplot.close | Interactive plotting of graphs
tkplot.export.postscript | Interactive plotting of graphs
tkplot.fit.to.screen | Interactive plotting of graphs
tkplot.getcoords | Interactive plotting of graphs
tkplot.off | Interactive plotting of graphs
tkplot.reshape | Interactive plotting of graphs
tkplot.rotate | Interactive plotting of graphs
topological.sort | Topological sorting of vertices in a graph
transitivity | Transitivity of a graph
triad.census | Triad census, subgraphs with three vertices

## -- U --

unfold.tree | Convert a general graph into a forest

## -- V --

V | Vertex and edge sequences and iterators
V<- | Vertex and edge sequences and iterators
vcount | Gaining information about graph structure
vertex.connectivity | Vertex connectivity.
vertex.disjoint.paths | Vertex connectivity.

## -- W --

walktrap.community | Community strucure via short random walks
watts.strogatz.game | The Watts-Strogatz small-world model
write.graph | Writing the graph to a file in some format
write.pajek.bgraph | Write graphs and their cohesive block hierarchy as Pajek files

## -- misc --

[.igraph.es | Vertex and edge sequences and iterators
[.igraph.vs | Vertex and edge sequences and iterators
[<-.igraph.es | Vertex and edge sequences and iterators
[<-.igraph.vs | Vertex and edge sequences and iterators