Learn R Programming

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

igraph (version 0.7.0)

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

432,884

Version

0.7.0

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

February 5th, 2014

Functions in igraph (0.7.0)

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Convert between directed and undirected graphs

compare.communities

Compares community structures using various metrics

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

graph.bipartite

Create a bipartite graph

Run package tests

Directed acyclic graphs

graph.automorphisms

Number of automorphisms

Functions to deal with the result of network community detection

Create a random regular graph

Hierarchical random graphs

Hierarchical random graphs

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

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

Query and download from the Nexus network repository

Cocitation coupling

cohesive.blocks

Calculate Cohesive Blocks

Line graph of a graph

Sample stochastic block model

SCG Extra Functions

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

Triad census, subgraphs with three vertices

Creating named graphs

Creating a graph from LCF notation

K-core decomposition of graphs

Graph, vertex and edge attributes

infomap.community

Infomap community finding

Pie charts as vertices

Using pie charts as vertices in graph plots

Convert a graph to an adjacency matrix or an edge list

Convert a general graph into a forest

Vertex separators

Parameters for the igraph package

Various vertex shapes when plotting igraph graphs

Find mutual edges in a directed graph

layout.sugiyama

The Sugiyama graph layout generator

Adjacency lists

fastgreedy.community

Community structure via greedy optimization of modularity

Similarity measures of two vertices

static.power.law.game

Scale-free random graphs, from vertex fitness scores

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Graph layout by multidimensional scaling

Maximum flow in a network

Query igraph's version string

Reading foreign file formats

static.fitness.game

Random graphs from vertex fitness scores

Closeness centrality of vertices

Rewires the endpoints of the edges of a graph randomly

watts.strogatz.game

The Watts-Strogatz small-world model

graph.diversity

Graph diversity

The DrL graph layout generator

topological.sort

Topological sorting of vertices in a graph

graph.incidence

Create graphs from an incidence matrix

Union of graphs

Combining attributes

How igraph functions handle attributes when the graph changes

Conversion to igraph

bipartite.projection

Project a bipartite graph

Weighted graphs

Average nearest neighbor degree

community.to.membership

Common functions supporting community detection algorithms

The igraph console

Kleinberg's centrality scores.

graph.disjoint.union

Disjoint union of graphs

Geometric random graphs

Depth-first search

Is this object a graph?

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 (directed or undirected) paths between vertices

minimum.size.separators

Minimum size vertex separators

Subgraph of a graph

Graph generation based on different vertex types

contract.vertices

Contract several vertices into a single one

Convex hull of a set of vertices

Plot dendrograms

Incidence matrix of a bipartite graph

Burt's constraint

dendPlot.communities

Community structure dendrogram plots

Graphs from adjacency lists

Create graphs from adjacency lists

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

Plotting of graphs

Running mean of a time series

Assortativity coefficient

canonical.permutation

Canonical permutation of a graph

Modularity of a community structure of a graph

adjacent.triangles

Count adjacenct triangles

Fitting a power-law distribution function to discrete data

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

Vertex and edge betweenness centrality

biconnected.components

Biconnected components

Creating (small) graphs via a simple interface

graph.complementer

Complementer of a graph

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 of a graph

growing.random.game

Growing random graph generation

independent.vertex.sets

Independent vertex sets

Vertex and edge sequences and iterators

Generate coordinates for plotting graphs

interconnected.islands

A graph with subgraphs that are each a random graph.

Interactive plotting of graphs

Stochastic matrix of a graph

Gaining information about graph structure

Diameter of a graph

Eccentricity and radius

Find Eigenvector Centrality Scores of Network Positions

Experimental basic igraph GUI

bipartite.mapping

Decide whether a graph is bipartite

Run igraph demos, step by step

subgraph.centrality

Find subgraph centrality scores of network positions

graph.intersection

Intersection of graphs

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

Neighborhood of graph vertices

Transitivity of a graph

Plotting the results on multiple SIR model runs

SCG Problem Solver

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

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

Compose two graphs as binary relations

Simple grid layout

SIR model on graphs

Set random seed of the C library's RNG

decompose.graph

Decompose a graph into components

Print graphs to the terminal

igraph.undocumented

Undocumented and unsupportted igraph functions

vertex.connectivity

Vertex connectivity.

Connected components of a graph

graph.laplacian

Graph Laplacian

scgSemiProjectors

Semi-Projectors

Dyad census of a graph

edge.betweenness.community

Community structure detection based on edge betweenness

Spectral coarse graining

Spectral Coarse Graining

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

Centralization of a graph.tmax

In- or out- component of a vertex

dendPlot.igraphHRG

HRG dendrogram plot

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

3D plotting of graphs with OpenGL

graph.de.bruijn

De Bruijn graphs.

Merging graph layouts

The Page Rank algorithm

articulation.points

Articulation points of a graph

Sampling a random integer sequence

Find Bonacich Power Centrality Scores of Network Positions

spinglass.community

Finding communities in graphs based on statistical meachanics

Degree and degree distribution of the vertices

graph.adjacency

Create graphs from adjacency matrices

edge.connectivity

Edge connectivity.

Measuring the driving force in evolving networks

Breadth-first search

Strength or weighted vertex degree

is.degree.sequence

Degree sequences of graphs

minimum.spanning.tree

Minimum spanning tree

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

graph.full.bipartite

Create a full bipartite graph

graph-isomorphism

Graph Isomorphism

optimal.community

Optimal community structure

Reciprocity of graphs