Learn R Programming

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

igraph (version 1.3.1)

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

405,103

Version

1.3.1

License

GPL (>= 2)

Homepage

https://igraph.org

Maintainer

Tam<c3><a1>s Nepusz

Last Published

April 20th, 2022

Functions in igraph (1.3.1)

all_simple_paths

List all simple paths from one source

Convert a vertex or edge sequence to an ordinary vector

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

Convert igraph graphs to graphNEL objects from the graph package

Add layout to graph

as.matrix.igraph

Convert igraph objects to adjacency or edge list matrices

Add vertices to a graph

Add edges to a graph

Edges of a graph

Declare a numeric vector as a membership vector

estimate_betweenness

Vertex and edge betweenness centrality

Theoretical maximum for closeness centralization

Centralize a graph according to the eigenvector centrality of vertices

Centralize a graph according to the closeness of vertices

Convert between directed and undirected graphs

articulation_points

Articulation points and bridges of a graph

Number of automorphisms

arpack_defaults

ARPACK eigenvector calculation

Vertices of a graph

Assortativity coefficient

authority_score

Kleinberg's authority centrality scores.

Concatenate vertex sequences

Concatenate edge sequences

as_long_data_frame

Convert a graph to a long data frame

as_incidence_matrix

Incidence matrix of a bipartite graph

Centralize a graph according to the betweenness of vertices

centr_betw_tmax

Theoretical maximum for betweenness centralization

Adjacency lists

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

Centralization of a graph

centr_eigen_tmax

Theoretical maximum for betweenness centralization

alpha_centrality

Find Bonacich alpha centrality scores of network positions

automorphism_group

Generating set of the automorphism group of a graph

cluster_louvain

Finding community structure by multi-level optimization of modularity

Are two vertices adjacent?

as_adjacency_matrix

Convert a graph to an adjacency matrix

Convert a graph to an edge list

bipartite_projection

Project a bipartite graph

bipartite_mapping

Decide whether a graph is bipartite

centr_degree_tmax

Theoretical maximum for degree centralization

Centralize a graph according to the degrees of vertices

cluster_infomap

Infomap community finding

cluster_label_prop

Finding communities based on propagating labels

Create a consensus tree from several hierarchical random graph models

count_isomorphisms

Count the number of isomorphic mappings between two graphs

cluster_optimal

Optimal community structure

Conversion to igraph

categorical_pal

Palette for categories

canonical_permutation

Canonical permutation of a graph

count_subgraph_isomorphisms

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

The igraph console

difference.igraph.vs

Difference of vertex sequences

count_triangles

Find triangles in graphs

difference.igraph.es

Difference of edge sequences

Dimensionality selection for singular values using profile likelihood.

cluster_fluid_communities

Community detection algorithm based on interacting fluids

cluster_fast_greedy

Community structure via greedy optimization of modularity

biconnected_components

Biconnected components

cluster_spinglass

Finding communities in graphs based on statistical meachanics

Breadth-first search

Cocitation coupling

cluster_walktrap

Community structure via short random walks

Functions to deal with the result of network community detection

cohesive_blocks

Calculate Cohesive Blocks

edge_attr_names

List names of edge attributes

component_distribution

Connected components of a graph

Disjoint union of graphs

Depth-first search

Degree and degree distribution of the vertices

Eccentricity of the vertices in a graph

Helper function for adding and deleting edges

delete_edge_attr

Delete an edge attribute

.apply_modifiers

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

Diameter of a graph

Closeness centrality of vertices

Compares community structures using various metrics

cluster_edge_betweenness

Community structure detection based on edge betweenness

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

cluster_leading_eigen

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

.extract_constructor_and_modifiers

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

edge_connectivity

Edge connectivity.

Compose two graphs as binary relations

graph_from_adj_list

Create graphs from adjacency lists

delete_vertex_attr

Delete a vertex attribute

delete_vertices

Delete vertices from a graph

Contract several vertices into a single one

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

Burt's constraint

Convex hull of a set of vertices

Complementer of a graph

K-core decomposition of graphs

Dyad census of a graph

Component-wise layout

Optimal edge curvature when plotting graphs

The size of the graph (number of edges)

greedy_vertex_coloring

Greedy vertex coloring

Groups of a vertex partitioning

graph_from_atlas

Create a graph from the Graph Atlas

graph_from_adjacency_matrix

Create graphs from adjacency matrices

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

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Delete edges from a graph

Creating igraph graphs from data frames or vice-versa

feedback_arc_set

Finding a feedback arc set in a graph

