Learn R Programming

igraph (version 1.3.5)

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

432,884

Version

1.3.5

License

GPL (>= 2)

Homepage

https://igraph.org

Maintainer

Tam<c3><a1>s Nepusz

Last Published

September 22nd, 2022

Functions in igraph (1.3.5)

Add edges to a graph

Add vertices to a graph

Vertices of a graph

Edges of a graph

The igraph package

Add layout to graph

Convert between directed and undirected graphs

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Are two vertices adjacent?

as.matrix.igraph

Convert igraph objects to adjacency or edge list matrices

Assortativity coefficient

Declare a numeric vector as a membership vector

articulation_points

Articulation points and bridges of a graph

arpack_defaults

ARPACK eigenvector calculation

Conversion to igraph

as_adjacency_matrix

Convert a graph to an adjacency matrix

Adjacency lists

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

biconnected_components

Biconnected components

centr_betw_tmax

Theoretical maximum for betweenness centralization

Centralize a graph according to the betweenness of vertices

Breadth-first search

Convert a graph to an edge list

all_simple_paths

List all simple paths from one source

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Centralize a graph according to the eigenvector centrality of vertices

Convert igraph graphs to graphNEL objects from the graph package

authority_score

Kleinberg's authority centrality scores.

Convert a vertex or edge sequence to an ordinary vector

cluster_fast_greedy

Community structure via greedy optimization of modularity

Number of automorphisms

cluster_louvain

Finding community structure by multi-level optimization of modularity

as_incidence_matrix

Incidence matrix of a bipartite graph

cluster_fluid_communities

Community detection algorithm based on interacting fluids

Centralize a graph according to the closeness of vertices

Theoretical maximum for closeness centralization

cluster_edge_betweenness

Community structure detection based on edge betweenness

cluster_optimal

Optimal community structure

Closeness centrality of vertices

estimate_betweenness

Vertex and edge betweenness centrality

canonical_permutation

Canonical permutation of a graph

Centralization of a graph

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

categorical_pal

Palette for categories

cluster_leading_eigen

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

component_distribution

Connected components of a graph

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

Optimal edge curvature when plotting graphs

as_long_data_frame

Convert a graph to a long data frame

automorphism_group

Generating set of the automorphism group of a graph

Create a consensus tree from several hierarchical random graph models

Centralize a graph according to the degrees of vertices

centr_degree_tmax

Theoretical maximum for degree centralization

bipartite_mapping

Decide whether a graph is bipartite

Cocitation coupling

bipartite_projection

Project a bipartite graph

count_subgraph_isomorphisms

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

count_triangles

Find triangles in graphs

Compose two graphs as binary relations

cohesive_blocks

Calculate Cohesive Blocks

count_isomorphisms

Count the number of isomorphic mappings between two graphs

The igraph console

Component-wise layout

Complementer of a graph

delete_vertex_attr

Delete a vertex attribute

delete_vertices

Delete vertices from a graph

Concatenate edge sequences

Decompose a graph into components

Dimensionality selection for singular values using profile likelihood.

.extract_constructor_and_modifiers

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

Disjoint union of graphs

Concatenate vertex sequences

cluster_infomap

Infomap community finding

cluster_label_prop

Finding communities based on propagating labels

Burt's constraint

delete_edge_attr

Delete an edge attribute

Difference of two sets

difference.igraph.es

Difference of edge sequences

difference.igraph

Difference of graphs

Contract several vertices into a single one

Degree and degree distribution of the vertices

difference.igraph.vs

Difference of vertex sequences

.apply_modifiers

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

Fitting a power-law distribution function to discrete data

Neighborhood of graph vertices

Diverging palette

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

Shortest (directed or undirected) paths between vertices

Dyad census of a graph

Query edge attributes of a graph

.data and .env pronouns

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

edge_attr_names

List names of edge attributes

edge_connectivity

Edge connectivity.

Graph attributes of a graph

Convert object to a graph

Set all or some graph attributes

Order (number of vertices) of a graph

Get the id of a graph

Compares community structures using various metrics

cluster_walktrap

Community structure via short random walks

Convex hull of a set of vertices

Functions to deal with the result of network community detection

cluster_spinglass

Finding communities in graphs based on statistical meachanics

feedback_arc_set

Finding a feedback arc set in a graph

Diameter of a graph

Depth-first search

igraph data structure versions

graph_from_graphdb

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

Fit a hierarchical random graph model

Girth of a graph

