Learn R Programming

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

igraph (version 0.5.5-4)

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.5.5-4

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

December 13th, 2011

Functions in igraph (0.5.5-4)

graph.de.bruijn

De Bruijn graphs.

Diameter of a graph

The igraph package

Incidence matrix of a bipartite graph

decompose.graph

Decompose a graph into components

The DrL graph layout generator

Burt's constraint

graph.data.frame

Creating igraph graphs from data frames

ARPACK eigenvector calculation

Vertex and edge betweenness centrality

alpha.centrality

Find Bonacich alpha centrality scores of network positions

graph.laplacian

Graph Laplacian

graph.constructors

Various methods for creating graphs

Reciprocity of graphs

Find Bonacich Power Centrality Scores of Network Positions

Girth of a graph

Creating (small) graphs via a simple interface

igraph-parameters

Parameters for the igraph package

graph.bipartite

Create a bipartite graph

Average nearest neighbor degree

Dyad census of a graph

Modularity of a community structure of a graph

Maximum flow in a network

Graphs from adjacency lists

Create graphs from adjacency lists

Line graph of a graph

Graph, vertex and edge attributes

Convert between directed and undirected graphs

edge.betweenness.community

Community structure detection based on edge betweenness

Various vertex shapes when plotting igraph graphs

independent.vertex.sets

Independent vertex sets

leading.eigenvector.community

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

Cocitation coupling

Creating a graph from LCF notation

Is this object a graph?

cohesive.blocks

Calculate Cohesive Blocks

label.propagation.community

Finding communities based on propagating labels

Connected components of a graph

preference.game

Trait-based random generation

growing.random.game

Growing random graph generation

In- or out- component of a vertex

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

Degree and degree distribution of the vertices

The Page Rank algorithm

3D plotting of graphs with OpenGL

K-core decomposition of graphs

Common functions supporting community detection algorithms

Sampling a random integer sequence

Print graphs to the terminal

spinglass.community

Finding communities in graphs based on statistical meachanics

minimum.spanning.tree

Minimum spanning tree

walktrap.community

Community strucure via short random walks

Subgraph of a graph

Writing the graph to a file in some format

Decide whether a graph is bipartite

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Shortest (directed or undirected) paths between vertices

Triad census, subgraphs with three vertices

graph-operators

Graph operators

Reading foreign file formats

watts.strogatz.game

The Watts-Strogatz small-world model

graph.structure

Method for structural manipulation of graphs

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back

Interactive plotting of graphs

Running mean of a time series

Find the multiple or loop edges in a graph

vertex.connectivity

Vertex connectivity.

Plot graphs and their cohesive block hierarchy

bipartite.projection

Project a bipartite graph

Fitting a power-law distribution function to discrete data

Creating named graphs

Convert a general graph into a forest

graph.full.bipartite

Create a full bipartite graph

Find Eigenvector Centrality Scores of Network Positions

graph.incidence

Create graphs from an incidence matrix

graph-isomorphism

Graph Isomorphism

Vertex and edge sequences and iterators

Strength or weighted vertex degree

Rewires the endpoints of the edges of a graph randomly

Gaining information about graph structure

Neighborhood of graph vertices

biconnected.components

Biconnected components

Geometric random graphs

permute.vertices

Permute the vertices of a graph

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

Plotting of graphs

Similarity measures of two vertices

graph.adjacency

Create graphs from adjacency matrices

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

forest.fire.game

Forest Fire Network Model

Kleinberg's centrality scores.

Closeness centrality of vertices

edge.connectivity

Edge connectivity.

Generate coordinates for plotting graphs

write.pajek.bgraph

Write graphs and their cohesive block hierarchy as Pajek files

Convert a graph to an adjacency matrix or an edge list

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

canonical.permutation

Canonical permutation of a graph

Graph generation based on different vertex types

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Find mutual edges in a directed graph

fastgreedy.community

Community structure via greedy optimization of modularity

Transitivity of a graph

topological.sort

Topological sorting of vertices in a graph

degree.sequence.game

Generate random graphs with a given degree sequence

Experimental basic igraph GUI

articulation.points

Articulation points of a graph

graph.automorphisms

Number of automorphisms

Adjacency lists

Merging graph layouts