Learn R Programming

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

igraph (version 0.5.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

733,150

Version

0.5.5-2

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

March 21st, 2011

Functions in igraph (0.5.5-2)

Vertex and edge betweenness centrality

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Burt's constraint

Incidence matrix of a bipartite graph

Convert a graph to an adjacency matrix or an edge list

articulation.points

Articulation points of a graph

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

graph.laplacian

Graph Laplacian

Closeness centrality of vertices

edge.betweenness.community

Community structure detection based on edge betweenness

Diameter of a graph

leading.eigenvector.community

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

graph.constructors

Various methods for creating graphs

Creating named graphs

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

Convert between directed and undirected graphs

Plot graphs and their cohesive block hierarchy

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

Find mutual edges in a directed graph

bipartite.projection

Project a bipartite graph

Average nearest neighbor degree

decompose.graph

Decompose a graph into components

graph.de.bruijn

De Bruijn graphs.

Subgraph of a graph

Common functions supporting community detection algorithms

canonical.permutation

Canonical permutation of a graph

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

forest.fire.game

Forest Fire Network Model

Decide whether a graph is bipartite

Strength or weighted vertex degree

growing.random.game

Growing random graph generation

Neighborhood of graph vertices

graph.full.bipartite

Create a full bipartite graph

Creating a graph from LCF notation

independent.vertex.sets

Independent vertex sets

Find Eigenvector Centrality Scores of Network Positions

Find the multiple or loop edges in a graph

Graphs from adjacency lists

Create graphs from adjacency lists

igraph from/to graphNEL conversion

Convert igraph graphs to graphNEL objects or back

Fitting a power-law distribution function to discrete data

Gaining information about graph structure

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

graph.incidence

Create graphs from an incidence matrix

preference.game

Trait-based random generation

degree.sequence.game

Generate random graphs with a given degree sequence

Graph, vertex and edge attributes

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Dyad census of a graph

Kleinberg's centrality scores.

Convert a general graph into a forest

igraph-parameters

Parameters for the igraph package

Vertex and edge sequences and iterators

In- or out- component of a vertex

Merging graph layouts

edge.connectivity

Edge connectivity.

Modularity of a community structure of a graph

vertex.connectivity

Vertex connectivity.

fastgreedy.community

Community structure via greedy optimization of modularity

Maximum flow in a network

Degree and degree distribution of the vertices

watts.strogatz.game

The Watts-Strogatz small-world model

3D plotting of graphs with OpenGL

graph.bipartite

Create a bipartite graph

biconnected.components

Biconnected components

minimum.spanning.tree

Minimum spanning tree

Adjacency lists

graph.automorphisms

Number of automorphisms

walktrap.community

Community strucure via short random walks

graph.structure

Method for structural manipulation of graphs

Graph generation based on different vertex types

Girth of a graph

Connected components of a graph

Similarity measures of two vertices

graph-isomorphism

Graph Isomorphism

The DrL graph layout generator

The Page Rank algorithm

permute.vertices

Permute the vertices of a graph

Running mean of a time series

Sampling a random integer sequence

Creating (small) graphs via a simple interface

Is this object a graph?

graph-operators

Graph operators

write.pajek.bgraph

Write graphs and their cohesive block hierarchy as Pajek files

Reciprocity of graphs

Rewires the endpoints of the edges of a graph randomly

Reading foreign file formats

Geometric random graphs

Plotting of graphs

ARPACK eigenvector calculation

Print graphs to the terminal

Experimental basic igraph GUI

Shortest (directed or undirected) paths between vertices

cohesive.blocks

Calculate Cohesive Blocks

Triad census, subgraphs with three vertices

The igraph package

Cocitation coupling

Various vertex shapes when plotting igraph graphs

Generate coordinates for plotting graphs

label.propagation.community

Finding communities based on propagating labels

spinglass.community

Finding communities in graphs based on statistical meachanics

topological.sort

Topological sorting of vertices in a graph

Find Bonacich Power Centrality Scores of Network Positions

graph.adjacency

Create graphs from adjacency matrices

graph.data.frame

Creating igraph graphs from data frames

K-core decomposition of graphs

Line graph of a graph

Transitivity of a graph

Writing the graph to a file in some format

Interactive plotting of graphs