global_efficiency

Efficiency of a graph

Eccentricity of the vertices in a graph

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

graph_from_adj_list

Create graphs from adjacency lists

graph_from_literal

Creating (small) graphs via a simple interface

graph_attr_names

List names of graph attributes

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

Creating a graph from LCF notation

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Delete edges from a graph

delete_graph_attr

Delete a graph attribute

K-core decomposition of graphs

Graph diversity

Incident vertices of some graph edges

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

graph_from_edgelist

Create a graph from an edge list matrix

Creating igraph graphs from data frames or vice-versa

Intersection of two or more sets

Create an igraph graph from a hierarchical random graph model

Print the only the head of an R object

Create a hierarchical random graph from an igraph graph

Helper function for adding and deleting edges

Hierarchical random graphs

intersection.igraph.vs

Intersection of vertex sequences

Graphlet decomposition of a graph

handle_vertex_type_arg

Common handler for vertex type arguments in igraph functions

harmonic_centrality

Harmonic centrality of vertices

igraph-es-indexing2

Select edges and show their metadata

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

greedy_vertex_coloring

Greedy vertex coloring

Groups of a vertex partitioning

The size of the graph (number of edges)

Kleinberg's hub centrality scores.

identical_graphs

Decide if two graphs are identical

intersection.igraph

Intersection of graphs

Delete vertices or edges from a graph

Is a degree sequence graphical?

Is this object an igraph graph?

layout_with_graphopt

The graphopt layout algorithm

Check whether a graph is directed

Calculate all isomorphic mappings between the vertices of two graphs

Independent vertex sets

Run package tests

Parameters for the igraph package

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

Set one or more edge attributes

SVD layout, this was removed from igraph

Decide if two graphs are isomorphic

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

The Fruchterman-Reingold layout algorithm

Compute local scan statistics on graphs

Incident edges of multiple vertices in a graph

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

Indent a printout

The Reingold-Tilford graph layout algorithm

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

isomorphism_class

Isomorphism class of a graph

Make a new graph

layout_with_gem

The GEM layout algorithm

Create a bipartite graph

make_chordal_ring

Create an extended chordal ring graph

Creates a communities object.

Weighted graphs

layout_on_sphere

Graph layout with vertices on the surface of a sphere

layout_randomly

Randomly place vertices on a plane or in 3d space

layout_in_circle

Graph layout with vertices on a circle.

igraph-es-indexing

Indexing edge sequences

intersection.igraph.es

Intersection of edge sequences

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

Average nearest neighbor degree

Graph rewiring while preserving the degree distribution

Create a ring graph

graph_from_adjacency_matrix

Create graphs from adjacency matrices

Decide whether a graph is a tree.

graph_from_incidence_matrix

Create graphs from an incidence matrix

graph_from_atlas

Create a graph from the Graph Atlas

igraph-vs-indexing2

Select vertices and show their metadata

make_kautz_graph

Run igraph demos, step by step

layout_with_drl

The DrL graph layout generator

Match Graphs given a seeding of vertex correspondences

Create tree graphs

Minimum spanning tree

The Davidson-Harel layout algorithm

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

Spring layout, this was removed from igraph

make_line_graph

Line graph of a graph

The Kamada-Kawai layout algorithm

Create a lattice graph

min_st_separators

Minimum size vertex separators

layout_with_sugiyama

The Sugiyama graph layout generator

layout_as_bipartite

Simple two-row layout for bipartite graphs

Helper function to add or delete edges along a path

Minimum size vertex separators

The Page Rank algorithm

modularity.igraph

Modularity of a community structure of a graph

Neighboring (adjacent) vertices in a graph

print.nexusDatasetInfo

Query and download from the Nexus network repository

max_cardinality

Maximum cardinality search

graph_from_isomorphism_class

Create a graph from an isomorphism class

make_full_graph

Create a full graph

make_de_bruijn_graph

De Bruijn graphs

Directed acyclic graphs

Chordality of a graph

Minimum cut in a graph

make_full_citation_graph

Create a complete (full) citation graph

layout.reingold.tilford

Deprecated layout functions

Query igraph's version string

laplacian_matrix

Graph Laplacian

Permute the vertices of a graph

has_eulerian_path

Find Eulerian paths or cycles in a graph

layout_with_lgl

Large Graph Layout

Plotting the results on multiple SIR model runs

layout_with_mds

Graph layout by multidimensional scaling

Predict edges based on a hierarchical random graph model

