Learn R Programming

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

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

366,150

Version

0.5.5-3

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

October 20th, 2011

Functions in igraph (0.5.5-3)

Creating a graph from LCF notation

The DrL graph layout generator

Similarity measures of two vertices

Closeness centrality of vertices

Vertex and edge betweenness centrality

Creating named graphs

Graphs from adjacency lists

Create graphs from adjacency lists

Maximum flow in a network

Find Eigenvector Centrality Scores of Network Positions

Line graph of a graph

Modularity of a community structure of a graph

Plot graphs and their cohesive block hierarchy

graph.laplacian

Graph Laplacian

Kleinberg's centrality scores.

Find the multiple or loop edges in a graph

Plotting of graphs

Is this object a graph?

forest.fire.game

Forest Fire Network Model

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

graph-operators

Graph operators

minimum.spanning.tree

Minimum spanning tree

graph-isomorphism

Graph Isomorphism

topological.sort

Topological sorting of vertices in a graph

Graph generation based on different vertex types

Triad census, subgraphs with three vertices

Graph, vertex and edge attributes

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

Generate coordinates for plotting graphs

bipartite.projection

Project a bipartite graph

Connected components of a graph

In- or out- component of a vertex

graph.data.frame

Creating igraph graphs from data frames

Convert a graph to an adjacency matrix or an edge list

fastgreedy.community

Community structure via greedy optimization of modularity

Girth of a graph

graph.bipartite

Create a bipartite graph

Decide whether a graph is bipartite

Reading foreign file formats

Rewires the endpoints of the edges of a graph randomly

Convert between directed and undirected graphs

degree.sequence.game

Generate random graphs with a given degree sequence

walktrap.community

Community strucure via short random walks

Print graphs to the terminal

preference.game

Trait-based random generation

Gaining information about graph structure

Writing the graph to a file in some format

igraph from/to graphNEL conversion

Convert igraph graphs to graphNEL objects or back

Burt's constraint

edge.betweenness.community

Community structure detection based on edge betweenness

Transitivity of a graph

graph.adjacency

Create graphs from adjacency matrices

Subgraph of a graph

3D plotting of graphs with OpenGL

Strength or weighted vertex degree

Neighborhood of graph vertices

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Interactive plotting of graphs

independent.vertex.sets

Independent vertex sets

Incidence matrix of a bipartite graph

Fitting a power-law distribution function to discrete data

leading.eigenvector.community

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

The igraph package

canonical.permutation

Canonical permutation of a graph

Find Bonacich Power Centrality Scores of Network Positions

cohesive.blocks

Calculate Cohesive Blocks

Adjacency lists

Diameter of a graph

Geometric random graphs

vertex.connectivity

Vertex connectivity.

label.propagation.community

Finding communities based on propagating labels

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

Creating (small) graphs via a simple interface

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Average nearest neighbor degree

Running mean of a time series

growing.random.game

Growing random graph generation

write.pajek.bgraph

Write graphs and their cohesive block hierarchy as Pajek files

Cocitation coupling

decompose.graph

Decompose a graph into components

graph.de.bruijn

De Bruijn graphs.

Sampling a random integer sequence

Various vertex shapes when plotting igraph graphs

watts.strogatz.game

The Watts-Strogatz small-world model

Common functions supporting community detection algorithms

Dyad census of a graph

edge.connectivity

Edge connectivity.

graph.full.bipartite

Create a full bipartite graph

K-core decomposition of graphs

igraph-parameters

Parameters for the igraph package

Find mutual edges in a directed graph

Reciprocity of graphs

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

biconnected.components

Biconnected components

ARPACK eigenvector calculation

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

graph.incidence

Create graphs from an incidence matrix

permute.vertices

Permute the vertices of a graph

spinglass.community

Finding communities in graphs based on statistical meachanics

Experimental basic igraph GUI

The Page Rank algorithm

graph.automorphisms

Number of automorphisms

articulation.points

Articulation points of a graph

Degree and degree distribution of the vertices

graph.constructors

Various methods for creating graphs

graph.structure

Method for structural manipulation of graphs

Vertex and edge sequences and iterators

Merging graph layouts

Shortest (directed or undirected) paths between vertices

Convert a general graph into a forest