Learn R Programming

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

igraph (version 0.6-3)

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

432,884

Version

0.6-3

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

October 17th, 2012

Functions in igraph (0.6-3)

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

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

community.to.membership

Common functions supporting community detection algorithms

Assortativity coefficient

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Depth-first search

Creating (small) graphs via a simple interface

Convert a graph to an adjacency matrix or an edge list

bipartite.projection

Project a bipartite graph

contract.vertices

Contract several vertices into a single one

Plot dendrograms

graph.constructors

Various methods for creating graphs

interconnected.islands

A graph with subgraphs that are each a random graph.

minimum.spanning.tree

Minimum spanning tree

graph.de.bruijn

De Bruijn graphs.

scgSemiProjectors

Semi-Projectors

Creating a graph from LCF notation

independent.vertex.sets

Independent vertex sets

Query and download from the Nexus network repository

Find Bonacich Power Centrality Scores of Network Positions

Run igraph demos, step by step

Dyad census of a graph

Convex hull of a set of vertices

Burt's constraint

Vertex separators

Girth of a graph

Weighted graphs

Similarity measures of two vertices

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

permute.vertices

Permute the vertices of a graph

cohesive.blocks

Calculate Cohesive Blocks

Shortest (directed or undirected) paths between vertices

minimal.st.separators

Minimum size vertex separators

The igraph package

dendPlot.communities

Community structure dendrogram plots

Line graph of a graph

decompose.graph

Decompose a graph into components

optimal.community

Optimal community structure

label.propagation.community

Finding communities based on propagating labels

compare.communities

Compares community structures using various metrics

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

Reading foreign file formats

Fitting a power-law distribution function to discrete data

Graph generation based on different vertex types

Conversion to igraph

Vertex and edge betweenness centrality

igraph.undocumented

Undocumented and unsupportted igraph functions

The Page Rank algorithm

biconnected.components

Biconnected components

Pie charts as vertices

Using pie charts as vertices in graph plots

minimum.size.separators

Minimum size vertex separators

Interactive plotting of graphs

graph.incidence

Create graphs from an incidence matrix

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

growing.random.game

Growing random graph generation

Measuring the driving force in evolving networks

Triad census, subgraphs with three vertices

Various vertex shapes when plotting igraph graphs

Connected components of a graph

Degree and degree distribution of the vertices

Sampling a random integer sequence

bipartite.mapping

Decide whether a graph is bipartite

Experimental basic igraph GUI

The igraph console

Convert a general graph into a forest

Writing the graph to a file in some format

Print graphs to the terminal

Gaining information about graph structure

Breadth-first search

graph.automorphisms

Number of automorphisms

SCG Problem Solver

Simple grid layout

edge.connectivity

Edge connectivity.

dendPlot.igraphHRG

HRG dendrogram plot

Creating named graphs

Graphs from adjacency lists

Create graphs from adjacency lists

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

forest.fire.game

Forest Fire Network Model

Cocitation coupling

Stochastic matrix of a graph

The DrL graph layout generator

watts.strogatz.game

The Watts-Strogatz small-world model

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

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

Find the multiple or loop edges in a graph

static.power.law.game

Scale-free random graphs, from vertex fitness scores

leading.eigenvector.community

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

Neighborhood of graph vertices

Generate coordinates for plotting graphs

preference.game

Trait-based random generation

infomap.community

Infomap community finding

Directed acyclic graphs

graph.diversity

Graph diversity

Spectral coarse graining

Spectral Coarse Graining

graph-operators

Graph operators

Convert between directed and undirected graphs

vertex.connectivity

Vertex connectivity.

autocurve.edges

Optimal edge curvature when plotting graphs

Eccentricity and radius

Geometric random graphs

topological.sort

Topological sorting of vertices in a graph

degree.sequence.game

Generate random graphs with a given degree sequence

Vertex and edge sequences and iterators

Transitivity of a graph

canonical.permutation

Canonical permutation of a graph

SCG Extra Functions

Strength or weighted vertex degree

graph.laplacian

Graph Laplacian

Plotting of graphs

Rewires the endpoints of the edges of a graph randomly

spinglass.community

Finding communities in graphs based on statistical meachanics

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

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

fastgreedy.community

Community structure via greedy optimization of modularity

graph.data.frame

Creating igraph graphs from data frames

graph.full.bipartite

Create a full bipartite graph

Maximum flow in a network

Hierarchical random graphs

Hierarchical random graphs

Find Eigenvector Centrality Scores of Network Positions

Closeness centrality of vertices

graph.structure

Method for structural manipulation of graphs

Chordality of a graph

Subgraph of a graph

K-core decomposition of graphs

Is this object a graph?

subgraph.centrality

Find subgraph centrality scores of network positions

Running mean of a time series

static.fitness.game

Random graphs from vertex fitness scores

articulation.points

Articulation points of a graph

Graph, vertex and edge attributes

edge.betweenness.community

Community structure detection based on edge betweenness

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

layout.sugiyama

The Sugiyama graph layout generator

Modularity of a community structure of a graph

3D plotting of graphs with OpenGL

ARPACK eigenvector calculation

Functions to deal with the result of network community detection

In- or out- component of a vertex

Diameter of a graph

graph.adjacency

Create graphs from adjacency matrices

graph-isomorphism

Graph Isomorphism

Merging graph layouts

Kleinberg's centrality scores.

Parameters for the igraph package

Incidence matrix of a bipartite graph

Combining attributes

How igraph functions handle attributes when the graph changes

Centralization of a graph.tmax

Average nearest neighbor degree

maximum.cardinality.search

Maximum cardinality search

Reciprocity of graphs

Adjacency lists

Find mutual edges in a directed graph

walktrap.community

Community strucure via short random walks

multilevel.community

Finding community structure by multi-level optimization of modularity

graph-operators-by-name

Graph operators based on symbolic vertex names

graph.bipartite

Create a bipartite graph