Learn R Programming

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

igraph (version 0.4.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

432,884

Version

0.4.2

License

GPL version 2 or later (June, 1991)

Maintainer

Gabor Csardi

Last Published

February 10th, 2023

Functions in igraph (0.4.2)

Diameter of a graph

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

leading.eigenvector.community

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

aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging

Merging graph layouts

Geometric random graphs

graph-isomorphism

Graph Isomorphism

edge.betweenness.community

Community structure detection based on edge betweenness

Vertex and edge betweenness centrality

alpha.centrality

Find Bonacich alpha centrality scores of network positions

Convert a graph to an adjacency matrix or an edge list

preference.game

Trait-based random generation

Girth of a graph

Connected components of a graph

graph.laplacian

Graph Laplacian

Common functions supporting community detection algorithms

K-core decomposition of graphs

Transitivity of a graph

Remove loop and/or multiple edges from a graph

graph-operators

Graph operators

Graph generation based on different vertex types

graph.structure

Method for structural manipulation of graphs

Closeness centrality of vertices

Generate coordinates for plotting graphs

Graph, vertex and edge attributes

Modularity of a community structure of a graph

Running mean of a time series

decompose.graph

Decompose a graph into components

growing.random.game

Growing random graph generation

minimum.spanning.tree

Minimum spanning tree

Neighborhood of graph vertices

Convert between directed and undirected graphs

graph.constructors

Various methods for creating graphs

fastgreedy.community

Community structure via greedy optimization of modularity

Find Bonacich Power Centrality Scores of Network Positions

Burt's constraint

Find Eigenvector Centrality Scores of Network Positions

Sampling a random integer sequence

Measuring the driving force in evolving networks

measure.dynamics

Measuring the driving force in evolving networks

Rewires the endpoints of the edges of a graph randomly

Maximum flow in a network

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

Reading foreign file formats

3D plotting of graphs with OpenGL

independent.vertex.sets

Independent vertex sets

In- or out- component of a vertex

igraph.undocumented

Undocumented and unsupportted igraph functions

Shortest (directed or undirected) paths between vertices

degree.sequence.game

Generate random graphs with a given degree sequence

walktrap.community

Community strucure via short random walks

igraph-parameters

Parameters for the igraph package

edge.connectivity

Edge connectivity.

Reciprocity of graphs

Is this object a graph?

Vertex and edge sequences and iterators

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Cocitation coupling

Degree and degree distribution of the vertices

Subgraph of a graph

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

The Page Rank algorithm

Fitting a power-law distribution function to discrete data

Print graphs to the terminal

watts.strogatz.game

The Watts-Strogatz small-world model

vertex.connectivity

Vertex connectivity.

topological.sort

Topological sorting of vertices in a graph

Gaining information about graph structure

Interactive plotting of graphs

Plotting of graphs

Writing the graph to a file in some format

spinglass.community

Finding communities in graphs based on statistical meachanics