Learn R Programming

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

igraph (version 1.3.2)

Network Analysis and Visualization

Description

Routines for simple graphs and network analysis. It can handle large graphs very well and provides functions for generating random and regular graphs, graph visualization, centrality methods and much more.

Copy Link

Version

Install

install.packages('igraph')

Monthly Downloads

366,150

Version

1.3.2

License

GPL (>= 2)

Homepage

https://igraph.org

Maintainer

Tam<c3><a1>s Nepusz

Last Published

June 13th, 2022

Functions in igraph (1.3.2)

The igraph package

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Add layout to graph

Edges of a graph

Are two vertices adjacent?

Add edges to a graph

Convert between directed and undirected graphs

Vertices of a graph

Conversion to igraph

arpack_defaults

ARPACK eigenvector calculation

articulation_points

Articulation points and bridges of a graph

as_adjacency_matrix

Convert a graph to an adjacency matrix

estimate_betweenness

Vertex and edge betweenness centrality

Number of automorphisms

Convert a graph to an edge list

Add vertices to a graph

as.matrix.igraph

Convert igraph objects to adjacency or edge list matrices

biconnected_components

Biconnected components

bipartite_mapping

Decide whether a graph is bipartite

Breadth-first search

all_simple_paths

List all simple paths from one source

bipartite_projection

Project a bipartite graph

Convert a vertex or edge sequence to an ordinary vector

Declare a numeric vector as a membership vector

Convert igraph graphs to graphNEL objects from the graph package

as_incidence_matrix

Incidence matrix of a bipartite graph

Centralize a graph according to the closeness of vertices

Finding community structure of a graph using the Leiden algorithm of Traag, van Eck & Waltman.

Theoretical maximum for closeness centralization

cluster_leading_eigen

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

Closeness centrality of vertices

Centralize a graph according to the betweenness of vertices

centr_betw_tmax

Theoretical maximum for betweenness centralization

as_long_data_frame

Convert a graph to a long data frame

Concatenate edge sequences

Adjacency lists

Assortativity coefficient

authority_score

Kleinberg's authority centrality scores.

Concatenate vertex sequences

cluster_edge_betweenness

Community structure detection based on edge betweenness

difference.igraph.es

Difference of edge sequences

canonical_permutation

Canonical permutation of a graph

difference.igraph.vs

Difference of vertex sequences

cohesive_blocks

Calculate Cohesive Blocks

centr_degree_tmax

Theoretical maximum for degree centralization

Centralize a graph according to the degrees of vertices

Create a consensus tree from several hierarchical random graph models

delete_edge_attr

Delete an edge attribute

Difference of two sets

The igraph console

Degree and degree distribution of the vertices

Cocitation coupling

difference.igraph

Difference of graphs

automorphism_group

Generating set of the automorphism group of a graph

cluster_fluid_communities

Community detection algorithm based on interacting fluids

count_isomorphisms

Count the number of isomorphic mappings between two graphs

component_distribution

Connected components of a graph

cluster_fast_greedy

Community structure via greedy optimization of modularity

Compose two graphs as binary relations

.apply_modifiers

Applies a set of constructor modifiers to an already constructed graph.

.extract_constructor_and_modifiers

Takes an argument list and extracts the constructor specification and constructor modifiers from it.

Disjoint union of graphs

global_efficiency

Efficiency of a graph

Dimensionality selection for singular values using profile likelihood.

cluster_spinglass

Finding communities in graphs based on statistical meachanics

Order (number of vertices) of a graph

graph_from_adj_list

Create graphs from adjacency lists

graph_from_literal

Creating (small) graphs via a simple interface

Centralize a graph according to the eigenvector centrality of vertices

categorical_pal

Palette for categories

graph_from_adjacency_matrix

Create graphs from adjacency matrices

Query edge attributes of a graph

Set one or more edge attributes

feedback_arc_set

Finding a feedback arc set in a graph

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Centralization of a graph

Functions to find cliques, ie. complete subgraphs in a graph

cluster_walktrap

Community structure via short random walks

cluster_infomap

Infomap community finding

Delete edges from a graph

delete_graph_attr

Delete a graph attribute

cluster_label_prop

Finding communities based on propagating labels

Eccentricity of the vertices in a graph

Set all or some graph attributes

Convert object to a graph

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Compares community structures using various metrics

Functions to deal with the result of network community detection

Optimal edge curvature when plotting graphs

cluster_louvain

Finding community structure by multi-level optimization of modularity

Get the id of a graph

Decompose a graph into components

Helper function for adding and deleting edges

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

has_eulerian_path

Find Eulerian paths or cycles in a graph

Component-wise layout

harmonic_centrality

Harmonic centrality of vertices

Complementer of a graph

intersection.igraph.es

Intersection of edge sequences

Find the edge ids based on the incident vertices of the edges

intersection.igraph

Intersection of graphs

graph_from_incidence_matrix

