Learn R Programming

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

igraph (version 0.4.4)

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

License

GPL version 2 or later (June, 1991)

Maintainer

Gabor Csardi

Last Published

February 10th, 2023

Functions in igraph (0.4.4)

In- or out- component of a vertex

alpha.centrality

Find Bonacich alpha centrality scores of network positions

graph.laplacian

Graph Laplacian

growing.random.game

Growing random graph generation

Is this object a graph?

Generate coordinates for plotting graphs

Vertex and edge betweenness centrality

Transitivity of a graph

Modularity of a community structure of a graph

Find Eigenvector Centrality Scores of Network Positions

Closeness centrality of vertices

fastgreedy.community

Community structure via greedy optimization of modularity

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

preference.game

Trait-based random generation

Rewires the endpoints of the edges of a graph randomly

Degree and degree distribution of the vertices

spinglass.community

Finding communities in graphs based on statistical meachanics

graph.constructors

Various methods for creating graphs

Reading foreign file formats

Girth of a graph

decompose.graph

Decompose a graph into components

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

watts.strogatz.game

The Watts-Strogatz small-world model

3D plotting of graphs with OpenGL

edge.betweenness.community

Community structure detection based on edge betweenness

Shortest (directed or undirected) paths between vertices

Find Bonacich Power Centrality Scores of Network Positions

walktrap.community

Community strucure via short random walks

degree.sequence.game

Generate random graphs with a given degree sequence

Cocitation coupling

Connected components of a graph

Plotting of graphs

Burt's constraint

Vertex and edge sequences and iterators

graph-operators

Graph operators

Common functions supporting community detection algorithms

Neighborhood of graph vertices

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

measure.dynamics

Measuring the driving force in evolving networks

topological.sort

Topological sorting of vertices in a graph

Running mean of a time series

minimum.spanning.tree

Minimum spanning tree

The Page Rank algorithm

igraph-parameters

Parameters for the igraph package

Convert between directed and undirected graphs

Writing the graph to a file in some format

Graph generation based on different vertex types

Remove loop and/or multiple edges from a graph

K-core decomposition of graphs

Interactive plotting of graphs

Print graphs to the terminal

graph.structure

Method for structural manipulation of graphs

Subgraph of a graph

Convert a graph to an adjacency matrix or an edge list

Reciprocity of graphs

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

graph-isomorphism

Graph Isomorphism

Diameter of a graph

Maximum flow in a network

independent.vertex.sets

Independent vertex sets

Measuring the driving force in evolving networks

edge.connectivity

Edge connectivity.

Merging graph layouts

Fitting a power-law distribution function to discrete data

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

leading.eigenvector.community

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

Sampling a random integer sequence

Graph, vertex and edge attributes

Gaining information about graph structure

Geometric random graphs

vertex.connectivity

Vertex connectivity.

igraph.undocumented

Undocumented and unsupportted igraph functions