plot_dendrogram

Community structure dendrogram plots

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

print.igraph.es

Print an edge sequence to the screen

Print graphs to the terminal

Magrittr's pipes

Plotting of graphs

Head of the edge(s) in a graph

Incident edges of a vertex in a graph

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Getting and setting graph attributes, shortcut

is_printer_callback

Is this a printer callback?

Normalize layout

Vertex separators

is_min_separator

Minimal vertex separators

Add vertices, edges or another graph to a graph

Normalize coordinates for plotting graphs

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

Creating a graph from a given degree sequence, deterministically

Reading foreign file formats

print.igraph.vs

Show a vertex sequence on the screen

printer_callback

Create a printer callback function

print.igraphHRG

Print a hierarchical random graph model to the screen

Reverse the order in a vertex sequence

Reverse the order in an edge sequence

The default R palette

3D plotting of graphs with OpenGL

sample_dirichlet

Sample from a Dirichlet distribution

Rewiring edges of a graph

Better printing of R packages

Reverse edges in a graph

sample_dot_product

Generate random graphs according to the random dot product graph model

Choose an appropriate graph layout algorithm automatically

Simple grid layout

Generate random graphs with a given degree sequence

Random graphs from vertex fitness scores

sample_forestfire

Forest Fire Network Model

Radius of a graph

make_empty_graph

A graph with no edges

sample_correlated_gnp

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

plot_dendrogram.igraphHRG

HRG dendrogram plot

Generate an evolving random graph with preferential attachment and aging

Geometric random graphs

make_full_bipartite_graph

Create a full bipartite graph

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Running mean of a time series

sample_correlated_gnp_pair

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

make_from_prufer

Create an undirected tree graph from its Prufer sequence

Random walk on a graph

Maximum flow in a graph

Reciprocity of graphs

Merging graph layouts

A graph with subgraphs that are each a random graph.

Generate random graphs using preferential attachment

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

sample_k_regular

Create a random regular graph

Sample trees randomly and uniformly

Sample from a hierarchical random graph model

Growing random graph generation

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

sample_smallworld

The Watts-Strogatz small-world model

sample_traits_callaway

Graph generation based on different vertex types

Replicate a graph multiple times

Sample from a random graph model

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

sample_bipartite

Bipartite random graphs

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

sample_last_cit

Random citation graphs

Error of the spectral coarse graining (SCG) approximation

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

Set edge attributes

SCG Problem Solver

Trait-based random generation

Semi-Projectors

Sequential palette

Sample stochastic block model

sample_spanning_tree

Samples from the spanning trees of a graph randomly and uniformly

Scan statistics on a time series of graphs

Spectral Coarse Graining

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

Sampling a random integer sequence

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Set a graph attribute

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

stochastic_matrix

Stochastic matrix of a graph

Similarity measures of two vertices

Constructor modifier to drop multiple and loop edges

Various vertex shapes when plotting igraph graphs

set_vertex_attr

Set vertex attributes

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

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

SIR model on graphs

In- or out- component of a vertex

Query and manipulate a graph as it were an adjacency list

split_join_distance

Split-join distance of two community structures

subgraph_centrality

Find subgraph centrality scores of network positions

Subgraph of a graph

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

union.igraph.es

Union of edge sequences

Strength or weighted vertex degree

Query and manipulate a graph as it were an adjacency matrix

Convert a tree graph to its Prufer sequence

Interactive plotting of graphs

Experimental basic igraph GUI

Convert a general graph into a forest

Union of graphs

Tails of the edge(s) in a graph

Union of two or more sets

Triad census, subgraphs with three vertices

union.igraph.vs

Union of vertex sequences

Topological sorting of vertices in a graph

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

unique.igraph.es

Remove duplicate edges from an edge sequence

Transitivity of a graph

vertex_connectivity

Vertex connectivity.

weighted_cliques

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

Helper function for adding and deleting vertices

igraph data structure versions

Constructor modifier to add vertex attributes

with_igraph_opt

Run code with a temporary igraph options setting

Constructor modifier to drop loop edges

Construtor modifier to remove all attributes from a graph

Query vertex attributes of a graph

Pie charts as vertices

Using pie charts as vertices in graph plots

without_multiples

Constructor modifier to drop multiple edges

Set one or more vertex attributes

vertex_attr_names

List names of vertex attributes

Writing the graph to a file in some format

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

Constructor modifier to add graph attributes

Constructor modifier to add edge attributes