Decompose a graph into components

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Set one or more edge attributes

Query edge attributes of a graph

Head of the edge(s) in a graph

Print the only the head of an R object

graph_from_incidence_matrix

Create graphs from an incidence matrix

Graphlet decomposition of a graph

igraph data structure versions

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

igraph-es-indexing

Indexing edge sequences

Girth of a graph

has_eulerian_path

Find Eulerian paths or cycles in a graph

Difference of two sets

delete_graph_attr

Delete a graph attribute

harmonic_centrality

Harmonic centrality of vertices

difference.igraph

Difference of graphs

handle_vertex_type_arg

Common handler for vertex type arguments in igraph functions

igraph-vs-indexing2

Select vertices and show their metadata

Incident edges of multiple vertices in a graph

Is a degree sequence graphical?

igraph-vs-indexing

Indexing vertex sequences

Check whether a graph is directed

Incident edges of a vertex in a graph

Getting and setting graph attributes, shortcut

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

igraph-es-indexing2

Select edges and show their metadata

Average nearest neighbor degree

Graph diversity

Incident vertices of some graph edges

Shortest (directed or undirected) paths between vertices

Fit a hierarchical random graph model

Graph attributes of a graph

Indent a printout

Intersection of two or more sets

Neighborhood of graph vertices

Fitting a power-law distribution function to discrete data

Diverging palette

graph_from_edgelist

Create a graph from an edge list matrix

Directed acyclic graphs

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

global_efficiency

Efficiency of a graph

graph_from_isomorphism_class

Create a graph from an isomorphism class

identical_graphs

Decide if two graphs are identical

graph_attr_names

List names of graph attributes

Creating a graph from LCF notation

Kleinberg's hub centrality scores.

Create an igraph graph from a hierarchical random graph model

Delete vertices or edges from a graph

graph_from_graphdb

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

laplacian_matrix

Graph Laplacian

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

layout_randomly

Randomly place vertices on a plane or in 3d space

The Davidson-Harel layout algorithm

Convert object to a graph

Order (number of vertices) of a graph

layout.reingold.tilford

Deprecated layout functions

Hierarchical random graphs

Get the id of a graph

graph_from_literal

Creating (small) graphs via a simple interface

Set all or some graph attributes

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

intersection.igraph

Intersection of graphs

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

intersection.igraph.es

Intersection of edge sequences

Run igraph demos, step by step

layout_with_mds

Graph layout by multidimensional scaling

Create a hierarchical random graph from an igraph graph

isomorphism_class

Isomorphism class of a graph

Calculate all isomorphic mappings between the vertices of two graphs

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

Simple grid layout

layout_on_sphere

Graph layout with vertices on the surface of a sphere

layout_with_sugiyama

The Sugiyama graph layout generator

Creates a communities object.

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

Create tree graphs

make_de_bruijn_graph

De Bruijn graphs

Minimum size vertex separators

Helper function to add or delete edges along a path

intersection.igraph.vs

Intersection of vertex sequences

min_st_separators

Minimum size vertex separators

Permute the vertices of a graph

plot_dendrogram

Community structure dendrogram plots

Parameters for the igraph package

Chordality of a graph

Is this object an igraph graph?

sample_correlated_gnp

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

print.igraphHRG

Print a hierarchical random graph model to the screen

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

sample_correlated_gnp_pair

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

plot_dendrogram.igraphHRG

HRG dendrogram plot

is_min_separator

Minimal vertex separators

Vertex separators

Decide whether a graph is a tree.

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Geometric random graphs

make_full_bipartite_graph

Create a full bipartite graph

make_full_citation_graph

Create a complete (full) citation graph

Run package tests

layout_with_drl

The DrL graph layout generator

layout_in_circle

Graph layout with vertices on a circle.

Graph rewiring while preserving the degree distribution

Independent vertex sets

Query igraph's version string

The Reingold-Tilford graph layout algorithm

make_chordal_ring

Create an extended chordal ring graph

The Fruchterman-Reingold layout algorithm

Create a bipartite graph

layout_as_bipartite

Simple two-row layout for bipartite graphs

Growing random graph generation

Sample from a hierarchical random graph model

Spectral Coarse Graining

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Choose an appropriate graph layout algorithm automatically

modularity.igraph

Modularity of a community structure of a graph

layout_with_gem

The GEM layout algorithm

Maximum flow in a graph

max_cardinality

Maximum cardinality search

Normalize layout

Predict edges based on a hierarchical random graph model

The Page Rank algorithm

