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

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

733,150

Version

0.3.1

License

GPL version 2 or later (June, 1991)

Maintainer

Gabor Csardi

Last Published

February 10th, 2023

Functions in igraph (0.3.1)

attributes

Graph, vertex and edge attributes
barabasi.game

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

Closeness centrality of vertices
tkplot

Interactive plotting of graphs
grg.game

Geometric random graphs
igraph-parameters

Parameters for the igraph package
power.law.fit

Fitting a power-law distribution function to discrete data
neighborhood

Neighborhood of graph vertices
constraint

Burt's constraint
graph.constructors

Various methods for creating graphs
layout

Generate coordinates for plotting graphs
rglplot

3D plotting of graphs with OpenGL
graph-operators

Graph operators
edge.connectivity

Edge connectivity.
traits

Graph generation based on different vertex types
transitivity

Transitivity of a graph
graph.structure

Method for structural manipulation of graphs
erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model
evcent

Find Eigenvector Centrality Scores of Network Positions
community

Undocumented functions for community structure detection
conversion

Convert a graph to an adjacency matrix or an edge list
structure.info

Gaining information about graph structure
simplify

Remove loop and/or multiple edges from a graph
betweenness

Vertex and edge betweenness centrality
growing.random.game

Growing random graph generation
layout.merge

Merging graph layouts
degree

Degree and degree distribution of the vertices
decompose.graph

Decompose a graph into components
bonpow

Find Bonacich Power Centrality Scores of Network Positions
igraph.sample

Sampling a random integer sequence
as.directed

Convert between directed and undirected graphs
spinglass.community

Finding communities in graphs based on statistical meachanics
page.rank

The Page Rank algorithm
shortest.paths

Shortest (directed or undirected) paths between vertices
cocitation

Cocitation coupling
iterators

Vertex and edge sequences and iterators
graph.density

Graph density
graph.laplacian

Graph Laplacian
preference.game

Trait-based random generation
components

In- or out- component of a vertex
running.mean

Running mean of a time series
degree.sequence.game

Generate random graphs with a given degree sequence
measure.dynamics

Measuring the driving force in evolving networks
write.graph

Writing the graph to a file in some format
rewire

Graph rewiring
graph-isomorphism

Graph Isomorphism
aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging
clusters

Connected components of a graph
is.igraph

Is this object a graph?
subgraph

Subgraph of a graph
graph-motifs

Graph motifs
reciprocity

Reciprocity of graphs
read.graph

Reading foreign file formats
diameter

Diameter of a graph
minimum.spanning.tree

Minimum spanning tree
vertex.connectivity

Vertex connectivity.
graph.maxflow

Maximum flow in a network
plot.igraph

Plotting of graphs
print.igraph

Print graphs to the terminal