Learn R Programming

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

igraph (version 1.2.11)

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

473,412

Version

1.2.11

License

GPL (>= 2)

Maintainer

Tam<c3><a1>s Nepusz

Last Published

January 4th, 2022

Functions in igraph (1.2.11)

The igraph package

Are two vertices adjacent?

Add layout to graph

Add vertices to a graph

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

Edges of a graph

Add edges to a graph

all_simple_paths

List all simple paths from one source

Vertices of a graph

alpha_centrality

Find Bonacich alpha centrality scores of network positions

arpack_defaults

ARPACK eigenvector calculation

Conversion to igraph

biconnected_components

Biconnected components

Breadth-first search

Convert between directed and undirected graphs

bipartite_mapping

Decide whether a graph is bipartite

centr_betw_tmax

Theoretical maximum for betweenness centralization

Centralize a graph according to the betweenness of vertices

bipartite_projection

Project a bipartite graph

Convert a vertex or edge sequence to an ordinary vector

Assortativity coefficient

as_incidence_matrix

Incidence matrix of a bipartite graph

articulation_points

Articulation points of a graph

authority_score

Kleinberg's authority centrality scores.

Theoretical maximum for closeness centralization

cluster_label_prop

Finding communities based on propagating labels

Centralize a graph according to the closeness of vertices

Concatenate edge sequences

cluster_infomap

Infomap community finding

cluster_louvain

Finding community structure by multi-level optimization of modularity

cluster_optimal

Optimal community structure

Convert igraph graphs to graphNEL objects from the graph package

Convert a graph to an edge list

Cocitation coupling

count_isomorphisms

Count the number of isomorphic mappings between two graphs

Adjacency lists

cohesive_blocks

Calculate Cohesive Blocks

Centralize a graph according to the eigenvector centrality of vertices

categorical_pal

Palette for categories

estimate_betweenness

Vertex and edge betweenness centrality

Number of automorphisms

canonical_permutation

Canonical permutation of a graph

Concatenate vertex sequences

cluster_fast_greedy

Community structure via greedy optimization of modularity

as_adjacency_matrix

Convert a graph to an adjacency matrix

Centralization of a graph

cluster_fluid_communities

Community detection algorithm based on interacting fluids

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

Burt's constraint

Create a consensus tree from several hierarchical random graph models

Contract several vertices into a single one

cluster_spinglass

Finding communities in graphs based on statistical meachanics

cluster_walktrap

Community strucure via short random walks

Delete edges from a graph

delete_graph_attr

Delete a graph attribute

Depth-first search

The igraph console

as_long_data_frame

Convert a graph to a long data frame

Declare a numeric vector as a membership vector

Diameter of a graph

cluster_leading_eigen

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

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Shortest (directed or undirected) paths between vertices

Optimal edge curvature when plotting graphs

Complementer of a graph

Centralize a graph according to the degrees of vertices

Query edge attributes of a graph

Set one or more edge attributes

delete_vertex_attr

Delete a vertex attribute

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

delete_vertices

Delete vertices from a graph

Graph diversity

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Incident vertices of some graph edges

Component-wise layout

Dimensionality selection for singular values using profile likelihood.

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Decompose a graph into components

Disjoint union of graphs

graph_from_adj_list

Create graphs from adjacency lists

graph_from_adjacency_matrix

Create graphs from adjacency matrices

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

Convert object to a graph

Set all or some graph attributes

Hierarchical random graphs

Print the only the head of an R object

Creating a graph from LCF notation

graph_from_isomorphism_class

Create a graph from an isomorphism class

igraph-es-indexing2

Select edges and show their metadata

graph_from_atlas

Create a graph from the Graph Atlas

edge_attr_names

List names of edge attributes

edge_connectivity

Edge connectivity.

Creating igraph graphs from data frames or vice-versa

graph_from_edgelist

Create a graph from an edge list matrix

count_triangles

Find triangles in graphs

count_subgraph_isomorphisms

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

centr_degree_tmax

Theoretical maximum for degree centralization

Delete vertices or edges from a graph

Incident edges of a vertex in a graph

Query igraph's version string

Convex hull of a set of vertices

Closeness centrality of vertices

