Learn R Programming

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

igraph (version 0.7.1)

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

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

April 22nd, 2014

Functions in igraph (0.7.1)

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

In- or out- component of a vertex

Graphs from adjacency lists

Create graphs from adjacency lists

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

Assortativity coefficient

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

edge.betweenness.community

Community structure detection based on edge betweenness

Fitting a power-law distribution function to discrete data

Create a random regular graph

graph.difference

Difference of graphs

Subgraph of a graph

Geometric random graphs

Incidence matrix of a bipartite graph

Directed acyclic graphs

Combining attributes

How igraph functions handle attributes when the graph changes

degree.sequence.game

Generate random graphs with a given degree sequence

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

maximum.cardinality.search

Maximum cardinality search

graph-isomorphism

Graph Isomorphism

Vertex separators

Rewires the endpoints of the edges of a graph randomly

Reading foreign file formats

Hierarchical random graphs

Hierarchical random graphs

Chordality of a graph

SCG Problem Solver

biconnected.components

Biconnected components

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

Gaining information about graph structure

dendPlot.communities

Community structure dendrogram plots

Dyad census of a graph

Vertex and edge betweenness centrality

decompose.graph

Decompose a graph into components

community.to.membership

Common functions supporting community detection algorithms

Eccentricity and radius

edge.connectivity

Edge connectivity.

Set random seed of the C library's RNG

watts.strogatz.game

The Watts-Strogatz small-world model

Depth-first search

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

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Girth of a graph

Convex hull of a set of vertices

independent.vertex.sets

Independent vertex sets

graph.bipartite

Create a bipartite graph

forest.fire.game

Forest Fire Network Model

graph.complementer

Complementer of a graph

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

growing.random.game

Growing random graph generation

Kleinberg's centrality scores.

bipartite.mapping

Decide whether a graph is bipartite

Graph, vertex and edge attributes

minimal.st.separators

Minimum size vertex separators

K-core decomposition of graphs

Connected components of a graph

Sampling a random integer sequence

Query and download from the Nexus network repository

Creating (small) graphs via a simple interface

label.propagation.community

Finding communities based on propagating labels

cohesive.blocks

Calculate Cohesive Blocks

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Maximum flow in a network

graph.adjacency

Create graphs from adjacency matrices

Various vertex shapes when plotting igraph graphs

SIR model on graphs

graph.automorphisms

Number of automorphisms

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

Graphlet decomposition of a graph

graph.incidence

Create graphs from an incidence matrix

is.degree.sequence

Degree sequences of graphs

minimum.size.separators

Minimum size vertex separators

Merging graph layouts

Generate coordinates for plotting graphs

optimal.community

Optimal community structure

minimum.spanning.tree

Minimum spanning tree

Graph layout by multidimensional scaling

permute.vertices

Permute the vertices of a graph

Neighborhood of graph vertices

walktrap.community

Community strucure via short random walks

Print graphs to the terminal

Transitivity of a graph

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

multilevel.community

Finding community structure by multi-level optimization of modularity

Is this object a graph?

Parameters for the igraph package

Experimental basic igraph GUI

Running mean of a time series

Convert a general graph into a forest

Stochastic matrix of a graph

Graph generation based on different vertex types

ARPACK eigenvector calculation

bipartite.random.game

Bipartite random graphs

articulation.points

Articulation points of a graph

Closeness centrality of vertices

Run package tests

static.fitness.game

Random graphs from vertex fitness scores

Weighted graphs

autocurve.edges

Optimal edge curvature when plotting graphs

3D plotting of graphs with OpenGL

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

Shortest (directed or undirected) paths between vertices

Reciprocity of graphs

Similarity measures of two vertices

Find Eigenvector Centrality Scores of Network Positions

Cocitation coupling

Convert a graph to an adjacency matrix or an edge list

Vertex and edge sequences and iterators

compare.communities

Compares community structures using various metrics

Find Bonacich Power Centrality Scores of Network Positions

Creating named graphs

Strength or weighted vertex degree

Sample stochastic block model

scgSemiProjectors

Semi-Projectors

Pie charts as vertices

Using pie charts as vertices in graph plots

graph.disjoint.union

Disjoint union of graphs

Modularity of a community structure of a graph

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Triad census, subgraphs with three vertices

graph.full.bipartite

Create a full bipartite graph

Query igraph's version string

Find the multiple or loop edges in a graph

preference.game

Trait-based random generation

SCG Extra Functions

layout.bipartite

Simple two-row layout for bipartite graphs

igraph.undocumented

Undocumented and unsupportted igraph functions

Centralization of a graph.tmax

contract.vertices

Contract several vertices into a single one

The DrL graph layout generator

layout.sugiyama

The Sugiyama graph layout generator

Plotting the results on multiple SIR model runs

dendPlot.igraphHRG

HRG dendrogram plot

graph.laplacian

Graph Laplacian

Creating a graph from LCF notation

graph.structure

Method for structural manipulation of graphs

Simple grid layout

leading.eigenvector.community

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

spinglass.community

Finding communities in graphs based on statistical meachanics

Interactive plotting of graphs

Conversion to igraph

canonical.permutation

Canonical permutation of a graph

Adjacency lists

graph.constructors

Various methods for creating graphs

graph.data.frame

Creating igraph graphs from data frames or vice-versa

Average nearest neighbor degree

Run igraph demos, step by step

The Page Rank algorithm

subgraph.centrality

Find subgraph centrality scores of network positions

Plot dendrograms

fastgreedy.community

Community structure via greedy optimization of modularity

The igraph console

Plotting of graphs

Writing the graph to a file in some format

Spectral coarse graining

Spectral Coarse Graining

Compose two graphs as binary relations

graph.de.bruijn

De Bruijn graphs.

graph.diversity

Graph diversity

graph.intersection

Intersection of graphs

interconnected.islands

A graph with subgraphs that are each a random graph.

Degree and degree distribution of the vertices

Diameter of a graph

Line graph of a graph

Find mutual edges in a directed graph

adjacent.triangles

Count adjacenct triangles

bipartite.projection

Project a bipartite graph

Measuring the driving force in evolving networks

Union of graphs

infomap.community

Infomap community finding

vertex.connectivity

Vertex connectivity.

topological.sort

Topological sorting of vertices in a graph

Functions to deal with the result of network community detection

The igraph package

Burt's constraint

Convert between directed and undirected graphs

Breadth-first search

static.power.law.game

Scale-free random graphs, from vertex fitness scores