Learn R Programming

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

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

379,721

Version

0.5.5-1

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

December 17th, 2010

Functions in igraph (0.5.5-1)

Cocitation coupling

edge.betweenness.community

Community structure detection based on edge betweenness

Plot graphs and their cohesive block hierarchy

Kleinberg's centrality scores.

K-core decomposition of graphs

graph.structure

Method for structural manipulation of graphs

Plotting of graphs

Shortest (directed or undirected) paths between vertices

3D plotting of graphs with OpenGL

graph.data.frame

Creating igraph graphs from data frames

Geometric random graphs

Subgraph of a graph

Diameter of a graph

ARPACK eigenvector calculation

The igraph package

The Page Rank algorithm

Find Bonacich Power Centrality Scores of Network Positions

biconnected.components

Biconnected components

Connected components of a graph

permute.vertices

Permute the vertices of a graph

Convert a general graph into a forest

graph-isomorphism

Graph Isomorphism

Maximum flow in a network

Line graph of a graph

label.propagation.community

Finding communities based on propagating labels

topological.sort

Topological sorting of vertices in a graph

Convert between directed and undirected graphs

graph.bipartite

Create a bipartite graph

Creating a graph from LCF notation

articulation.points

Articulation points of a graph

independent.vertex.sets

Independent vertex sets

cohesive.blocks

Calculate Cohesive Blocks

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

canonical.permutation

Canonical permutation of a graph

Print graphs to the terminal

graph.constructors

Various methods for creating graphs

Gaining information about graph structure

Graph, vertex and edge attributes

Rewires the endpoints of the edges of a graph randomly

Find the multiple or loop edges in a graph

Interactive plotting of graphs

Writing the graph to a file in some format

Modularity of a community structure of a graph

Transitivity of a graph

Triad census, subgraphs with three vertices

Adjacency lists

Find mutual edges in a directed graph

Neighborhood of graph vertices

edge.connectivity

Edge connectivity.

fastgreedy.community

Community structure via greedy optimization of modularity

Strength or weighted vertex degree

growing.random.game

Growing random graph generation

spinglass.community

Finding communities in graphs based on statistical meachanics

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

vertex.connectivity

Vertex connectivity.

Degree and degree distribution of the vertices

In- or out- component of a vertex

Graphs from adjacency lists

Create graphs from adjacency lists

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

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

graph.de.bruijn

De Bruijn graphs.

Reciprocity of graphs

Common functions supporting community detection algorithms

watts.strogatz.game

The Watts-Strogatz small-world model

Creating (small) graphs via a simple interface

Graph generation based on different vertex types

Closeness centrality of vertices

Burt's constraint

Convert a graph to an adjacency matrix or an edge list

Creating named graphs

graph.incidence

Create graphs from an incidence matrix

Decide whether a graph is bipartite

Generate coordinates for plotting graphs

The DrL graph layout generator

Girth of a graph

Average nearest neighbor degree

igraph from/to graphNEL conversion

Convert igraph graphs to graphNEL objects or back

Similarity measures of two vertices

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Dyad census of a graph

graph.laplacian

Graph Laplacian

Merging graph layouts

graph-operators

Graph operators

Experimental basic igraph GUI

Running mean of a time series

walktrap.community

Community strucure via short random walks

graph.automorphisms

Number of automorphisms

Vertex and edge sequences and iterators

degree.sequence.game

Generate random graphs with a given degree sequence

Various vertex shapes when plotting igraph graphs

bipartite.projection

Project a bipartite graph

decompose.graph

Decompose a graph into components

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Find Eigenvector Centrality Scores of Network Positions

graph.full.bipartite

Create a full bipartite graph

igraph-parameters

Parameters for the igraph package

Is this object a graph?

write.pajek.bgraph

Write graphs and their cohesive block hierarchy as Pajek files

forest.fire.game

Forest Fire Network Model

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

Sampling a random integer sequence

preference.game

Trait-based random generation

Reading foreign file formats

graph.adjacency

Create graphs from adjacency matrices

Vertex and edge betweenness centrality

Incidence matrix of a bipartite graph

leading.eigenvector.community

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

minimum.spanning.tree

Minimum spanning tree

Fitting a power-law distribution function to discrete data

conversion between igraph and graphNEL graphs

Convert igraph graphs to graphNEL objects or back