K-core decomposition of graphs

Chordality of a graph

graph_from_graphdb

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

handle_vertex_type_arg

Common handler for vertex type arguments in igraph functions

Difference of two sets

Maximum flow in a graph

difference.igraph

Difference of graphs

Diverging palette

Igraph data structure versions

Directed acyclic graphs

Weighted graphs

Fitting a power-law distribution function to discrete data

Graphlet decomposition of a graph

difference.igraph.es

Difference of edge sequences

Neighborhood of graph vertices

cluster_edge_betweenness

Community structure detection based on edge betweenness

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

Head of the edge(s) in a graph

difference.igraph.vs

Difference of vertex sequences

identical_graphs

Decide if two graphs are identical

Run package tests

igraph-es-indexing

Indexing edge sequences

Average nearest neighbor degree

Parameters for the igraph package

Dyad census of a graph

igraph-vs-indexing

Indexing vertex sequences

Intersection of two or more sets

Groups of a vertex partitioning

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

graph_from_literal

Creating (small) graphs via a simple interface

intersection.igraph

Intersection of graphs

Functions to deal with the result of network community detection

intersection.igraph.es

Intersection of edge sequences

Graph attributes of a graph

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

Create tree graphs

Compares community structures using various metrics

Get the id of a graph

intersection.igraph.vs

Intersection of vertex sequences

Calculate all isomorphic mappings between the vertices of two graphs

isomorphism_class

Isomorphism class of a graph

component_distribution

Connected components of a graph

is_min_separator

Minimal vertex separators

laplacian_matrix

Graph Laplacian

Compose two graphs as binary relations

layout_with_drl

The DrL graph layout generator

layout_as_bipartite

Simple two-row layout for bipartite graphs

The size of the graph (number of edges)

Run igraph demos, step by step

The Kamada-Kawai layout algorithm

print.igraph.vs

Show a vertex sequence on the screen

Kleinberg's hub centrality scores.

graph_attr_names

List names of graph attributes

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

The Fruchterman-Reingold layout algorithm

layout_with_lgl

Large Graph Layout

igraph-vs-indexing2

Select vertices and show their metadata

graph_from_incidence_matrix

Create graphs from an incidence matrix

Create a bipartite graph

Degree and degree distribution of the vertices

delete_edge_attr

Delete an edge attribute

Helper function for adding and deleting edges

Eccentricity of the vertices in a graph

Fit a hierarchical random graph model

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Order (number of vertices) of a graph

make_chordal_ring

Create an extended chordal ring graph

Create a hierarchical random graph from an igraph graph

Girth of a graph

Neighboring (adjacent) vertices in a graph

make_empty_graph

A graph with no edges

make_full_bipartite_graph

Create a full bipartite graph

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

layout_in_circle

Graph layout with vertices on a circle.

Create an igraph graph from a hierarchical random graph model

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

Choose an appropriate graph layout algorithm automatically

Minimum cut in a graph

print.nexusDatasetInfo

Query and download from the Nexus network repository

make_kautz_graph

Print graphs to the terminal

Getting and setting graph attributes, shortcut

Simple grid layout

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

make_full_citation_graph

Create a complete (full) citation graph

Compute local scan statistics on graphs

Make a new graph

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

layout_on_sphere

Graph layout with vertices on the surface of a sphere

print.igraph.es

Print an edge sequence to the screen

make_full_graph

Create a full graph

Minimum size vertex separators

Sample from a random graph model

sample_bipartite

Bipartite random graphs

Incident edges of multiple vertices in a graph

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

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

Normalize layout

Check whether a graph is directed

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

Normalize coordinates for plotting graphs

Minimum spanning tree

Merging graph layouts

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

Vertex separators

is_printer_callback

Is this a printer callback?

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Replicate a graph multiple times

Reverse the order in an edge sequence

Predict edges based on a hierarchical random graph model

Permute the vertices of a graph

layout.reingold.tilford

Deprecated layout functions

Rewiring edges of a graph

sample_dot_product

Generate random graphs according to the random dot product graph model

Reverse the order in a vertex sequence

Semi-Projectors

Generate an evolving random graph with preferential attachment and aging

Plotting of graphs

Sequential palette

