Learn R Programming

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

igraph (version 1.2.10)

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

License

GPL (>= 2)

Maintainer

Tam<c3><a1>s Nepusz

Last Published

December 15th, 2021

Functions in igraph (1.2.10)

The igraph package

Are two vertices adjacent?

Edges of a graph

alpha_centrality

Find Bonacich alpha centrality scores of network positions

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

Add layout to graph

Add edges to a graph

Vertices of a graph

Convert between directed and undirected graphs

Conversion to igraph

Convert a vertex or edge sequence to an ordinary vector

Number of automorphisms

estimate_betweenness

Vertex and edge betweenness centrality

as_incidence_matrix

Incidence matrix of a bipartite graph

Convert igraph graphs to graphNEL objects from the graph package

biconnected_components

Biconnected components

as_adjacency_matrix

Convert a graph to an adjacency matrix

Breadth-first search

all_simple_paths

List all simple paths from one source

Convert a graph to an edge list

Adjacency lists

Concatenate edge sequences

bipartite_projection

Project a bipartite graph

Add vertices to a graph

bipartite_mapping

Decide whether a graph is bipartite

canonical_permutation

Canonical permutation of a graph

categorical_pal

Palette for categories

cluster_infomap

Infomap community finding

authority_score

Kleinberg's authority centrality scores.

Centralization of a graph

Assortativity coefficient

articulation_points

Articulation points of a graph

cluster_label_prop

Finding communities based on propagating labels

arpack_defaults

ARPACK eigenvector calculation

Centralize a graph according to the betweenness of vertices

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

Cocitation coupling

cohesive_blocks

Calculate Cohesive Blocks

centr_betw_tmax

Theoretical maximum for betweenness centralization

The igraph console

Create a consensus tree from several hierarchical random graph models

cluster_walktrap

Community strucure via short random walks

cluster_spinglass

Finding communities in graphs based on statistical meachanics

Concatenate vertex sequences

Declare a numeric vector as a membership vector

as_long_data_frame

Convert a graph to a long data frame

Centralize a graph according to the degrees of vertices

Delete edges from a graph

Centralize a graph according to the eigenvector centrality of vertices

cluster_louvain

Finding community structure by multi-level optimization of modularity

Optimal edge curvature when plotting graphs

Burt's constraint

cluster_optimal

Optimal community structure

Centralize a graph according to the closeness of vertices

Convex hull of a set of vertices

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Set one or more edge attributes

Contract several vertices into a single one

K-core decomposition of graphs

count_isomorphisms

Count the number of isomorphic mappings between two graphs

Dimensionality selection for singular values using profile likelihood.

delete_graph_attr

Delete a graph attribute

Dyad census of a graph

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

Disjoint union of graphs

Query edge attributes of a graph

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

cluster_edge_betweenness

Community structure detection based on edge betweenness

Theoretical maximum for closeness centralization

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.

Depth-first search

Closeness centrality of vertices

edge_attr_names

List names of edge attributes

Graph diversity

Diameter of a graph

centr_degree_tmax

Theoretical maximum for degree centralization

edge_connectivity

Edge connectivity.

Graph attributes of a 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

delete_vertex_attr

Delete a vertex attribute

Igraph data structure versions

graph_from_isomorphism_class

Create a graph from an isomorphism class

Difference of two sets

Decompose a graph into components

Creating a graph from LCF notation

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

delete_vertices

Delete vertices from a graph

difference.igraph

Difference of graphs

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Fit a hierarchical random graph model

cluster_fluid_communities

Community detection algorithm based on interacting fluids

Compares community structures using various metrics

cluster_fast_greedy

Community structure via greedy optimization of modularity

Functions to deal with the result of network community detection

Diverging palette

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Shortest (directed or undirected) paths between vertices

Eccentricity of the vertices in a graph

graph_from_literal

Creating (small) graphs via a simple interface

graph_attr_names

List names of graph attributes

Convert object to a graph

Graphlet decomposition of a graph

Helper function for adding and deleting edges

graph_from_adj_list

Create graphs from adjacency lists

graph_from_adjacency_matrix

