Learn R Programming

⚠️There's a newer version (1.3.5) of this package.Take me there.

igraph (version 0.5.3)

Network analysis and visualization

Description

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.

Copy Link

Version

Install

install.packages('igraph')

Monthly Downloads

555,428

Version

0.5.3

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

November 22nd, 2009

Functions in igraph (0.5.3)

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

The DrL graph layout generator

Maximum flow in a network

Gaining information about graph structure

walktrap.community

Community strucure via short random walks

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

ARPACK eigenvector calculation

Measuring the driving force in evolving networks

Sampling a random integer sequence

minimum.spanning.tree

Minimum spanning tree

graph.de.bruijn

De Bruijn graphs.

articulation.points

Articulation points of a graph

Kleinberg's centrality scores.

growing.random.game

Growing random graph generation

Find mutual edges in a directed graph

Graph, vertex and edge attributes

write.pajek.bgraph

Write graphs and their cohesive block hierarchy as Pajek files

Creating named graphs

Generate coordinates for plotting graphs

Reading foreign file formats

graph.automorphisms

Number of automorphisms

edge.betweenness.community

Community structure detection based on edge betweenness

graph.incidence

Create graphs from an incidence matrix

igraph from/to graphNEL conversion

Convert igraph graphs to graphNEL objects or back

Subgraph of a graph

Burt's constraint

graph-isomorphism

Graph Isomorphism

Find Eigenvector Centrality Scores of Network Positions

watts.strogatz.game

The Watts-Strogatz small-world model

Find the multiple or loop edges in a graph

Various vertex shapes when plotting igraph graphs

degree.sequence.game

Generate random graphs with a given degree sequence

Strength or weighted vertex degree

Plotting of graphs

Degree and degree distribution of the vertices

Decide whether a graph is bipartite

Similarity measures of two vertices

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

preference.game

Trait-based random generation

graph.laplacian

Graph Laplacian

Graph generation based on different vertex types

graph.adjacency

Create graphs from adjacency matrices

Interactive plotting of graphs

Triad census, subgraphs with three vertices

Generate scale-free graphs according to the Barabasi-Albert model

Find Bonacich Power Centrality Scores of Network Positions

Reciprocity of graphs

Diameter of a graph

In- or out- component of a vertex

decompose.graph

Decompose a graph into components

fastgreedy.community

Community structure via greedy optimization of modularity

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Graphs from adjacency lists

Create graphs from adjacency lists

Creating a graph from LCF notation

Convert a graph to an adjacency matrix or an edge list

label.propagation.community

Finding communities based on propagating labels

Running mean of a time series

Closeness centrality of vertices

Writing the graph to a file in some format

Girth of a graph

K-core decomposition of graphs

Transitivity of a graph

leading.eigenvector.community

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

permute.vertices

Permute the vertices of a graph

Is this object a graph?

Convert between directed and undirected graphs

Print graphs to the terminal

Neighborhood of graph vertices

Fitting a power-law distribution function to discrete data

Line graph of a graph

Shortest (directed or undirected) paths between vertices

bipartite.projection

Project a bipartite graph

Cocitation coupling

edge.connectivity

Edge connectivity.

biconnected.components

Biconnected components

Vertex and edge betweenness centrality

graph.data.frame

Creating igraph graphs from data frames

graph.full.bipartite

Create a full bipartite graph

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Merging graph layouts

Incidence matrix of a bipartite graph

Rewires the endpoints of the edges of a graph randomly

The Page Rank algorithm

canonical.permutation

Canonical permutation of a graph

Geometric random graphs

Convert a general graph into a forest

vertex.connectivity

Vertex connectivity.

graph-operators

Graph operators

The igraph package

cohesive.blocks

Calculate Cohesive Blocks

Common functions supporting community detection algorithms

graph.structure

Method for structural manipulation of graphs

graph.constructors

Various methods for creating graphs

Creating (small) graphs via a simple interface

Connected components of a graph

graph.bipartite

Create a bipartite graph

Adjacency lists

Dyad census of a graph

Average nearest neighbor degree

3D plotting of graphs with OpenGL

spinglass.community

Finding communities in graphs based on statistical meachanics

forest.fire.game

Forest Fire Network Model

independent.vertex.sets

Independent vertex sets

Modularity of a community structure of a graph

Plot graphs and their cohesive block hierarchy

Experimental basic igraph GUI

measure.dynamics

Measuring the driving force in evolving networks

igraph-parameters

Parameters for the igraph package

igraph.undocumented

Undocumented and unsupportted igraph functions

Vertex and edge sequences and iterators

topological.sort

Topological sorting of vertices in a graph