Learn R Programming

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

igraph (version 1.2.6)

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

357,402

Version

1.2.6

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

October 6th, 2020

Functions in igraph (1.2.6)

Centralization of a graph

Concatenate edge sequences

Concatenate vertex sequences

Conversion to igraph

Convert between directed and undirected graphs

Breadth-first search

biconnected_components

Biconnected components

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

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

arpack_defaults

ARPACK eigenvector calculation

all_simple_paths

List all simple paths from one source

articulation_points

Articulation points of a graph

Centralize a graph according to the closeness of vertices

Cocitation coupling

The igraph package

component_distribution

Connected components of a graph

Theoretical maximum for closeness centralization

cluster_edge_betweenness

Community structure detection based on edge betweenness

Closeness centrality of vertices

Assortativity coefficient

cohesive_blocks

Calculate Cohesive Blocks

Compose two graphs as binary relations

authority_score

Kleinberg's authority centrality scores.

Add edges to a graph

canonical_permutation

Canonical permutation of a graph

as_adjacency_matrix

Convert a graph to an adjacency matrix

Adjacency lists

Vertices of a graph

Edges of a graph

categorical_pal

Palette for categories

bipartite_mapping

Decide whether a graph is bipartite

bipartite_projection

Project a bipartite graph

Number of automorphisms

Convert a graph to an edge list

count_subgraph_isomorphisms

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

difference.igraph.es

Difference of edge sequences

count_triangles

Find triangles in graphs

Centralize a graph according to the betweenness of vertices

estimate_betweenness

Vertex and edge betweenness centrality

cluster_infomap

Infomap community finding

cluster_fast_greedy

Community structure via greedy optimization of modularity

difference.igraph.vs

Difference of vertex sequences

cluster_louvain

Finding community structure by multi-level optimization of modularity

delete_edge_attr

Delete an edge attribute

Degree and degree distribution of the vertices

Convert igraph graphs to graphNEL objects from the graph package

cluster_optimal

Optimal community structure

Graph diversity

Fitting a power-law distribution function to discrete data

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

Igraph data structure versions

Graphlet decomposition of a graph

Hierarchical random graphs

centr_betw_tmax

Theoretical maximum for betweenness centralization

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Centralize a graph according to the eigenvector centrality of vertices

as_long_data_frame

Convert a graph to a long data frame

Create a consensus tree from several hierarchical random graph models

Declare a numeric vector as a membership vector

The igraph console

Helper function for adding and deleting edges

Eccentricity of the vertices in a graph

Create a hierarchical random graph from an igraph graph

Centralize a graph according to the degrees of vertices

Component-wise layout

graph_from_atlas

Create a graph from the Graph Atlas

Complementer of a graph

cluster_walktrap

Community strucure via short random walks

cluster_spinglass

Finding communities in graphs based on statistical meachanics

centr_degree_tmax

Theoretical maximum for degree centralization

Creating igraph graphs from data frames or vice-versa

Neighborhood of graph vertices

cluster_label_prop

Finding communities based on propagating labels

count_isomorphisms

Count the number of isomorphic mappings between two graphs

cluster_leading_eigen

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

Convex hull of a set of vertices

delete_vertices

Delete vertices from a graph

delete_vertex_attr

Delete a vertex attribute

Delete edges from a graph

delete_graph_attr

Delete a graph attribute

Depth-first search

Diameter of a graph

K-core decomposition of graphs

Decompose a graph into components

Diverging palette

Disjoint union of graphs

Shortest (directed or undirected) paths between vertices

Optimal edge curvature when plotting graphs

Dimensionality selection for singular values using profile likelihood.

Vertex separators

Kleinberg's hub centrality scores.

Create an igraph graph from a hierarchical random graph model

Weighted graphs

SVD layout, this was removed from igraph

edge_attr_names

List names of edge attributes

edge_connectivity

Edge connectivity.

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

Girth of a graph

Getting and setting graph attributes, shortcut

intersection.igraph

Intersection of graphs

Order (number of vertices) of a graph

graph_from_literal