Indent a printout

Is a degree sequence graphical?

Decide if two graphs are isomorphic

Radius of a graph

plot_dendrogram

Community structure dendrogram plots

Plotting the results on multiple SIR model runs

Random walk on a graph

3D plotting of graphs with OpenGL

The Reingold-Tilford graph layout algorithm

Running mean of a time series

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Match Graphs given a seeding of vertex correspondences

Random graphs from vertex fitness scores

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

printer_callback

Create a printer callback function

Magrittr's pipes

sample_traits_callaway

Graph generation based on different vertex types

print.igraphHRG

Print a hierarchical random graph model to the screen

sample_dirichlet

Sample from a Dirichlet distribution

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

Subgraph of a graph

Trait-based random generation

Sample stochastic block model

Generate random graphs with a given degree sequence

split_join_distance

Split-join distance of two community structures

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

Scan statistics on a time series of graphs

A graph with subgraphs that are each a random graph.

sample_k_regular

Create a random regular graph

Is this object an igraph graph?

layout_with_gem

The GEM layout algorithm

layout_with_graphopt

The graphopt layout algorithm

Create a ring graph

SVD layout, this was removed from igraph

Spring layout, this was removed from igraph

layout_with_mds

Graph layout by multidimensional scaling

layout_with_sugiyama

The Sugiyama graph layout generator

Independent vertex sets

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

Spectral Coarse Graining

Graph rewiring while preserving the degree distribution

Sample from a hierarchical random graph model

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

layout_randomly

Randomly place vertices on a plane or in 3d space

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

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Interactive plotting of graphs

subgraph_centrality

Find subgraph centrality scores of network positions

SIR model on graphs

The Davidson-Harel layout algorithm

make_de_bruijn_graph

De Bruijn graphs

Creates a communities object.

Igraph data structure versions

Tails of the edge(s) in a graph

Helper function for adding and deleting vertices

stochastic_matrix

Stochastic matrix of a graph

set_vertex_attr

Set vertex attributes

Experimental basic igraph GUI

Pie charts as vertices

Using pie charts as vertices in graph plots

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

Constructor modifier to drop multiple and loop edges

Various vertex shapes when plotting igraph graphs

Similarity measures of two vertices

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

Construtor modifier to remove all attributes from a graph

Create a lattice graph

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

Set one or more vertex attributes

Query vertex attributes of a graph

make_line_graph

Line graph of a graph

Constructor modifier to add vertex attributes

with_igraph_opt

Run code with a temporary igraph options setting

Query and manipulate a graph as it were an adjacency list

In- or out- component of a vertex

Topological sorting of vertices in a graph

Transitivity of a graph

Constructor modifier to drop loop edges

Sampling a random integer sequence

Better printing of R packages

Error of the spectral coarse graining (SCG) approximation

The default R palette

Growing random graph generation

Geometric random graphs

max_cardinality

Maximum cardinality search

min_st_separators

Minimum size vertex separators

sample_smallworld

The Watts-Strogatz small-world model

SCG Problem Solver

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.vs

Union of vertex sequences

modularity.igraph

Modularity of a community structure of a graph

Triad census, subgraphs with three vertices

unique.igraph.es

Remove duplicate edges from an edge sequence

without_multiples

Constructor modifier to drop multiple edges

vertex_attr_names

List names of vertex attributes

vertex_connectivity

Vertex connectivity.

The Page Rank algorithm

Constructor modifier to add edge attributes

Constructor modifier to add graph attributes

Writing the graph to a file in some format

plot_dendrogram.igraphHRG

HRG dendrogram plot

Helper function to add or delete edges along a path

sample_correlated_gnp

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

Add vertices, edges or another graph to a graph

Reciprocity of graphs

Set edge attributes

sample_correlated_gnp_pair

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

Reading foreign file formats

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

sample_forestfire

Forest Fire Network Model

sample_last_cit

Random citation graphs

Set a graph attribute

Strength or weighted vertex degree

Query and manipulate a graph as it were an adjacency matrix

Convert a general graph into a forest

Union of graphs

Union of two or more sets

union.igraph.es

Union of edge sequences

Find mutual edges in a directed graph

Find the multiple or loop edges in a graph