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

igraph (version 0.1.2)

Routines for network analysis.

Description

The igraph package contains routines for creating and manipulating graphs, and graph visualization. It can handle graphs with millions of vertices and edges.

Copy Link

Version

Install

install.packages('igraph')

Monthly Downloads

389,350

Version

0.1.2

License

GPL version 2 or later (June, 1991)

Maintainer

Gabor Csardi

Last Published

February 10th, 2023

Functions in igraph (0.1.2)

diameter

Diameter of a graph
degree.sequence.game

Generate random graphs with a given degree sequence
aging.prefatt.game

Generate an evolving random graph with preferential attachment and aging
power.law.fit

Fitting a power-law distribution function to discrete data
is.igraph

Is this object a graph?
attributes

Graph, vertex and edge attributes
layout

Generate coordinates for plotting graphs
conversion

Convert a graph to an adjacency matrix or an edge list
iterators

Vertex and edge sequences
closeness

Closeness centrality of vertices
graph.constructors

Various methods for creating graphs
degree

Degree and degree distribution of the vertices
measure.dynamics

Measuring the driving force in evolving networks
evcent

Find Eigenvector Centrality Scores of Network Positions
community

Undocumented functions for community structure detection
barabasi.game

Generate scale-free graphs according to the Barabasi-Albert model
erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model
igraph.sample

Sampling a random integer sequence
cocitation

Cocitation coupling
graph.structure

Method for structural manipulation of graphs
running.mean

Running mean of a time series
growing.random.game

Growing random graph generation
tkplot

Interactive plotting of graphs
components

In- or out- component of a vertex
plot.igraph

Plotting of graphs
read.graph

Reading foreign file formats
print.igraph

Print graphs to the terminal
betweenness

Vertex and edge betweenness centrality
shortest.paths

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

Writing the graph to a file in some format
simplify

Remove loop and/or multiple edges from a graph
clusters

Connected components of a graph
subgraph

Subgraph of a graph
transitivity

Transitivity of a graph
minimum.spanning.tree

Minimum spanning tree
structure.info

Gaining information about graph structure