Creating (small) graphs via a simple interface

Burt's constraint

Functions to deal with the result of network community detection

Contract several vertices into a single one

Compares community structures using various metrics

intersection.igraph.es

Intersection of edge sequences

Get the id of a graph

Dyad census of a graph

Check whether a graph is directed

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Difference of two sets

Is a degree sequence graphical?

difference.igraph

Difference of graphs

Decide if two graphs are isomorphic

Fit a hierarchical random graph model

graph_from_adj_list

Create graphs from adjacency lists

graph_from_adjacency_matrix

Create graphs from adjacency matrices

graph_from_edgelist

Create a graph from an edge list matrix

graph_from_graphdb

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

identical_graphs

Decide if two graphs are identical

isomorphism_class

Isomorphism class of a graph

The Reingold-Tilford graph layout algorithm

Indent a printout

layout_in_circle

Graph layout with vertices on a circle.

Parameters for the igraph package

Run igraph demos, step by step

layout_with_graphopt

The graphopt layout algorithm

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

The Kamada-Kawai layout algorithm

Incident vertices of some graph edges

Set all or some graph attributes

Convert object to a graph

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Intersection of two or more sets

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

layout_with_gem

The GEM layout algorithm

The Fruchterman-Reingold layout algorithm

make_de_bruijn_graph

De Bruijn graphs

make_chordal_ring

Create an extended chordal ring graph

make_empty_graph

A graph with no edges

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

make_line_graph

Line graph of a graph

Creates a communities object.

Create a ring graph

graph_from_incidence_matrix

Create graphs from an incidence matrix

Match Graphs given a seeding of vertex correspondences

is_printer_callback

Is this a printer callback?

Delete vertices or edges from a graph

Query edge attributes of a graph

Set one or more edge attributes

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

Minimum size vertex separators

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

Graph attributes of a graph

min_st_separators

Minimum size vertex separators

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

graph_attr_names

List names of graph attributes

graph_from_isomorphism_class

Create a graph from an isomorphism class

print.nexusDatasetInfo

Query and download from the Nexus network repository

Normalize coordinates for plotting graphs

Groups of a vertex partitioning

The size of the graph (number of edges)

Graph rewiring while preserving the degree distribution

Creating a graph from LCF notation

Print the only the head of an R object

Head of the edge(s) in a graph

Incident edges of a vertex in a graph

Average nearest neighbor degree

Incident edges of multiple vertices in a graph

Magrittr's pipes

print.igraph.es

Print an edge sequence to the screen

igraph-es-indexing

Indexing edge sequences

laplacian_matrix

Graph Laplacian

layout.reingold.tilford

Deprecated layout functions

print.igraph.vs

Show a vertex sequence on the screen

igraph-es-indexing2

Select edges and show their metadata

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-indexing2

Select vertices and show their metadata

layout_on_sphere

Graph layout with vertices on the surface of a sphere

Run package tests

Query igraph's version string

layout_randomly

Randomly place vertices on a plane or in 3d space

Choose an appropriate graph layout algorithm automatically

Is this object an igraph graph?

Plotting of graphs

is_min_separator

Minumal vertex separators

Calculate all isomorphic mappings between the vertices of two graphs

Independent vertex sets

The Davidson-Harel layout algorithm

intersection.igraph.vs

Intersection of vertex sequences

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

layout_as_bipartite

Simple two-row layout for bipartite graphs

Chordality of a graph

layout_with_sugiyama

The Sugiyama graph layout generator

layout_with_drl

The DrL graph layout generator

Directed acyclic graphs

Rewiring edges of a graph

Reverse the order in a vertex sequence

Compute local scan statistics on graphs

Make a new graph

Plotting the results on multiple SIR model runs

Generate random graphs with a given degree sequence

Simple grid layout

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

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

Create a bipartite graph

make_full_citation_graph

Create a complete (full) citation graph

Spring layout, this was removed from igraph

make_full_bipartite_graph

Create a full bipartite graph

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Add vertices, edges or another graph to a graph

modularity.igraph

