Learn R Programming

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

igraph (version 0.6.5-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.5-1

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

February 28th, 2013

Functions in igraph (0.6.5-1)

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

articulation.points

Articulation points of a graph

ARPACK eigenvector calculation

biconnected.components

Biconnected components

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Incidence matrix of a bipartite graph

bipartite.projection

Project a bipartite graph

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

compare.communities

Compares community structures using various metrics

dendPlot.igraphHRG

HRG dendrogram plot

Degree and degree distribution of the vertices

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

edge.connectivity

Edge connectivity.

graph.incidence

Create graphs from an incidence matrix

infomap.community

Infomap community finding

Creating (small) graphs via a simple interface

Assortativity coefficient

The igraph package

growing.random.game

Growing random graph generation

Creating a graph from LCF notation

Vertex and edge betweenness centrality

graph.data.frame

Creating igraph graphs from data frames or vice-versa

Rewires the endpoints of the edges of a graph randomly

forest.fire.game

Forest Fire Network Model

graph.automorphisms

Number of automorphisms

graph.bipartite

Create a bipartite graph

interconnected.islands

A graph with subgraphs that are each a random graph.

Create a random regular graph

layout.sugiyama

The Sugiyama graph layout generator

Writing the graph to a file in some format

Creating named graphs

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

Gaining information about graph structure

Fitting a power-law distribution function to discrete data

Reciprocity of graphs

Generate coordinates for plotting graphs

maximum.cardinality.search

Maximum cardinality search

Shortest (directed or undirected) paths between vertices

graph.structure

Method for structural manipulation of graphs

Experimental basic igraph GUI

Parameters for the igraph package

optimal.community

Optimal community structure

Query and download from the Nexus network repository

Sampling a random integer sequence

Diameter of a graph

label.propagation.community

Finding communities based on propagating labels

graph.diversity

Graph diversity

Transitivity of a graph

Girth of a graph

Strength or weighted vertex degree

Geometric random graphs

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Convert between directed and undirected graphs

Find the multiple or loop edges in a graph

spinglass.community

Finding communities in graphs based on statistical meachanics

Dyad census of a graph

Graphs from adjacency lists

Create graphs from adjacency lists

Directed acyclic graphs

vertex.connectivity

Vertex connectivity.

Subgraph of a graph

Simple grid layout

graph.laplacian

Graph Laplacian

subgraph.centrality

Find subgraph centrality scores of network positions

watts.strogatz.game

The Watts-Strogatz small-world model

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

graph-operators-by-name

Graph operators based on symbolic vertex names

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

Convert a general graph into a forest

Various vertex shapes when plotting igraph graphs

Maximum flow in a network

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

preference.game

Trait-based random generation

leading.eigenvector.community

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

Graph generation based on different vertex types

Closeness centrality of vertices

3D plotting of graphs with OpenGL

Plotting of graphs

Running mean of a time series

Weighted graphs

Stochastic matrix of a graph

Depth-first search

canonical.permutation

Canonical permutation of a graph

Neighborhood of graph vertices

edge.betweenness.community

Community structure detection based on edge betweenness

Kleinberg's centrality scores.

The igraph console

Find mutual edges in a directed graph

Plot dendrograms

degree.sequence.game

Generate random graphs with a given degree sequence

graph-isomorphism

Graph Isomorphism

contract.vertices

Contract several vertices into a single one

Adjacency lists

Combining attributes

How igraph functions handle attributes when the graph changes

Centralization of a graph.tmax

minimum.spanning.tree

Minimum spanning tree

Vertex separators

fastgreedy.community

Community structure via greedy optimization of modularity

Graph layout by multidimensional scaling

Reading foreign file formats

graph-operators

Graph operators

Similarity measures of two vertices

Convex hull of a set of vertices

graph.full.bipartite

Create a full bipartite graph

graph.constructors

Various methods for creating graphs

Graph, vertex and edge attributes

The DrL graph layout generator

is.degree.sequence

Degree sequences of graphs

community.to.membership

Common functions supporting community detection algorithms

SCG Extra Functions

cohesive.blocks

Calculate Cohesive Blocks

decompose.graph

Decompose a graph into components

Cocitation coupling

Find Eigenvector Centrality Scores of Network Positions

bipartite.mapping

Decide whether a graph is bipartite

Print graphs to the terminal

Conversion to igraph

Functions to deal with the result of network community detection

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

graph.adjacency

Create graphs from adjacency matrices

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

SCG Problem Solver

Is this object a graph?

scgSemiProjectors

Semi-Projectors

autocurve.edges

Optimal edge curvature when plotting graphs

dendPlot.communities

Community structure dendrogram plots

Connected components of a graph

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

K-core decomposition of graphs

minimum.size.separators

Minimum size vertex separators

permute.vertices

Permute the vertices of a graph

Merging graph layouts

static.fitness.game

Random graphs from vertex fitness scores

Triad census, subgraphs with three vertices

Eccentricity and radius

Spectral coarse graining

Spectral Coarse Graining

Convert a graph to an adjacency matrix or an edge list

independent.vertex.sets

Independent vertex sets

static.power.law.game

Scale-free random graphs, from vertex fitness scores

Breadth-first search

Chordality of a graph

Modularity of a community structure of a graph

Line graph of a graph

Interactive plotting of graphs

Pie charts as vertices

Using pie charts as vertices in graph plots

Find Bonacich Power Centrality Scores of Network Positions

Measuring the driving force in evolving networks

Burt's constraint

Average nearest neighbor degree

Hierarchical random graphs

Hierarchical random graphs

multilevel.community

Finding community structure by multi-level optimization of modularity

The Page Rank algorithm

walktrap.community

Community strucure via short random walks

minimal.st.separators

Minimum size vertex separators

igraph.undocumented

Undocumented and unsupportted igraph functions

In- or out- component of a vertex

Vertex and edge sequences and iterators

topological.sort

Topological sorting of vertices in a graph

graph.de.bruijn

De Bruijn graphs.

Run igraph demos, step by step