Learn R Programming

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

igraph (version 0.6.4)

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

379,721

Version

0.6.4

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

February 4th, 2013

Functions in igraph (0.6.4)

Graph, vertex and edge attributes

Burt's constraint

Vertex and edge betweenness centrality

graph.structure

Method for structural manipulation of graphs

Kleinberg's centrality scores.

Graph layout by multidimensional scaling

edge.betweenness.community

Community structure detection based on edge betweenness

dendPlot.communities

Community structure dendrogram plots

graph-operators-by-name

Graph operators based on symbolic vertex names

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

Reading foreign file formats

growing.random.game

Growing random graph generation

Fitting a power-law distribution function to discrete data

graph.diversity

Graph diversity

watts.strogatz.game

The Watts-Strogatz small-world model

Neighborhood of graph vertices

infomap.community

Infomap community finding

The Page Rank algorithm

bipartite.projection

Project a bipartite graph

Find the edge ids based on the incident vertices of the edges

Maximum flow in a network

static.power.law.game

Scale-free random graphs, from vertex fitness scores

topological.sort

Topological sorting of vertices in a graph

graph.full.bipartite

Create a full bipartite graph

Geometric random graphs

The DrL graph layout generator

Transitivity of a graph

minimal.st.separators

Minimum size vertex separators

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

is.degree.sequence

Degree sequences of graphs

Graph generation based on different vertex types

Assortativity coefficient

minimum.spanning.tree

Minimum spanning tree

community.to.membership

Common functions supporting community detection algorithms

graph-isomorphism

Graph Isomorphism

Query and download from the Nexus network repository

spinglass.community

Finding communities in graphs based on statistical meachanics

static.fitness.game

Random graphs from vertex fitness scores

Triad census, subgraphs with three vertices

Running mean of a time series

leading.eigenvector.community

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

Conversion to igraph

Spectral coarse graining

Spectral Coarse Graining

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Cocitation coupling

graph.data.frame

Creating igraph graphs from data frames or vice-versa

decompose.graph

Decompose a graph into components

graph.bipartite

Create a bipartite graph

Eccentricity and radius

K-core decomposition of graphs

graph.de.bruijn

De Bruijn graphs.

Parameters for the igraph package

cohesive.blocks

Calculate Cohesive Blocks

Breadth-first search

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

Modularity of a community structure of a graph

interconnected.islands

A graph with subgraphs that are each a random graph.

Merging graph layouts

bipartite.mapping

Decide whether a graph is bipartite

Shortest (directed or undirected) paths between vertices

layout.sugiyama

The Sugiyama graph layout generator

multilevel.community

Finding community structure by multi-level optimization of modularity

3D plotting of graphs with OpenGL

In- or out- component of a vertex

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

Closeness centrality of vertices

Connected components of a graph

Pie charts as vertices

Using pie charts as vertices in graph plots

Find Eigenvector Centrality Scores of Network Positions

Vertex and edge sequences and iterators

The igraph package

degree.sequence.game

Generate random graphs with a given degree sequence

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Convert between directed and undirected graphs

Chordality of a graph

Sampling a random integer sequence

Diameter of a graph

Hierarchical random graphs

Hierarchical random graphs

Create a random regular graph

independent.vertex.sets

Independent vertex sets

maximum.cardinality.search

Maximum cardinality search

Creating a graph from LCF notation

Simple grid layout

Generate coordinates for plotting graphs

Reciprocity of graphs

Rewires the endpoints of the edges of a graph randomly

Subgraph of a graph

SCG Extra Functions

Convert a general graph into a forest

vertex.connectivity

Vertex connectivity.

walktrap.community

Community strucure via short random walks

autocurve.edges

Optimal edge curvature when plotting graphs

dendPlot.igraphHRG

HRG dendrogram plot

Measuring the driving force in evolving networks

Average nearest neighbor degree

Incidence matrix of a bipartite graph

The igraph console

graph.automorphisms

Number of automorphisms

Print graphs to the terminal

Plotting of graphs

scgSemiProjectors

Semi-Projectors

label.propagation.community

Finding communities based on propagating labels

Experimental basic igraph GUI

Stochastic matrix of a graph

Plot dendrograms

SCG Problem Solver

Interactive plotting of graphs

contract.vertices

Contract several vertices into a single one

Find Bonacich Power Centrality Scores of Network Positions

graph.laplacian

Graph Laplacian

Find the multiple or loop edges in a graph

Similarity measures of two vertices

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

compare.communities

Compares community structures using various metrics

Convert a graph to an adjacency matrix or an edge list

Girth of a graph

igraph.undocumented

Undocumented and unsupportted igraph functions

graph.constructors

Various methods for creating graphs

graph-operators

Graph operators

Is this object a graph?

articulation.points

Articulation points of a graph

ARPACK eigenvector calculation

forest.fire.game

Forest Fire Network Model

fastgreedy.community

Community structure via greedy optimization of modularity

Dyad census of a graph

biconnected.components

Biconnected components

Depth-first search

Adjacency lists

Line graph of a graph

graph.adjacency

Create graphs from adjacency matrices

subgraph.centrality

Find subgraph centrality scores of network positions

permute.vertices

Permute the vertices of a graph

Creating named graphs

optimal.community

Optimal community structure

Convex hull of a set of vertices

Functions to deal with the result of network community detection

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Combining attributes

How igraph functions handle attributes when the graph changes

canonical.permutation

Canonical permutation of a graph

Strength or weighted vertex degree

Various vertex shapes when plotting igraph graphs

Run igraph demos, step by step

Vertex separators

Degree and degree distribution of the vertices

edge.connectivity

Edge connectivity.

Directed acyclic graphs

graph.incidence

Create graphs from an incidence matrix

minimum.size.separators

Minimum size vertex separators

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

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

Centralization of a graph.tmax

Weighted graphs

Find mutual edges in a directed graph

preference.game

Trait-based random generation

Graphs from adjacency lists

Create graphs from adjacency lists

Creating (small) graphs via a simple interface

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

Gaining information about graph structure

Writing the graph to a file in some format