Learn R Programming

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

igraph (version 0.6-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

379,721

Version

0.6-1

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

June 17th, 2012

Functions in igraph (0.6-1)

edge.betweenness.community

Community structure detection based on edge betweenness

decompose.graph

Decompose a graph into components

In- or out- component of a vertex

ARPACK eigenvector calculation

contract.vertices

Contract several vertices into a single one

Graphs from adjacency lists

Create graphs from adjacency lists

dendPlot.igraphHRG

HRG dendrogram plot

dendPlot.communities

Plot fully hierarchical community structures as dendrograms

Strength or weighted vertex degree

Depth-first search

graph.structure

Method for structural manipulation of graphs

layout.sugiyama

The Sugiyama graph layout generator

Vertex and edge betweenness centrality

Combining attributes

How igraph functions handle attributes when the graph changes

Eccentricity and radius

Weighted graphs

community.to.membership

Common functions supporting community detection algorithms

Directed acyclic graphs

graph.automorphisms

Number of automorphisms

edge.connectivity

Edge connectivity.

graph.constructors

Various methods for creating graphs

Hierarchical random graphs

Hierarchical random graphs

SCG Extra Functions

interconnected.islands

A graph with subgraphs that are each a random graph.

static.fitness.game

Random graphs from vertex fitness scores

Spectral coarse graining

Spectral Coarse Graining

Run igraph demos, step by step

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

Find mutual edges in a directed graph

permute.vertices

Permute the vertices of a graph

preference.game

Trait-based random generation

subgraph.centrality

Find subgraph centrality scores of network positions

Functions to deal with the result of network community detection

Modularity of a community structure of a graph

minimum.size.separators

Minimum size vertex separators

The igraph console

Convert between directed and undirected graphs

growing.random.game

Growing random graph generation

Cocitation coupling

label.propagation.community

Finding communities based on propagating labels

Rewires the endpoints of the edges of a graph randomly

Adjacency lists

Creating named graphs

Sampling a random integer sequence

Transitivity of a graph

Pie charts as vertices

Using pie charts as vertices in graph plots

K-core decomposition of graphs

leading.eigenvector.community

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

Find Bonacich Power Centrality Scores of Network Positions

Shortest (directed or undirected) paths between vertices

Triad census, subgraphs with three vertices

Burt's constraint

Convert a graph to an adjacency matrix or an edge list

graph.full.bipartite

Create a full bipartite graph

minimal.st.separators

Minimum size vertex separators

Fitting a power-law distribution function to discrete data

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

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

canonical.permutation

Canonical permutation of a graph

Find Eigenvector Centrality Scores of Network Positions

Measuring the driving force in evolving networks

Breadth-first search

Dyad census of a graph

Incidence matrix of a bipartite graph

Geometric random graphs

Creating a graph from LCF notation

graph.data.frame

Creating igraph graphs from data frames

Gaining information about graph structure

Simple grid layout

degree.sequence.game

Generate random graphs with a given degree sequence

graph-isomorphism

Graph Isomorphism

Generate coordinates for plotting graphs

Interactive plotting of graphs

Merging graph layouts

Reciprocity of graphs

graph.bipartite

Create a bipartite graph

Subgraph of a graph

Stochastic matrix of a graph

graph-operators-by-name

Graph operators based on symbolic vertex names

minimum.spanning.tree

Minimum spanning tree

topological.sort

Topological sorting of vertices in a graph

Experimental basic igraph GUI

watts.strogatz.game

The Watts-Strogatz small-world model

Closeness centrality of vertices

Connected components of a graph

graph.de.bruijn

De Bruijn graphs.

Line graph of a graph

SCG Problem Solver

scgSemiProjectors

Semi-Projectors

Convert a general graph into a forest

articulation.points

Articulation points of a graph

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Conversion to igraph

Graph, vertex and edge attributes

Convex hull of a set of vertices

Plot dendrograms

Is this object a graph?

fastgreedy.community

Community structure via greedy optimization of modularity

The igraph package

forest.fire.game

Forest Fire Network Model

3D plotting of graphs with OpenGL

static.power.law.game

Scale-free random graphs, from vertex fitness scores

walktrap.community

Community strucure via short random walks

Writing the graph to a file in some format

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

compare.communities

Compares community structures using various metrics

Creating (small) graphs via a simple interface

graph.laplacian

Graph Laplacian

Plotting of graphs

Similarity measures of two vertices

vertex.connectivity

Vertex connectivity.

multilevel.community

Finding community structure by multi-level optimization of modularity

biconnected.components

Biconnected components

bipartite.projection

Project a bipartite graph

graph.incidence

Create graphs from an incidence matrix

Maximum flow in a network

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

Graph generation based on different vertex types

Assortativity coefficient

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

graph.adjacency

Create graphs from adjacency matrices

Average nearest neighbor degree

Centralization of a graph.tmax

Parameters for the igraph package

infomap.community

Infomap community finding

Query and download from the Nexus network repository

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

Running mean of a time series

Print graphs to the terminal

Reading foreign file formats

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

independent.vertex.sets

Independent vertex sets

The DrL graph layout generator

Neighborhood of graph vertices

Vertex and edge sequences and iterators

Girth of a graph

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

Kleinberg's centrality scores.

The Page Rank algorithm

igraph.undocumented

Undocumented and unsupportted igraph functions

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

autocurve.edges

Optimal edge curvature when plotting graphs

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

Diameter of a graph

Various vertex shapes when plotting igraph graphs

Chordality of a graph

Vertex separators

optimal.community

Optimal community structure

spinglass.community

Finding communities in graphs based on statistical meachanics

cohesive.blocks

Calculate Cohesive Blocks

Degree and degree distribution of the vertices

graph.diversity

Graph diversity

bipartite.mapping

Decide whether a graph is bipartite

Find the multiple or loop edges in a graph

maximum.cardinality.search

Maximum cardinality search

graph-operators

Graph operators

Create a random regular graph

is.degree.sequence

Degree sequences of graphs

Graph layout by multidimensional scaling