Learn R Programming

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

igraph (version 0.5.4-1)

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

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

August 19th, 2010

Functions in igraph (0.5.4-1)

bipartite.projection

Project a bipartite graph

growing.random.game

Growing random graph generation

Burt's constraint

Geometric random graphs

degree.sequence.game

Generate random graphs with a given degree sequence

The igraph package

edge.betweenness.community

Community structure detection based on edge betweenness

graph.bipartite

Create a bipartite graph

Interactive plotting of graphs

graph.de.bruijn

De Bruijn graphs.

decompose.graph

Decompose a graph into components

graph.laplacian

Graph Laplacian

permute.vertices

Permute the vertices of a graph

Triad census, subgraphs with three vertices

Various vertex shapes when plotting igraph graphs

graph.incidence

Create graphs from an incidence matrix

K-core decomposition of graphs

Modularity of a community structure of a graph

Merging graph layouts

Diameter of a graph

fastgreedy.community

Community structure via greedy optimization of modularity

Girth of a graph

Adjacency lists

Shortest (directed or undirected) paths between vertices

Find mutual edges in a directed graph

Similarity measures of two vertices

graph.structure

Method for structural manipulation of graphs

write.pajek.bgraph

Write graphs and their cohesive block hierarchy as Pajek files

Generate coordinates for plotting graphs

cohesive.blocks

Calculate Cohesive Blocks

Kleinberg's centrality scores.

leading.eigenvector.community

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

graph-operators

Graph operators

Subgraph of a graph

Experimental basic igraph GUI

Creating (small) graphs via a simple interface

Reciprocity of graphs

igraph-parameters

Parameters for the igraph package

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Connected components of a graph

Running mean of a time series

In- or out- component of a vertex

Convert between directed and undirected graphs

graph.automorphisms

Number of automorphisms

watts.strogatz.game

The Watts-Strogatz small-world model

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

graph.constructors

Various methods for creating graphs

Creating named graphs

Average nearest neighbor degree

spinglass.community

Finding communities in graphs based on statistical meachanics

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

Line graph of a graph

Vertex and edge betweenness centrality

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

minimum.spanning.tree

Minimum spanning tree

Reading foreign file formats

Common functions supporting community detection algorithms

Plotting of graphs

Find Bonacich Power Centrality Scores of Network Positions

Degree and degree distribution of the vertices

articulation.points

Articulation points of a graph

Graphs from adjacency lists

Create graphs from adjacency lists

Convert a graph to an adjacency matrix or an edge list

Strength or weighted vertex degree

Creating a graph from LCF notation

Print graphs to the terminal

graph-isomorphism

Graph Isomorphism

walktrap.community

Community strucure via short random walks

topological.sort

Topological sorting of vertices in a graph

Transitivity of a graph

Vertex and edge sequences and iterators

ARPACK eigenvector calculation

Find the multiple or loop edges in a graph

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Cocitation coupling

The DrL graph layout generator

Writing the graph to a file in some format

forest.fire.game

Forest Fire Network Model

edge.connectivity

Edge connectivity.

Decide whether a graph is bipartite

The Page Rank algorithm

Gaining information about graph structure

Graph generation based on different vertex types

Neighborhood of graph vertices

Plot graphs and their cohesive block hierarchy

canonical.permutation

Canonical permutation of a graph

independent.vertex.sets

Independent vertex sets

Sampling a random integer sequence

igraph from/to graphNEL conversion

Convert igraph graphs to graphNEL objects or back

graph.full.bipartite

Create a full bipartite graph

label.propagation.community

Finding communities based on propagating labels

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

preference.game

Trait-based random generation

Convert a general graph into a forest

biconnected.components

Biconnected components

Graph, vertex and edge attributes

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

Dyad census of a graph

graph.adjacency

Create graphs from adjacency matrices

3D plotting of graphs with OpenGL

Fitting a power-law distribution function to discrete data

graph.data.frame

Creating igraph graphs from data frames

vertex.connectivity

Vertex connectivity.

Closeness centrality of vertices

Incidence matrix of a bipartite graph

Find Eigenvector Centrality Scores of Network Positions

Maximum flow in a network

Is this object a graph?

Rewires the endpoints of the edges of a graph randomly