Learn R Programming

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

igraph (version 1.2.9)

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

733,150

Version

1.2.9

License

GPL (>= 2)

Maintainer

Tam<c3><a1>s Nepusz

Last Published

November 23rd, 2021

Functions in igraph (1.2.9)

Add vertices to a graph

Vertices of a graph

The igraph package

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Add layout to graph

Edges of a graph

Are two vertices adjacent?

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

Add edges to a graph

all_simple_paths

List all simple paths from one source

Convert a graph to an edge list

as_incidence_matrix

Incidence matrix of a bipartite graph

Convert a vertex or edge sequence to an ordinary vector

Number of automorphisms

bipartite_mapping

Decide whether a graph is bipartite

Convert between directed and undirected graphs

Conversion to igraph

bipartite_projection

Project a bipartite graph

estimate_betweenness

Vertex and edge betweenness centrality

authority_score

Kleinberg's authority centrality scores.

Assortativity coefficient

Centralize a graph according to the betweenness of vertices

centr_betw_tmax

Theoretical maximum for betweenness centralization

articulation_points

Articulation points of a graph

as_long_data_frame

Convert a graph to a long data frame

arpack_defaults

ARPACK eigenvector calculation

Concatenate vertex sequences

Concatenate edge sequences

cluster_infomap

Infomap community finding

cluster_label_prop

Finding communities based on propagating labels

Centralize a graph according to the closeness of vertices

Theoretical maximum for closeness centralization

Convert igraph graphs to graphNEL objects from the graph package

Centralize a graph according to the degrees of vertices

Adjacency lists

cluster_fast_greedy

Community structure via greedy optimization of modularity

centr_degree_tmax

Theoretical maximum for degree centralization

cluster_fluid_communities

Community detection algorithm based on interacting fluids

cluster_walktrap

Community strucure via short random walks

cluster_spinglass

Finding communities in graphs based on statistical meachanics

biconnected_components

Biconnected components

as_adjacency_matrix

Convert a graph to an adjacency matrix

Breadth-first search

canonical_permutation

Canonical permutation of a graph

Centralization of a graph

Declare a numeric vector as a membership vector

categorical_pal

Palette for categories

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Centralize a graph according to the eigenvector centrality of vertices

Cocitation coupling

Convex hull of a set of vertices

cluster_louvain

Finding community structure by multi-level optimization of modularity

cluster_optimal

Optimal community structure

Burt's constraint

Difference of two sets

K-core decomposition of graphs

Closeness centrality of vertices

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

Compose two graphs as binary relations

cluster_edge_betweenness

Community structure detection based on edge betweenness

cluster_leading_eigen

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

component_distribution

Connected components of a graph

Functions to deal with the result of network community detection

Compares community structures using various metrics

Complementer of a graph

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

Create a consensus tree from several hierarchical random graph models

Component-wise layout

count_triangles

Find triangles in graphs

count_subgraph_isomorphisms

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

Dimensionality selection for singular values using profile likelihood.

Contract several vertices into a single one

Optimal edge curvature when plotting graphs

Shortest (directed or undirected) paths between vertices

Diverging palette

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

Decompose a graph into components

cohesive_blocks

Calculate Cohesive Blocks

count_isomorphisms

Count the number of isomorphic mappings between two graphs

Disjoint union of graphs

Graph diversity

Girth of a graph

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Order (number of vertices) of a graph

Get the id of a graph

graph_from_literal

Creating (small) graphs via a simple interface

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

graph_from_adj_list

Create graphs from adjacency lists

Degree and degree distribution of the vertices

Query igraph's version string

difference.igraph

Difference of graphs

The igraph console

graph_from_adjacency_matrix

Create graphs from adjacency matrices

graph_from_incidence_matrix

Create graphs from an incidence matrix

delete_vertex_attr

Delete a vertex attribute

Dyad census of a graph

delete_edge_attr

Delete an edge attribute

delete_vertices

Delete vertices from a graph

Igraph data structure versions

difference.igraph.vs

Difference of vertex sequences

difference.igraph.es

Difference of edge sequences

Incident vertices of some graph edges

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Incident edges of a vertex in a graph

