Learn R Programming

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

igraph (version 0.5.1)

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

555,428

Version

0.5.1

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

February 10th, 2023

Functions in igraph (0.5.1)

The DrL graph layout generator

minimum.spanning.tree

Minimum spanning tree

Plotting of graphs

Subgraph of a graph

spinglass.community

Finding communities in graphs based on statistical meachanics

Common functions supporting community detection algorithms

Find the multiple or loop edges in a graph

graph-isomorphism

Graph Isomorphism

Reading foreign file formats

canonical.permutation

Canonical permutation of a graph

Convert between directed and undirected graphs

Graphs from adjacency lists

Create graphs from adjacency lists

biconnected.components

Biconnected components

Modularity of a community structure of a graph

Find Bonacich Power Centrality Scores of Network Positions

topological.sort

Topological sorting of vertices in a graph

degree.sequence.game

Generate random graphs with a given degree sequence

igraph from/to graphNEL conversion

Convert igraph graphs to graphNEL objects or back

forest.fire.game

Forest Fire Network Model

Creating (small) graphs via a simple interface

Graph generation based on different vertex types

Fitting a power-law distribution function to discrete data

Plot graphs and their cohesive block hierarchy

Running mean of a time series

Measuring the driving force in evolving networks

Line graph of a graph

Transitivity of a graph

graph-operators

Graph operators

Closeness centrality of vertices

K-core decomposition of graphs

Various vertex shapes when plotting igraph graphs

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Kleinberg's centrality scores.

Interactive plotting of graphs

growing.random.game

Growing random graph generation

graph.adjacency

Create graphs from adjacency matrices

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Generate coordinates for plotting graphs

The Page Rank algorithm

Dyad census of a graph

Find Eigenvector Centrality Scores of Network Positions

3D plotting of graphs with OpenGL

Connected components of a graph

Girth of a graph

Creating a graph from LCF notation

Neighborhood of graph vertices

Is this object a graph?

igraph-parameters

Parameters for the igraph package

Vertex and edge sequences and iterators

articulation.points

Articulation points of a graph

In- or out- component of a vertex

Burt's constraint

Similarity measures of two vertices

Diameter of a graph

graph.constructors

Various methods for creating graphs

Creating named graphs

preference.game

Trait-based random generation

watts.strogatz.game

The Watts-Strogatz small-world model

Sampling a random integer sequence

permute.vertices

Permute the vertices of a graph

Vertex and edge betweenness centrality

Writing the graph to a file in some format

vertex.connectivity

Vertex connectivity.

Print graphs to the terminal

Convert a graph to an adjacency matrix or an edge list

measure.dynamics

Measuring the driving force in evolving networks

walktrap.community

Community strucure via short random walks

ARPACK eigenvector calculation

Rewires the endpoints of the edges of a graph randomly

Maximum flow in a network

igraph.undocumented

Undocumented and unsupportted igraph functions

Triad census, subgraphs with three vertices

write.pajek.bgraph

Write graphs and their cohesive block hierarchy as Pajek files

Merging graph layouts

The igraph package

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

graph.de.bruijn

De Bruijn graphs.

leading.eigenvector.community

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

Shortest (directed or undirected) paths between vertices

Gaining information about graph structure

graph.automorphisms

Number of automorphisms

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

Cocitation coupling

edge.betweenness.community

Community structure detection based on edge betweenness

Find mutual edges in a directed graph

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

graph.data.frame

Creating igraph graphs from data frames

cohesive.blocks

Calculate Cohesive Blocks

Adjacency lists

decompose.graph

Decompose a graph into components

edge.connectivity

Edge connectivity.

Reciprocity of graphs

graph.laplacian

Graph Laplacian

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Geometric random graphs

independent.vertex.sets

Independent vertex sets

Graph, vertex and edge attributes

fastgreedy.community

Community structure via greedy optimization of modularity

Degree and degree distribution of the vertices

graph.structure

Method for structural manipulation of graphs

bipartite.projection

Project a bipartite graph

Strength or weighted vertex degree

graph.full.bipartite

Create a full bipartite graph

graph.bipartite

Create a bipartite graph

graph.incidence

Create graphs from an incidence matrix

Convert a general graph into a forest

label.propagation.community

Finding communities based on propagating labels

Experimental basic igraph GUI

Decide whether a graph is bipartite

Average nearest neighbor degree

Incidence matrix of a bipartite graph

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