Create graphs from an incidence matrix

cluster_optimal

Optimal community structure

intersection.igraph.vs

Intersection of vertex sequences

Contract several vertices into a single one

Burt's constraint

count_subgraph_isomorphisms

Count the isomorphic mappings between a graph and the subgraphs of another graph

delete_vertex_attr

Delete a vertex attribute

delete_vertices

Delete vertices from a graph

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-indexing2

Select vertices and show their metadata

count_triangles

Find triangles in graphs

Run igraph demos, step by step

Convex hull of a set of vertices

Dyad census of a graph

Average nearest neighbor degree

laplacian_matrix

Graph Laplacian

Chordality of a graph

Rewires the endpoints of the edges of a graph to a random vertex

Compute local scan statistics on graphs

Make a new graph

Generate coordinates to place the vertices of a graph in a star-shape

The Reingold-Tilford graph layout algorithm

Girth of a graph

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

Graph diversity

Fit a hierarchical random graph model

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Fitting a power-law distribution function to discrete data

Depth-first search

K-core decomposition of graphs

Maximum flow in a graph

max_cardinality

Maximum cardinality search

graph_from_atlas

Create a graph from the Graph Atlas

Shortest (directed or undirected) paths between vertices

edge_attr_names

List names of edge attributes

Diverging palette

Diameter of a graph

edge_connectivity

Edge connectivity.

Hierarchical random graphs

Create a hierarchical random graph from an igraph graph

graph_attr_names

List names of graph attributes

Graph attributes of a graph

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Helper function to add or delete edges along a path

Parameters for the igraph package

Groups of a vertex partitioning

Create an igraph graph from a hierarchical random graph model

Kleinberg's hub centrality scores.

Delete vertices or edges from a graph

Neighborhood of graph vertices

Permute the vertices of a graph

greedy_vertex_coloring

Greedy vertex coloring

igraph-es-indexing

Indexing edge sequences

Creating igraph graphs from data frames or vice-versa

Run package tests

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

graph_from_graphdb

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

Graphlet decomposition of a graph

Incident vertices of some graph edges

graph_from_edgelist

Create a graph from an edge list matrix

igraph data structure versions

Print the only the head of an R object

Head of the edge(s) in a graph

Indent a printout

igraph-es-indexing2

Select edges and show their metadata

Intersection of two or more sets

Query igraph's version string

Check whether a graph is directed

Is a degree sequence graphical?

graph_from_isomorphism_class

Create a graph from an isomorphism class

Creating a graph from LCF notation

identical_graphs

Decide if two graphs are identical

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Independent vertex sets

Graph rewiring while preserving the degree distribution

Directed acyclic graphs

Check if a degree sequence is valid for a multi-graph

print.igraphHRG

Print a hierarchical random graph model to the screen

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

Replicate a graph multiple times

layout_randomly

Randomly place vertices on a plane or in 3d space

The Davidson-Harel layout algorithm

Vertex separators

layout.reingold.tilford

Deprecated layout functions

is_printer_callback

Is this a printer callback?

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

Decide whether a graph is a tree.

The size of the graph (number of edges)

is_min_separator

Minimal vertex separators

Is this object an igraph graph?

isomorphism_class

Isomorphism class of a graph

Calculate all isomorphic mappings between the vertices of two graphs

handle_vertex_type_arg

Common handler for vertex type arguments in igraph functions

SVD layout, this was removed from igraph

Spring layout, this was removed from igraph

The Kamada-Kawai layout algorithm

Creates a communities object.

make_de_bruijn_graph

De Bruijn graphs

make_full_graph

Create a full graph

make_chordal_ring

Create an extended chordal ring graph

Create an igraph graph from a list of edges, or a notable graph

layout_with_lgl

Large Graph Layout

Create a bipartite graph

Match Graphs given a seeding of vertex correspondences

make_kautz_graph

layout_with_drl

The DrL graph layout generator

layout_with_gem

The GEM layout algorithm

Create a lattice graph

The Fruchterman-Reingold layout algorithm

layout_as_bipartite

Simple two-row layout for bipartite graphs

Reverse the order in an edge sequence

sample_dirichlet

Sample from a Dirichlet distribution

Generate random graphs with a given degree sequence

Sample trees randomly and uniformly

Normalize layout

Getting and setting graph attributes, shortcut

The Page Rank algorithm

layout_with_mds

Graph layout by multidimensional scaling

Minimum spanning tree

Scan statistics on a time series of graphs

layout_with_graphopt

The graphopt layout algorithm

layout_with_sugiyama

The Sugiyama graph layout generator

Create a star graph, a tree with n vertices and n - 1 leaves

Create tree graphs

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

Semi-Projectors

Sequential palette

make_full_bipartite_graph

Create a full bipartite graph

Strength or weighted vertex degree

Merging graph layouts

Query and manipulate a graph as it were an adjacency matrix

Incident edges of a vertex in a graph

