Learn R Programming

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

igraph (version 0.5.2-2)

Routines for simple graphs, network analysis.

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.2-2

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

May 8th, 2009

Functions in igraph (0.5.2-2)

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

graph.incidence

Create graphs from an incidence matrix

leading.eigenvector.community

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

minimum.spanning.tree

Minimum spanning tree

Connected components of a graph

graph.data.frame

Creating igraph graphs from data frames

graph.full.bipartite

Create a full bipartite graph

growing.random.game

Growing random graph generation

igraph from/to graphNEL conversion

Convert igraph graphs to graphNEL objects or back

Closeness centrality of vertices

Dyad census of a graph

graph.automorphisms

Number of automorphisms

biconnected.components

Biconnected components

Graph, vertex and edge attributes

Is this object a graph?

graph-isomorphism

Graph Isomorphism

Neighborhood of graph vertices

graph.constructors

Various methods for creating graphs

Merging graph layouts

Fitting a power-law distribution function to discrete data

Convert between directed and undirected graphs

Strength or weighted vertex degree

preference.game

Trait-based random generation

spinglass.community

Finding communities in graphs based on statistical meachanics

decompose.graph

Decompose a graph into components

igraph-parameters

Parameters for the igraph package

Generate coordinates for plotting graphs

K-core decomposition of graphs

fastgreedy.community

Community structure via greedy optimization of modularity

Sampling a random integer sequence

Kleinberg's centrality scores.

vertex.connectivity

Vertex connectivity.

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

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Diameter of a graph

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

Incidence matrix of a bipartite graph

forest.fire.game

Forest Fire Network Model

cohesive.blocks

Calculate Cohesive Blocks

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

Girth of a graph

Reciprocity of graphs

Rewires the endpoints of the edges of a graph randomly

walktrap.community

Community strucure via short random walks

Vertex and edge sequences and iterators

3D plotting of graphs with OpenGL

Transitivity of a graph

Gaining information about graph structure

Graph generation based on different vertex types

Writing the graph to a file in some format

edge.betweenness.community

Community structure detection based on edge betweenness

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Find Eigenvector Centrality Scores of Network Positions

permute.vertices

Permute the vertices of a graph

Cocitation coupling

Print graphs to the terminal

Burt's constraint

Creating a graph from LCF notation

Various vertex shapes when plotting igraph graphs

The DrL graph layout generator

Subgraph of a graph

Adjacency lists

graph.bipartite

Create a bipartite graph

bipartite.projection

Project a bipartite graph

graph.laplacian

Graph Laplacian

Measuring the driving force in evolving networks

Line graph of a graph

Convert a general graph into a forest

edge.connectivity

Edge connectivity.

measure.dynamics

Measuring the driving force in evolving networks

topological.sort

Topological sorting of vertices in a graph

Geometric random graphs

Similarity measures of two vertices

canonical.permutation

Canonical permutation of a graph

Convert a graph to an adjacency matrix or an edge list

independent.vertex.sets

Independent vertex sets

Decide whether a graph is bipartite

label.propagation.community

Finding communities based on propagating labels

Plotting of graphs

articulation.points

Articulation points of a graph

graph.adjacency

Create graphs from adjacency matrices

igraph.undocumented

Undocumented and unsupportted igraph functions

Find Bonacich Power Centrality Scores of Network Positions

ARPACK eigenvector calculation

Running mean of a time series

Degree and degree distribution of the vertices

degree.sequence.game

Generate random graphs with a given degree sequence

The Page Rank algorithm

write.pajek.bgraph

Write graphs and their cohesive block hierarchy as Pajek files

Average nearest neighbor degree

graph.de.bruijn

De Bruijn graphs.

graph.structure

Method for structural manipulation of graphs

Reading foreign file formats

Creating (small) graphs via a simple interface

Maximum flow in a network

graph-operators

Graph operators

Modularity of a community structure of a graph

Graphs from adjacency lists

Create graphs from adjacency lists

Experimental basic igraph GUI

watts.strogatz.game

The Watts-Strogatz small-world model

The igraph package

Interactive plotting of graphs

Vertex and edge betweenness centrality

Creating named graphs

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

Shortest (directed or undirected) paths between vertices

Triad census, subgraphs with three vertices

Common functions supporting community detection algorithms

In- or out- component of a vertex

Plot graphs and their cohesive block hierarchy