Learn R Programming

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

igraph (version 0.6.6)

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

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

October 28th, 2013

Functions in igraph (0.6.6)

biconnected.components

Biconnected components

Vertex and edge betweenness centrality

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Centralization of a graph.tmax

Find mutual edges in a directed graph

Connected components of a graph

interconnected.islands

A graph with subgraphs that are each a random graph.

optimal.community

Optimal community structure

Kleinberg's centrality scores.

Similarity measures of two vertices

dendPlot.igraphHRG

HRG dendrogram plot

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

Measuring the driving force in evolving networks

Create a random regular graph

fastgreedy.community

Community structure via greedy optimization of modularity

In- or out- component of a vertex

static.fitness.game

Random graphs from vertex fitness scores

Run package tests

graph-operators

Graph operators

ARPACK eigenvector calculation

Generate coordinates for plotting graphs

Incidence matrix of a bipartite graph

graph.diversity

Graph diversity

Strength or weighted vertex degree

Query and download from the Nexus network repository

bipartite.projection

Project a bipartite graph

maximum.cardinality.search

Maximum cardinality search

Depth-first search

Diameter of a graph

Burt's constraint

graph.full.bipartite

Create a full bipartite graph

graph.laplacian

Graph Laplacian

graph.incidence

Create graphs from an incidence matrix

Vertex and edge sequences and iterators

Rewires the endpoints of the edges of a graph randomly

contract.vertices

Contract several vertices into a single one

Run igraph demos, step by step

Subgraph of a graph

Graph generation based on different vertex types

multilevel.community

Finding community structure by multi-level optimization of modularity

label.propagation.community

Finding communities based on propagating labels

Various vertex shapes when plotting igraph graphs

Parameters for the igraph package

spinglass.community

Finding communities in graphs based on statistical meachanics

Stochastic matrix of a graph

Merging graph layouts

static.power.law.game

Scale-free random graphs, from vertex fitness scores

Maximum flow in a network

Find Bonacich Power Centrality Scores of Network Positions

Closeness centrality of vertices

Spectral coarse graining

Spectral Coarse Graining

autocurve.edges

Optimal edge curvature when plotting graphs

Running mean of a time series

topological.sort

Topological sorting of vertices in a graph

compare.communities

Compares community structures using various metrics

Average nearest neighbor degree

subgraph.centrality

Find subgraph centrality scores of network positions

Plotting of graphs

permute.vertices

Permute the vertices of a graph

graph.bipartite

Create a bipartite graph

Chordality of a graph

Transitivity of a graph

Gaining information about graph structure

Interactive plotting of graphs

K-core decomposition of graphs

Degree and degree distribution of the vertices

community.to.membership

Common functions supporting community detection algorithms

igraph.undocumented

Undocumented and unsupportted igraph functions

is.degree.sequence

Degree sequences of graphs

Writing the graph to a file in some format

graph.constructors

Various methods for creating graphs

The igraph package

minimum.spanning.tree

Minimum spanning tree

Plot dendrograms

preference.game

Trait-based random generation

Neighborhood of graph vertices

Graph, vertex and edge attributes

Eccentricity and radius

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

Print graphs to the terminal

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

Find Eigenvector Centrality Scores of Network Positions

Assortativity coefficient

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

The igraph console

infomap.community

Infomap community finding

The DrL graph layout generator

minimal.st.separators

Minimum size vertex separators

decompose.graph

Decompose a graph into components

SCG Problem Solver

graph.data.frame

Creating igraph graphs from data frames or vice-versa

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Reciprocity of graphs

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

Creating a graph from LCF notation

Shortest (directed or undirected) paths between vertices

graph-operators-by-name

Graph operators based on symbolic vertex names

articulation.points

Articulation points of a graph

Convert a general graph into a forest

watts.strogatz.game

The Watts-Strogatz small-world model

Reading foreign file formats

Graph layout by multidimensional scaling

Modularity of a community structure of a graph

Breadth-first search

graph-isomorphism

Graph Isomorphism

Directed acyclic graphs

SCG Extra Functions

Geometric random graphs

leading.eigenvector.community

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

Weighted graphs

minimum.size.separators

Minimum size vertex separators

Experimental basic igraph GUI

The Page Rank algorithm

Is this object a graph?

Triad census, subgraphs with three vertices

Sampling a random integer sequence

Fitting a power-law distribution function to discrete data

Pie charts as vertices

Using pie charts as vertices in graph plots

cohesive.blocks

Calculate Cohesive Blocks

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

Hierarchical random graphs

Hierarchical random graphs

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

graph.adjacency

Create graphs from adjacency matrices

canonical.permutation

Canonical permutation of a graph

Girth of a graph

independent.vertex.sets

Independent vertex sets

Convex hull of a set of vertices

Dyad census of a graph

Convert a graph to an adjacency matrix or an edge list

degree.sequence.game

Generate random graphs with a given degree sequence

Graphs from adjacency lists

Create graphs from adjacency lists

graph.automorphisms

Number of automorphisms

bipartite.mapping

Decide whether a graph is bipartite

graph.de.bruijn

De Bruijn graphs.

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

Convert between directed and undirected graphs

dendPlot.communities

Community structure dendrogram plots

layout.sugiyama

The Sugiyama graph layout generator

forest.fire.game

Forest Fire Network Model

Vertex separators

walktrap.community

Community strucure via short random walks

scgSemiProjectors

Semi-Projectors

Adjacency lists

Creating (small) graphs via a simple interface

Creating named graphs

edge.connectivity

Edge connectivity.

Simple grid layout

Cocitation coupling

edge.betweenness.community

Community structure detection based on edge betweenness

growing.random.game

Growing random graph generation

Functions to deal with the result of network community detection

3D plotting of graphs with OpenGL

vertex.connectivity

Vertex connectivity.

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Conversion to igraph

Combining attributes

How igraph functions handle attributes when the graph changes

graph.structure

Method for structural manipulation of graphs

Line graph of a graph

Find the multiple or loop edges in a graph

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