Create graphs from adjacency matrices

Order (number of vertices) of a graph

Incident vertices of some graph edges

handle_vertex_type_arg

Common handler for vertex type arguments in igraph functions

Girth of a graph

Head of the edge(s) in a graph

Kleinberg's hub centrality scores.

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Set all or some graph attributes

igraph-es-indexing2

Select edges and show their metadata

graph_from_atlas

Create a graph from the Graph Atlas

Creating igraph graphs from data frames or vice-versa

Delete vertices or edges from a graph

Intersection of two or more sets

intersection.igraph

Intersection of graphs

The size of the graph (number of edges)

Get the id of a graph

Groups of a vertex partitioning

is_min_separator

Minimal vertex separators

Parameters for the igraph package

Component-wise layout

graph_from_incidence_matrix

Create graphs from an incidence matrix

Run package tests

Complementer of a graph

Degree and degree distribution of the vertices

identical_graphs

Decide if two graphs are identical

difference.igraph.es

Difference of edge sequences

delete_edge_attr

Delete an edge attribute

difference.igraph.vs

Difference of vertex sequences

igraph-es-indexing

Indexing edge sequences

Query igraph's version string

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

Print the only the head of an R object

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

Is a degree sequence graphical?

Is this object an igraph graph?

The Reingold-Tilford graph layout algorithm

Weighted graphs

Decide if two graphs are isomorphic

intersection.igraph.vs

Intersection of vertex sequences

Graph rewiring while preserving the degree distribution

intersection.igraph.es

Intersection of edge sequences

layout_randomly

Randomly place vertices on a plane or in 3d space

Independent vertex sets

Neighborhood of graph vertices

layout_with_drl

The DrL graph layout generator

Fitting a power-law distribution function to discrete data

make_full_citation_graph

Create a complete (full) citation graph

The Fruchterman-Reingold layout algorithm

The Davidson-Harel layout algorithm

make_chordal_ring

Create an extended chordal ring graph

min_st_separators

Minimum size vertex separators

modularity.igraph

Modularity of a community structure of a graph

Create a bipartite graph

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

make_empty_graph

A graph with no edges

Simple grid layout

graph_from_edgelist

Create a graph from an edge list matrix

layout_as_bipartite

Simple two-row layout for bipartite graphs

layout_on_sphere

Graph layout with vertices on the surface of a sphere

Create a hierarchical random graph from an igraph graph

Neighboring (adjacent) vertices in a graph

print.nexusDatasetInfo

Query and download from the Nexus network repository

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

graph_from_graphdb

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

Create an igraph graph from a hierarchical random graph model

Predict edges based on a hierarchical random graph model

Replicate a graph multiple times

make_full_graph

Create a full graph

Reverse the order in an edge sequence

Incident edges of a vertex in a graph

Indent a printout

Getting and setting graph attributes, shortcut

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Incident edges of multiple vertices in a graph

isomorphism_class

Isomorphism class of a graph

Calculate all isomorphic mappings between the vertices of two graphs

SVD layout, this was removed from igraph

Spring layout, this was removed from igraph

make_full_bipartite_graph

Create a full bipartite graph

Minimum spanning tree

layout_with_gem

The GEM layout algorithm

Normalize layout

Plotting the results on multiple SIR model runs

Normalize coordinates for plotting graphs

Hierarchical random graphs

layout_with_mds

Graph layout by multidimensional scaling

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

make_kautz_graph

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

layout_with_graphopt

The graphopt layout algorithm

layout_with_sugiyama

The Sugiyama graph layout generator

Create tree graphs

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

sample_last_cit

Random citation graphs

Match Graphs given a seeding of vertex correspondences

Maximum flow in a graph

Chordality of a graph

Minimum cut in a graph

The Page Rank algorithm

Helper function to add or delete edges along a path

Minimum size vertex separators

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

printer_callback

Create a printer callback function

plot_dendrogram

Community structure dendrogram plots

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

igraph-vs-indexing2

Select vertices and show their metadata

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

Run igraph demos, step by step

Check whether a graph is directed

Add vertices, edges or another graph to a graph