is_printer_callback

Is this a printer callback?

SVD layout, this was removed from igraph

Decide if two graphs are isomorphic

Spring layout, this was removed from igraph

Weighted graphs

The Kamada-Kawai layout algorithm

make_kautz_graph

Create a lattice graph

Magrittr's pipes

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

Error of the spectral coarse graining (SCG) approximation

layout_with_lgl

Large Graph Layout

make_empty_graph

A graph with no edges

Print graphs to the terminal

Rewiring edges of a graph

Random walk on a graph

Reverse the order in a vertex sequence

Reading foreign file formats

make_from_prufer

Create an undirected tree graph from its Prufer sequence

Interactive plotting of graphs

stochastic_matrix

Stochastic matrix of a graph

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

SCG Problem Solver

Convert a tree graph to its Prufer sequence

Create a ring graph

Compute local scan statistics on graphs

make_line_graph

Line graph of a graph

layout_with_graphopt

The graphopt layout algorithm

Make a new graph

printer_callback

Create a printer callback function

Better printing of R packages

Replicate a graph multiple times

sample_dot_product

Generate random graphs according to the random dot product graph model

union.igraph.vs

Union of vertex sequences

union.igraph.es

Union of edge sequences

Random graphs from vertex fitness scores

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

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

make_full_graph

Create a full graph

Add vertices, edges or another graph to a graph

Creating a graph from a given degree sequence, deterministically

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Reverse the order in an edge sequence

Merging graph layouts

Find the multiple or loop edges in a graph

Match Graphs given a seeding of vertex correspondences

Find mutual edges in a directed graph

Writing the graph to a file in some format

without_multiples

Constructor modifier to drop multiple edges

Normalize coordinates for plotting graphs

print.igraph.es

Print an edge sequence to the screen

Radius of a graph

print.nexusDatasetInfo

Query and download from the Nexus network repository

The default R palette

print.igraph.vs

Show a vertex sequence on the screen

sample_traits_callaway

Graph generation based on different vertex types

Semi-Projectors

sample_last_cit

Random citation graphs

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

Set edge attributes

Set a graph attribute

Minimum cut in a graph

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

Sequential palette

Sample stochastic block model

Trait-based random generation

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

Eigenvalues and eigenvectors of the adjacency matrix of a graph

split_join_distance

Split-join distance of two community structures

Minimum spanning tree

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Sample trees randomly and uniformly

Sample from a random graph model

Plotting of graphs

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Neighboring (adjacent) vertices in a graph

sample_forestfire

Forest Fire Network Model

Topological sorting of vertices in a graph

Plotting the results on multiple SIR model runs

sample_bipartite

Bipartite random graphs

Reciprocity of graphs

3D plotting of graphs with OpenGL

Running mean of a time series

igraph data structure versions

Transitivity of a graph

Helper function for adding and deleting vertices

Generate random graphs with a given degree sequence

Constructor modifier to add edge attributes

weighted_cliques

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

vertex_connectivity

Vertex connectivity.

Constructor modifier to add graph attributes

Tails of the edge(s) in a graph

Construtor modifier to remove all attributes from a graph

Scan statistics on a time series of graphs

Constructor modifier to drop loop edges

SIR model on graphs

A graph with subgraphs that are each a random graph.

sample_k_regular

Create a random regular graph

Sampling a random integer sequence

sample_smallworld

The Watts-Strogatz small-world model

set_vertex_attr

Set vertex attributes

Various vertex shapes when plotting igraph graphs

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

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

Union of two or more sets

Experimental basic igraph GUI

Query and manipulate a graph as it were an adjacency list

sample_spanning_tree

Samples from the spanning trees of a graph randomly and uniformly

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

sample_dirichlet

Sample from a Dirichlet distribution

Union of graphs

Generate an evolving random graph with preferential attachment and aging

unique.igraph.es

Remove duplicate edges from an edge sequence

Query vertex attributes of a graph

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

In- or out- component of a vertex

Constructor modifier to drop multiple and loop edges

Similarity measures of two vertices

Strength or weighted vertex degree

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Constructor modifier to add vertex attributes

Query and manipulate a graph as it were an adjacency matrix

with_igraph_opt

Run code with a temporary igraph options setting

vertex_attr_names

List names of vertex attributes

subgraph_centrality

Find subgraph centrality scores of network positions

Set one or more vertex attributes

Subgraph of a graph

Triad census, subgraphs with three vertices

Pie charts as vertices

Using pie charts as vertices in graph plots

Convert a general graph into a forest

The igraph package