Learn R Programming

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

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

555,428

Version

0.6.5-2

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

May 23rd, 2013

Functions in igraph (0.6.5-2)

Spectral coarse graining

Spectral Coarse Graining

Convex hull of a set of vertices

biconnected.components

Biconnected components

compare.communities

Compares community structures using various metrics

edge.betweenness.community

Community structure detection based on edge betweenness

Closeness centrality of vertices

Eccentricity and radius

dendPlot.igraphHRG

HRG dendrogram plot

community.to.membership

Common functions supporting community detection algorithms

graph.full.bipartite

Create a full bipartite graph

contract.vertices

Contract several vertices into a single one

Adjacency lists

Graph, vertex and edge attributes

Diameter of a graph

autocurve.edges

Optimal edge curvature when plotting graphs

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

K-core decomposition of graphs

Find Eigenvector Centrality Scores of Network Positions

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

graph.data.frame

Creating igraph graphs from data frames or vice-versa

Find Bonacich Power Centrality Scores of Network Positions

Dyad census of a graph

Convert a graph to an adjacency matrix or an edge list

Incidence matrix of a bipartite graph

Assortativity coefficient

Vertex and edge betweenness centrality

Plot dendrograms

Functions to deal with the result of network community detection

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

The Page Rank algorithm

bipartite.mapping

Decide whether a graph is bipartite

Average nearest neighbor degree

spinglass.community

Finding communities in graphs based on statistical meachanics

graph-isomorphism

Graph Isomorphism

Strength or weighted vertex degree

preference.game

Trait-based random generation

Girth of a graph

articulation.points

Articulation points of a graph

Vertex and edge sequences and iterators

Create a random regular graph

Creating (small) graphs via a simple interface

leading.eigenvector.community

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

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

graph.diversity

Graph diversity

Is this object a graph?

growing.random.game

Growing random graph generation

static.power.law.game

Scale-free random graphs, from vertex fitness scores

Directed acyclic graphs

Geometric random graphs

Breadth-first search

graph.adjacency

Create graphs from adjacency matrices

ARPACK eigenvector calculation

infomap.community

Infomap community finding

Graphs from adjacency lists

Create graphs from adjacency lists

graph.laplacian

Graph Laplacian

Combining attributes

How igraph functions handle attributes when the graph changes

Maximum flow in a network

The DrL graph layout generator

Simple grid layout

graph.de.bruijn

De Bruijn graphs.

label.propagation.community

Finding communities based on propagating labels

Find the multiple or loop edges in a graph

Chordality of a graph

Merging graph layouts

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

Pie charts as vertices

Using pie charts as vertices in graph plots

interconnected.islands

A graph with subgraphs that are each a random graph.

multilevel.community

Finding community structure by multi-level optimization of modularity

SCG Extra Functions

layout.sugiyama

The Sugiyama graph layout generator

Connected components of a graph

permute.vertices

Permute the vertices of a graph

watts.strogatz.game

The Watts-Strogatz small-world model

Plotting of graphs

vertex.connectivity

Vertex connectivity.

Find mutual edges in a directed graph

maximum.cardinality.search

Maximum cardinality search

Interactive plotting of graphs

Hierarchical random graphs

Hierarchical random graphs

Gaining information about graph structure

Reciprocity of graphs

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Shortest (directed or undirected) paths between vertices

Print graphs to the terminal

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Transitivity of a graph

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

Graph generation based on different vertex types

Reading foreign file formats

walktrap.community

Community strucure via short random walks

Stochastic matrix of a graph

Degree and degree distribution of the vertices

3D plotting of graphs with OpenGL

Rewires the endpoints of the edges of a graph randomly

is.degree.sequence

Degree sequences of graphs

minimum.spanning.tree

Minimum spanning tree

fastgreedy.community

Community structure via greedy optimization of modularity

graph.automorphisms

Number of automorphisms

Sampling a random integer sequence

graph-operators-by-name

Graph operators based on symbolic vertex names

Convert between directed and undirected graphs

Triad census, subgraphs with three vertices

Depth-first search

Subgraph of a graph

SCG Problem Solver

optimal.community

Optimal community structure

subgraph.centrality

Find subgraph centrality scores of network positions

static.fitness.game

Random graphs from vertex fitness scores

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

graph.structure

Method for structural manipulation of graphs

Query and download from the Nexus network repository

topological.sort

Topological sorting of vertices in a graph

graph.incidence

Create graphs from an incidence matrix

Vertex separators

Convert a general graph into a forest

Experimental basic igraph GUI

Kleinberg's centrality scores.

Generate coordinates for plotting graphs

Graph layout by multidimensional scaling

Fitting a power-law distribution function to discrete data

The igraph package

Running mean of a time series

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

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

Cocitation coupling

Measuring the driving force in evolving networks

graph.constructors

Various methods for creating graphs

alpha.centrality

Find Bonacich alpha centrality scores of network positions

canonical.permutation

Canonical permutation of a graph

Creating a graph from LCF notation

degree.sequence.game

Generate random graphs with a given degree sequence

bipartite.projection

Project a bipartite graph

Weighted graphs

Neighborhood of graph vertices

In- or out- component of a vertex

Line graph of a graph

minimal.st.separators

Minimum size vertex separators

The igraph console

forest.fire.game

Forest Fire Network Model

edge.connectivity

Edge connectivity.

graph.bipartite

Create a bipartite graph

Various vertex shapes when plotting igraph graphs

independent.vertex.sets

Independent vertex sets

igraph.undocumented

Undocumented and unsupportted igraph functions

Writing the graph to a file in some format

scgSemiProjectors

Semi-Projectors

decompose.graph

Decompose a graph into components

Conversion to igraph

cohesive.blocks

Calculate Cohesive Blocks

dendPlot.communities

Community structure dendrogram plots

Run igraph demos, step by step

Similarity measures of two vertices

Centralization of a graph.tmax

Burt's constraint

Creating named graphs

minimum.size.separators

Minimum size vertex separators

graph-operators

Graph operators

Modularity of a community structure of a graph

Parameters for the igraph package