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

igraph (version 0.3.3)

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

License

GPL version 2 or later (June, 1991)

Maintainer

Gabor Csardi

Last Published

February 10th, 2023

Functions in igraph (0.3.3)

bonpow

Find Bonacich Power Centrality Scores of Network Positions
edge.connectivity

Edge connectivity.
write.graph

Writing the graph to a file in some format
is.igraph

Is this object a graph?
erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model
layout.merge

Merging graph layouts
cocitation

Cocitation coupling
degree

Degree and degree distribution of the vertices
clusters

Connected components of a graph
igraph-parameters

Parameters for the igraph package
subgraph

Subgraph of a graph
growing.random.game

Growing random graph generation
independent.vertex.sets

Independent vertex sets
graph.density

Graph density
layout

Generate coordinates for plotting graphs
decompose.graph

Decompose a graph into components
graph-motifs

Graph motifs
barabasi.game

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

Reciprocity of graphs
degree.sequence.game

Generate random graphs with a given degree sequence
grg.game

Geometric random graphs
iterators

Vertex and edge sequences and iterators
running.mean

Running mean of a time series
components

In- or out- component of a vertex
traits

Graph generation based on different vertex types
rewire

Graph rewiring
alpha.centrality

Find Bonacich alpha centrality scores of network positions
spinglass.community

Finding communities in graphs based on statistical meachanics
cliques

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

The Page Rank algorithm
power.law.fit

Fitting a power-law distribution function to discrete data
aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging
shortest.paths

Shortest (directed or undirected) paths between vertices
graph.constructors

Various methods for creating graphs
simplify

Remove loop and/or multiple edges from a graph
graph.maxflow

Maximum flow in a network
graph.structure

Method for structural manipulation of graphs
community

Undocumented functions for community structure detection
constraint

Burt's constraint
betweenness

Vertex and edge betweenness centrality
structure.info

Gaining information about graph structure
graph-isomorphism

Graph Isomorphism
rewire.edges

Rewires the endpoints of the edges of a graph randomly
as.directed

Convert between directed and undirected graphs
rglplot

3D plotting of graphs with OpenGL
graph.coreness

K-core decomposition of graphs
igraph.sample

Sampling a random integer sequence
minimum.spanning.tree

Minimum spanning tree
measure.dynamics

Measuring the driving force in evolving networks
read.graph

Reading foreign file formats
transitivity

Transitivity of a graph
vertex.connectivity

Vertex connectivity.
attributes

Graph, vertex and edge attributes
evcent

Find Eigenvector Centrality Scores of Network Positions
diameter

Diameter of a graph
graph.laplacian

Graph Laplacian
neighborhood

Neighborhood of graph vertices
watts.strogatz.game

The Watts-Strogatz small-world model
closeness

Closeness centrality of vertices
conversion

Convert a graph to an adjacency matrix or an edge list
graph-operators

Graph operators
plot.igraph

Plotting of graphs
print.igraph

Print graphs to the terminal
tkplot

Interactive plotting of graphs
preference.game

Trait-based random generation