Convert object to a graph

Set one or more edge attributes

intersection.igraph.es

Intersection of edge sequences

intersection.igraph.vs

Intersection of vertex sequences

Graphlet decomposition of a graph

Groups of a vertex partitioning

Fitting a power-law distribution function to discrete data

The size of the graph (number of edges)

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

delete_graph_attr

Delete a graph attribute

Delete edges from a graph

Depth-first search

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

Neighborhood of graph vertices

Kleinberg's hub centrality scores.

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Getting and setting graph attributes, shortcut

edge_attr_names

List names of edge attributes

Eccentricity of the vertices in a graph

Helper function for adding and deleting edges

Diameter of a graph

Parameters for the igraph package

identical_graphs

Decide if two graphs are identical

igraph-vs-indexing2

Select vertices and show their metadata

edge_connectivity

Edge connectivity.

Graph attributes of a graph

The Reingold-Tilford graph layout algorithm

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

SVD layout, this was removed from igraph

Calculate all isomorphic mappings between the vertices of two graphs

isomorphism_class

Isomorphism class of a graph

is_min_separator

Minimal vertex separators

Spring layout, this was removed from igraph

Run igraph demos, step by step

Simple grid layout

Set all or some graph attributes

layout_with_lgl

Large Graph Layout

The Kamada-Kawai layout algorithm

graph_attr_names

List names of graph attributes

graph_from_isomorphism_class

Create a graph from an isomorphism class

Creating a graph from LCF notation

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

Creates a communities object.

Create a ring graph

make_de_bruijn_graph

De Bruijn graphs

layout_on_sphere

Graph layout with vertices on the surface of a sphere

Minimum cut in a graph

handle_vertex_type_arg

Common handler for vertex type arguments in igraph functions

Head of the edge(s) in a graph

Permute the vertices of a graph

Minimum size vertex separators

Magrittr's pipes

The default R palette

Better printing of R packages

igraph-es-indexing2

Select edges and show their metadata

intersection.igraph

Intersection of graphs

Intersection of two or more sets

Delete vertices or edges from a graph

Directed acyclic graphs

Chordality of a graph

Graph rewiring while preserving the degree distribution

Run package tests

Independent vertex sets

Check whether a graph is directed

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

Maximum flow in a graph

The Page Rank algorithm

Query edge attributes of a graph

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Merging graph layouts

Sample from a hierarchical random graph model

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

print.igraph.es

Print an edge sequence to the screen

Helper function to add or delete edges along a path

Print graphs to the terminal

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

printer_callback

Create a printer callback function

Average nearest neighbor degree

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

Create a bipartite graph

layout.reingold.tilford

Deprecated layout functions

Fit a hierarchical random graph model

make_full_citation_graph

Create a complete (full) citation graph

make_chordal_ring

Create an extended chordal ring graph

graph_from_atlas

Create a graph from the Graph Atlas

Creating igraph graphs from data frames or vice-versa

3D plotting of graphs with OpenGL

Running mean of a time series

Geometric random graphs

Growing random graph generation

Create an igraph graph from a hierarchical random graph model

Create a hierarchical random graph from an igraph graph

sample_traits_callaway

Graph generation based on different vertex types

Constructor modifier to drop multiple and loop edges

Scan statistics on a time series of graphs

Similarity measures of two vertices

Spectral Coarse Graining

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

Generate an evolving random graph with preferential attachment and aging

graph_from_edgelist

Create a graph from an edge list matrix

Print the only the head of an R object

graph_from_graphdb

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

Subgraph of a graph

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

Hierarchical random graphs

make_full_graph

Create a full graph

Minimum spanning tree

Strength or weighted vertex degree

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

make_empty_graph

A graph with no edges

The Davidson-Harel layout algorithm

layout_randomly

Randomly place vertices on a plane or in 3d space

laplacian_matrix

Graph Laplacian

make_full_bipartite_graph

Create a full bipartite graph

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

igraph-es-indexing

Indexing edge sequences

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Plotting of graphs

Query and manipulate a graph as it were an adjacency matrix

Predict edges based on a hierarchical random graph model

Reverse the order in a vertex sequence