plot_dendrogram.igraphHRG

HRG dendrogram plot

Reverse the order in a vertex sequence

Vertex separators

is_printer_callback

Is this a printer callback?

Directed acyclic graphs

layout_in_circle

Graph layout with vertices on a circle.

Merging graph layouts

Reading foreign file formats

Rewiring edges of a graph

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Choose an appropriate graph layout algorithm automatically

sample_forestfire

Forest Fire Network Model

The Kamada-Kawai layout algorithm

Error of the spectral coarse graining (SCG) approximation

Creates a communities object.

Create a ring graph

make_de_bruijn_graph

De Bruijn graphs

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

layout_with_lgl

Large Graph Layout

Sample from a random graph model

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

Average nearest neighbor degree

layout.reingold.tilford

Deprecated layout functions

Plotting of graphs

laplacian_matrix

Graph Laplacian

Semi-Projectors

Generate an evolving random graph with preferential attachment and aging

Reciprocity of graphs

SCG Problem Solver

Similarity measures of two vertices

3D plotting of graphs with OpenGL

Sequential palette

Running mean of a time series

Set edge attributes

Compute local scan statistics on graphs

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

Print graphs to the terminal

Better printing of R packages

print.igraph.es

Print an edge sequence to the screen

Set a graph attribute

The default R palette

Find mutual edges in a directed graph

Make a new graph

Interactive plotting of graphs

subgraph_centrality

Find subgraph centrality scores of network positions

Subgraph of a graph

Create a lattice graph

Topological sorting of vertices in a graph

Permute the vertices of a graph

make_line_graph

Line graph of a graph

max_cardinality

Maximum cardinality search

sample_bipartite

Bipartite random graphs

Sampling a random integer sequence

sample_smallworld

The Watts-Strogatz small-world model

Helper function for adding and deleting vertices

Growing random graph generation

Geometric random graphs

Spectral Coarse Graining

Magrittr's pipes

Pie charts as vertices

Using pie charts as vertices in graph plots

Find the multiple or loop edges in a graph

Generate random graphs with a given degree sequence

Scan statistics on a time series of graphs

sample_traits_callaway

Graph generation based on different vertex types

print.igraphHRG

Print a hierarchical random graph model to the screen

print.igraph.vs

Show a vertex sequence on the screen

sample_dirichlet

Sample from a Dirichlet distribution

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

Random walk on a graph

Radius of a graph

sample_correlated_gnp

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

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Query and manipulate a graph as it were an adjacency list

split_join_distance

Split-join distance of two community structures

sample_correlated_gnp_pair

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

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

sample_dot_product

Generate random graphs according to the random dot product graph model

Trait-based random generation

Sample from a hierarchical random graph model

Sample stochastic block model

Set one or more vertex attributes

SIR model on graphs

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

Construtor modifier to remove all attributes from a graph

Query vertex attributes of a graph

Constructor modifier to drop loop edges

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

In- or out- component of a vertex

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Union of graphs

union.igraph.es

Union of edge sequences

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

Random graphs from vertex fitness scores

Constructor modifier to drop multiple and loop edges

Strength or weighted vertex degree

Query and manipulate a graph as it were an adjacency matrix

Triad census, subgraphs with three vertices

Transitivity of a graph

with_igraph_opt

Run code with a temporary igraph options setting

Constructor modifier to add vertex attributes

set_vertex_attr

Set vertex attributes

A graph with subgraphs that are each a random graph.

Various vertex shapes when plotting igraph graphs

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

Constructor modifier to add edge attributes

Constructor modifier to add graph attributes

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

Experimental basic igraph GUI

unique.igraph.es

Remove duplicate edges from an edge sequence

Igraph data structure versions

Convert a general graph into a forest

Union of two or more sets

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Tails of the edge(s) in a graph

union.igraph.vs

Union of vertex sequences

stochastic_matrix

Stochastic matrix of a graph

without_multiples

Constructor modifier to drop multiple edges

vertex_attr_names

List names of vertex attributes

vertex_connectivity

Vertex connectivity.

Writing the graph to a file in some format