Learn R Programming

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

igraph (version 0.6-2)

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

733,150

Version

0.6-2

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

June 20th, 2012

Functions in igraph (0.6-2)

Convert between directed and undirected graphs

Conversion to igraph

contract.vertices

Contract several vertices into a single one

compare.communities

Compares community structures using various metrics

fastgreedy.community

Community structure via greedy optimization of modularity

Creating named graphs

Plot dendrograms

graph-isomorphism

Graph Isomorphism

Transitivity of a graph

bipartite.mapping

Decide whether a graph is bipartite

edge.betweenness.community

Community structure detection based on edge betweenness

Merging graph layouts

graph-operators-by-name

Graph operators based on symbolic vertex names

Find Eigenvector Centrality Scores of Network Positions

Reciprocity of graphs

graph.automorphisms

Number of automorphisms

The Page Rank algorithm

scgSemiProjectors

Semi-Projectors

Reading foreign file formats

3D plotting of graphs with OpenGL

K-core decomposition of graphs

Directed acyclic graphs

SCG Extra Functions

Similarity measures of two vertices

Modularity of a community structure of a graph

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

graph.structure

Method for structural manipulation of graphs

growing.random.game

Growing random graph generation

Experimental basic igraph GUI

preference.game

Trait-based random generation

minimum.size.separators

Minimum size vertex separators

graph.diversity

Graph diversity

graph.full.bipartite

Create a full bipartite graph

Average nearest neighbor degree

independent.vertex.sets

Independent vertex sets

Is this object a graph?

leading.eigenvector.community

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

biconnected.components

Biconnected components

graph.bipartite

Create a bipartite graph

Adjacency lists

Graph, vertex and edge attributes

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

graph.data.frame

Creating igraph graphs from data frames

permute.vertices

Permute the vertices of a graph

Parameters for the igraph package

Query and download from the Nexus network repository

Depth-first search

Connected components of a graph

Diameter of a graph

static.fitness.game

Random graphs from vertex fitness scores

community.to.membership

Common functions supporting community detection algorithms

topological.sort

Topological sorting of vertices in a graph

Eccentricity and radius

Incidence matrix of a bipartite graph

The igraph package

infomap.community

Infomap community finding

Creating a graph from LCF notation

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

Convex hull of a set of vertices

Generate coordinates for plotting graphs

Vertex separators

edge.connectivity

Edge connectivity.

Subgraph of a graph

dendPlot.communities

Plot fully hierarchical community structures as dendrograms

Sampling a random integer sequence

articulation.points

Articulation points of a graph

The igraph console

Kleinberg's centrality scores.

Line graph of a graph

Shortest (directed or undirected) paths between vertices

Find mutual edges in a directed graph

igraph.undocumented

Undocumented and unsupportted igraph functions

decompose.graph

Decompose a graph into components

Writing the graph to a file in some format

Running mean of a time series

Burt's constraint

minimum.spanning.tree

Minimum spanning tree

multilevel.community

Finding community structure by multi-level optimization of modularity

subgraph.centrality

Find subgraph centrality scores of network positions

Neighborhood of graph vertices

graph.adjacency

Create graphs from adjacency matrices

Simple grid layout

Triad census, subgraphs with three vertices

walktrap.community

Community strucure via short random walks

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

cohesive.blocks

Calculate Cohesive Blocks

Creating (small) graphs via a simple interface

canonical.permutation

Canonical permutation of a graph

Convert a graph to an adjacency matrix or an edge list

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

Breadth-first search

graph.laplacian

Graph Laplacian

Graph generation based on different vertex types

Find the multiple or loop edges in a graph

Stochastic matrix of a graph

label.propagation.community

Finding communities based on propagating labels

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

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

autocurve.edges

Optimal edge curvature when plotting graphs

Spectral coarse graining

Spectral Coarse Graining

Assortativity coefficient

Weighted graphs

watts.strogatz.game

The Watts-Strogatz small-world model

degree.sequence.game

Generate random graphs with a given degree sequence

Closeness centrality of vertices

Vertex and edge betweenness centrality

ARPACK eigenvector calculation

Hierarchical random graphs

Hierarchical random graphs

Measuring the driving force in evolving networks

Find Bonacich Power Centrality Scores of Network Positions

Centralization of a graph.tmax

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

Gaining information about graph structure

spinglass.community

Finding communities in graphs based on statistical meachanics

Fitting a power-law distribution function to discrete data

graph-operators

Graph operators

Print graphs to the terminal

Interactive plotting of graphs

vertex.connectivity

Vertex connectivity.

Dyad census of a graph

Vertex and edge sequences and iterators

Graphs from adjacency lists

Create graphs from adjacency lists

Various vertex shapes when plotting igraph graphs

graph.de.bruijn

De Bruijn graphs.

The DrL graph layout generator

Rewires the endpoints of the edges of a graph randomly

Run igraph demos, step by step

In- or out- component of a vertex

minimal.st.separators

Minimum size vertex separators

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

bipartite.projection

Project a bipartite graph

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

Degree and degree distribution of the vertices

graph.constructors

Various methods for creating graphs

layout.sugiyama

The Sugiyama graph layout generator

optimal.community

Optimal community structure

interconnected.islands

A graph with subgraphs that are each a random graph.

Convert a general graph into a forest

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Functions to deal with the result of network community detection

forest.fire.game

Forest Fire Network Model

Girth of a graph

Geometric random graphs

Chordality of a graph

Strength or weighted vertex degree

Plotting of graphs

SCG Problem Solver

Pie charts as vertices

Using pie charts as vertices in graph plots

static.power.law.game

Scale-free random graphs, from vertex fitness scores

maximum.cardinality.search

Maximum cardinality search

Combining attributes

How igraph functions handle attributes when the graph changes

Cocitation coupling

graph.incidence

Create graphs from an incidence matrix

Maximum flow in a network

dendPlot.igraphHRG

HRG dendrogram plot

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