Is this object an igraph graph?

is_printer_callback

Is this a printer callback?

Is a degree sequence graphical?

Rewiring edges of a graph

sample_last_cit

Random citation graphs

Union of two or more sets

Convert a general graph into a forest

subgraph_centrality

Find subgraph centrality scores of network positions

Union of graphs

Helper function for adding and deleting vertices

Indent a printout

Eigenvalues and eigenvectors of the adjacency matrix of a graph

union.igraph.es

Union of edge sequences

Constructor modifier to add edge attributes

Incident edges of multiple vertices in a graph

Constructor modifier to add graph attributes

Weighted graphs

split_join_distance

Split-join distance of two community structures

Pie charts as vertices

Using pie charts as vertices in graph plots

Vertex separators

Match Graphs given a seeding of vertex correspondences

Create tree graphs

Tails of the edge(s) in a graph

Experimental basic igraph GUI

layout_in_circle

Graph layout with vertices on a circle.

Decide if two graphs are isomorphic

layout_with_drl

The DrL graph layout generator

Choose an appropriate graph layout algorithm automatically

Constructor modifier to drop loop edges

Construtor modifier to remove all attributes from a graph

min_st_separators

Minimum size vertex separators

modularity.igraph

Modularity of a community structure of a graph

layout_with_mds

Graph layout by multidimensional scaling

The Fruchterman-Reingold layout algorithm

print.igraph.vs

Show a vertex sequence on the screen

layout_with_sugiyama

The Sugiyama graph layout generator

sample_correlated_gnp

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

Reciprocity of graphs

print.igraphHRG

Print a hierarchical random graph model to the screen

Reading foreign file formats

layout_with_graphopt

The graphopt layout algorithm

layout_with_gem

The GEM layout algorithm

sample_correlated_gnp_pair

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

layout_as_bipartite

Simple two-row layout for bipartite graphs

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Compute local scan statistics on graphs

Make a new graph

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

A graph with subgraphs that are each a random graph.

Create a lattice graph

sample_forestfire

Forest Fire Network Model

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

sample_k_regular

Create a random regular graph

make_line_graph

Line graph of a graph

plot_dendrogram.igraphHRG

HRG dendrogram plot

Neighboring (adjacent) vertices in a graph

Add vertices, edges or another graph to a graph

print.nexusDatasetInfo

Query and download from the Nexus network repository

make_kautz_graph

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Query and manipulate a graph as it were an adjacency list

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

In- or out- component of a vertex

Set one or more vertex attributes

Query vertex attributes of a graph

SIR model on graphs

max_cardinality

Maximum cardinality search

Radius of a graph

Normalize coordinates for plotting graphs

Normalize layout

Sample from a random graph model

Random walk on a graph

sample_dot_product

Generate random graphs according to the random dot product graph model

sample_bipartite

Bipartite random graphs

without_multiples

Constructor modifier to drop multiple edges

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

Writing the graph to a file in some format

Replicate a graph multiple times

Reverse the order in an edge sequence

plot_dendrogram

Community structure dendrogram plots

Plotting the results on multiple SIR model runs

Generate random graphs with a given degree sequence

Error of the spectral coarse graining (SCG) approximation

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

sample_dirichlet

Sample from a Dirichlet distribution

Sampling a random integer sequence

sample_smallworld

The Watts-Strogatz small-world model

Random graphs from vertex fitness scores

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

Trait-based random generation

Sample stochastic block model

Sequential palette

Set a graph attribute

Set edge attributes

Semi-Projectors

set_vertex_attr

Set vertex attributes

SCG Problem Solver

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

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

stochastic_matrix

Stochastic matrix of a graph

Triad census, subgraphs with three vertices

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Transitivity of a graph

vertex_attr_names

List names of vertex attributes

Igraph data structure versions

vertex_connectivity

Vertex connectivity.

Interactive plotting of graphs

Topological sorting of vertices in a graph

union.igraph.vs

Union of vertex sequences

with_igraph_opt

Run code with a temporary igraph options setting

unique.igraph.es

Remove duplicate edges from an edge sequence

Constructor modifier to add vertex attributes