Modularity of a community structure of a graph

Create a lattice graph

make_kautz_graph

Maximum flow in a graph

sample_dirichlet

Sample from a Dirichlet distribution

max_cardinality

Maximum cardinality search

Replicate a graph multiple times

Geometric random graphs

Minimum spanning tree

print.igraphHRG

Print a hierarchical random graph model to the screen

Growing random graph generation

Reverse the order in an edge sequence

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

plot_dendrogram

Community structure dendrogram plots

Neighboring (adjacent) vertices in a graph

Helper function to add or delete edges along a path

plot_dendrogram.igraphHRG

HRG dendrogram plot

Permute the vertices of a graph

Random graphs from vertex fitness scores

printer_callback

Create a printer callback function

sample_dot_product

Generate random graphs according to the random dot product graph model

A graph with subgraphs that are each a random graph.

The default R palette

Trait-based random generation

Sample stochastic block model

Scan statistics on a time series of graphs

sample_traits_callaway

Graph generation based on different vertex types

sample_k_regular

Create a random regular graph

Reading foreign file formats

layout_with_lgl

Large Graph Layout

Reciprocity of graphs

Radius of a graph

Random walk on a graph

sample_correlated_gnp_pair

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

sample_correlated_gnp

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

make_full_graph

Create a full graph

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

layout_with_mds

Graph layout by multidimensional scaling

Sample from a random graph model

sample_last_cit

Random citation graphs

Generate an evolving random graph with preferential attachment and aging

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

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

Error of the spectral coarse graining (SCG) approximation

SCG Problem Solver

Create tree graphs

Minimum cut in a graph

Merging graph layouts

set_vertex_attr

Set vertex attributes

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

Various vertex shapes when plotting igraph graphs

sample_bipartite

Bipartite random graphs

Similarity measures of two vertices

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

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

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

stochastic_matrix

Stochastic matrix of a graph

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

Sample from a hierarchical random graph model

Strength or weighted vertex degree

Query and manipulate a graph as it were an adjacency matrix

Constructor modifier to drop multiple and loop edges

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

unique.igraph.es

Remove duplicate edges from an edge sequence

union.igraph.vs

Union of vertex sequences

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

Construtor modifier to remove all attributes from a graph

Normalize layout

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

Predict edges based on a hierarchical random graph model

Constructor modifier to drop loop edges

sample_smallworld

The Watts-Strogatz small-world model

The Page Rank algorithm

Set edge attributes

Sampling a random integer sequence

Query vertex attributes of a graph

Triad census, subgraphs with three vertices

Set one or more vertex attributes

Transitivity of a graph

Tails of the edge(s) in a graph

Experimental basic igraph GUI

Interactive plotting of graphs

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

Topological sorting of vertices in a graph

3D plotting of graphs with OpenGL

Print graphs to the terminal

Running mean of a time series

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

vertex_attr_names

List names of vertex attributes

with_igraph_opt

Run code with a temporary igraph options setting

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Set a graph attribute

Constructor modifier to add vertex attributes

vertex_connectivity

Vertex connectivity.

sample_forestfire

Forest Fire Network Model

Semi-Projectors

union.igraph.es

Union of edge sequences

Union of graphs

Spectral Coarse Graining

Sequential palette

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

SIR model on graphs

Query and manipulate a graph as it were an adjacency list

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

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Igraph data structure versions

without_multiples

Constructor modifier to drop multiple edges

Writing the graph to a file in some format

In- or out- component of a vertex

split_join_distance

Split-join distance of two community structures

Constructor modifier to add edge attributes

Subgraph of a graph

subgraph_centrality

Find subgraph centrality scores of network positions

Constructor modifier to add graph attributes

Union of two or more sets

Convert a general graph into a forest

Helper function for adding and deleting vertices

Pie charts as vertices

Using pie charts as vertices in graph plots

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Add vertices to a graph

Add layout to graph

Are two vertices adjacent?

Convert a vertex or edge sequence to an ordinary vector

as_incidence_matrix

Incidence matrix of a bipartite graph