Incident edges of multiple vertices in a graph

print.nexusDatasetInfo

Query and download from the Nexus network repository

Minimum cut in a graph

Normalize coordinates for plotting graphs

Add vertices, edges or another graph to a graph

sample_correlated_gnp

Generate a new random graph from a given graph by randomly adding/removing edges

Weighted graphs

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

layout_in_circle

Graph layout with vertices on a circle.

sample_correlated_gnp_pair

Sample a pair of correlated G(n,p) random graphs

Decide if two graphs are isomorphic

Neighboring (adjacent) vertices in a graph

Simple grid layout

Choose an appropriate graph layout algorithm automatically

Plotting of graphs

Interactive plotting of graphs

Convert a tree graph to its Prufer sequence

Triad census, subgraphs with three vertices

Plotting the results on multiple SIR model runs

Convert a general graph into a forest

make_empty_graph

A graph with no edges

Predict edges based on a hierarchical random graph model

Query vertex attributes of a graph

layout_on_sphere

Graph layout with vertices on the surface of a sphere

Print graphs to the terminal

Minimum size vertex separators

make_full_citation_graph

Create a complete (full) citation graph

min_st_separators

Minimum size vertex separators

vertex_attr_names

List names of vertex attributes

Random graphs from vertex fitness scores

sample_dot_product

Generate random graphs according to the random dot product graph model

A graph with subgraphs that are each a random graph.

printer_callback

Create a printer callback function

All-in-one Function for the SCG of Matrices and Graphs

sample_k_regular

Create a random regular graph

Spectral Coarse Graining

Query and manipulate a graph as it were an adjacency list

Creating a graph from a given degree sequence, deterministically

In- or out- component of a vertex

plot_dendrogram

Community structure dendrogram plots

Reciprocity of graphs

Pie charts as vertices

Using pie charts as vertices in graph plots

with_igraph_opt

Run code with a temporary igraph options setting

Create a ring graph

make_line_graph

Line graph of a graph

Constructor modifier to add vertex attributes

The default R palette

plot_dendrogram.igraphHRG

HRG dendrogram plot

make_from_prufer

Create an undirected tree graph from its Prufer sequence

Magrittr's pipes

modularity.igraph

Modularity of a community structure of a graph

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Reverse the order in a vertex sequence

Better printing of R packages

Rewiring edges of a graph

Radius of a graph

3D plotting of graphs with OpenGL

Set one or more vertex attributes

print.igraph.es

Print an edge sequence to the screen

Sample from a hierarchical random graph model

Running mean of a time series

Random walk on a graph

print.igraph.vs

Show a vertex sequence on the screen

Error of the spectral coarse graining (SCG) approximation

Reading foreign file formats

SCG Problem Solver

Generate random graphs according to the G(n,m) Erdos-Renyi model

Sample from a random graph model

sample_forestfire

Forest Fire Network Model

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Generate random graphs according to the G(n,p) Erdos-Renyi model

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

Set a graph attribute

Set edge attributes

sample_last_cit

Random citation graphs

sample_bipartite

Bipartite random graphs

sample_spanning_tree

Samples from the spanning trees of a graph randomly and uniformly

Deprecated function, used to set random seed of the C library's RNG

Tails of the edge(s) in a graph

Experimental basic igraph GUI

List all (s,t)-cuts of a graph

SIR model on graphs

Subgraph of a graph

Union of two or more sets

subgraph_centrality

Find subgraph centrality scores of network positions

union.igraph.vs

Union of vertex sequences

weighted_cliques

Functions to find weighted cliques, ie. weighted complete subgraphs in a graph

union.igraph.es

Union of edge sequences

without_multiples

Constructor modifier to drop multiple edges

Geometric random graphs

vertex_connectivity

Vertex connectivity.

Union of graphs

Growing random graph generation

Writing the graph to a file in some format

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

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

set_vertex_attr

Set vertex attributes

sample_traits_callaway

Graph generation based on different vertex types

Trait-based random generation

Sample stochastic block model

Various vertex shapes when plotting igraph graphs

split_join_distance

Split-join distance of two community structures

Generate an evolving random graph with preferential attachment and aging

Eigenvalues and eigenvectors of the adjacency matrix of a graph

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

Sampling a random integer sequence

Constructor modifier to drop multiple and loop edges

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

stochastic_matrix

Stochastic matrix of a graph

Similarity measures of two vertices

List all minimum \((s,t)\)-cuts of a graph

sample_smallworld

The Watts-Strogatz small-world model

unique.igraph.es

Remove duplicate edges from an edge sequence

Topological sorting of vertices in a graph

Transitivity of a graph

Find mutual edges in a directed graph

Find the multiple or loop edges in a graph

Helper function for adding and deleting vertices

igraph data structure versions

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Construtor modifier to remove all attributes from a graph

Constructor modifier to drop loop edges

Constructor modifier to add graph attributes

Constructor modifier to add edge attributes