Learn R Programming

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

igraph (version 1.2.7)

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

License

GPL (>= 2)

Maintainer

Tam<c3><a1>s Nepusz

Last Published

October 15th, 2021

Functions in igraph (1.2.7)

Add edges to a graph

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

Add vertices to a graph

Edges of a graph

Vertices of a graph

The igraph package

all_simple_paths

List all simple paths from one source

Add layout to graph

Are two vertices adjacent?

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Convert a vertex or edge sequence to an ordinary vector

Convert igraph graphs to graphNEL objects from the graph package

Convert a graph to an edge list

Convert between directed and undirected graphs

Conversion to igraph

as_incidence_matrix

Incidence matrix of a bipartite graph

estimate_betweenness

Vertex and edge betweenness centrality

Number of automorphisms

Theoretical maximum for closeness centralization

Centralize a graph according to the closeness of vertices

as_long_data_frame

Convert a graph to a long data frame

Declare a numeric vector as a membership vector

Adjacency lists

as_adjacency_matrix

Convert a graph to an adjacency matrix

Centralize a graph according to the degrees of vertices

Closeness centrality of vertices

Centralize a graph according to the betweenness of vertices

arpack_defaults

ARPACK eigenvector calculation

centr_degree_tmax

Theoretical maximum for degree centralization

Centralize a graph according to the eigenvector centrality of vertices

Functions to deal with the result of network community detection

centr_eigen_tmax

Theoretical maximum for betweenness centralization

articulation_points

Articulation points of a graph

Concatenate edge sequences

authority_score

Kleinberg's authority centrality scores.

cluster_edge_betweenness

Community structure detection based on edge betweenness

Assortativity coefficient

biconnected_components

Biconnected components

canonical_permutation

Canonical permutation of a graph

Breadth-first search

Concatenate vertex sequences

Cocitation coupling

cluster_label_prop

Finding communities based on propagating labels

cluster_infomap

Infomap community finding

Convex hull of a set of vertices

count_isomorphisms

Count the number of isomorphic mappings between two graphs

K-core decomposition of graphs

cohesive_blocks

Calculate Cohesive Blocks

Centralization of a graph

bipartite_mapping

Decide whether a graph is bipartite

bipartite_projection

Project a bipartite graph

centr_betw_tmax

Theoretical maximum for betweenness centralization

Set one or more edge attributes

Difference of two sets

difference.igraph

Difference of graphs

Compares community structures using various metrics

Delete edges from a graph

Create a consensus tree from several hierarchical random graph models

component_distribution

Connected components of a graph

Compose two graphs as binary relations

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

delete_graph_attr

Delete a graph attribute

categorical_pal

Palette for categories

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Query edge attributes of a graph

cluster_fluid_communities

Community detection algorithm based on interacting fluids

cluster_fast_greedy

Community structure via greedy optimization of modularity

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

cluster_leading_eigen

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

Convert object to a graph

graph_from_atlas

Create a graph from the Graph Atlas

Set all or some graph attributes

Incident vertices of some graph edges

Complementer of a graph

Creating igraph graphs from data frames or vice-versa

cluster_spinglass

Finding communities in graphs based on statistical meachanics

Component-wise layout

Graphlet decomposition of a graph

identical_graphs

Decide if two graphs are identical

Run package tests

Kleinberg's hub centrality scores.

Igraph data structure versions

count_subgraph_isomorphisms

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

Parameters for the igraph package

Graph rewiring while preserving the degree distribution

Independent vertex sets

count_triangles

Find triangles in graphs

cluster_walktrap

Community strucure via short random walks

Burt's constraint

The igraph console

Optimal edge curvature when plotting graphs

cluster_optimal

Optimal community structure

cluster_louvain

Finding community structure by multi-level optimization of modularity

Depth-first search

Dyad census of a graph

delete_edge_attr

Delete an edge attribute

Degree and degree distribution of the vertices

Diameter of a graph

Helper function for adding and deleting edges

Eccentricity of the vertices in a graph

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Graph attributes of a graph

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

Fitting a power-law distribution function to discrete data

Fit a hierarchical random graph model

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

layout.reingold.tilford

Deprecated layout functions

Contract several vertices into a single one

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

Dimensionality selection for singular values using profile likelihood.

Decompose a graph into components

delete_vertices

Delete vertices from a graph

delete_vertex_attr

Delete a vertex attribute

Graph diversity

layout_with_drl

The DrL graph layout generator

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

handle_vertex_type_arg

Common handler for vertex type arguments in igraph functions

Disjoint union of graphs

graph_from_incidence_matrix

Create graphs from an incidence matrix

difference.igraph.es

Difference of edge sequences

difference.igraph.vs

Difference of vertex sequences

Shortest (directed or undirected) paths between vertices

graph_attr_names

List names of graph attributes

Print the only the head of an R object

The Fruchterman-Reingold layout algorithm

make_empty_graph

A graph with no edges

Neighborhood of graph vertices

graph_from_adj_list

Create graphs from adjacency lists

make_full_bipartite_graph

Create a full bipartite graph

Groups of a vertex partitioning

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.

igraph-es-indexing2

Select edges and show their metadata

The size of the graph (number of edges)

Diverging palette

igraph-vs-indexing2

Select vertices and show their metadata

Delete vertices or edges from a graph

graph_from_adjacency_matrix

Create graphs from adjacency matrices

Run igraph demos, step by step

Hierarchical random graphs

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

Head of the edge(s) in a graph

Chordality of a graph

Indent a printout

intersection.igraph.es

Intersection of edge sequences

Incident edges of multiple vertices in a graph

Directed acyclic graphs

intersection.igraph.vs

Intersection of vertex sequences

isomorphism_class

Isomorphism class of a graph

Calculate all isomorphic mappings between the vertices of two graphs

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

graph_from_literal

Creating (small) graphs via a simple interface

edge_attr_names

List names of edge attributes

Get the id of a graph

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Average nearest neighbor degree

layout_with_lgl

Large Graph Layout

The Kamada-Kawai layout algorithm

Create a hierarchical random graph from an igraph graph

laplacian_matrix

Graph Laplacian

Create an igraph graph from a hierarchical random graph model

make_kautz_graph

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

Query igraph's version string

Check whether a graph is directed

Intersection of two or more sets

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Getting and setting graph attributes, shortcut

is_printer_callback

Is this a printer callback?

layout_in_circle

Graph layout with vertices on a circle.

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

intersection.igraph

Intersection of graphs

Vertex separators

Spring layout, this was removed from igraph

is_min_separator

Minimal vertex separators

Incident edges of a vertex in a graph

Choose an appropriate graph layout algorithm automatically

Weighted graphs

Permute the vertices of a graph

Magrittr's pipes

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Minimum spanning tree

edge_connectivity

Edge connectivity.

Decide if two graphs are isomorphic

layout_with_gem

The GEM layout algorithm

Girth of a graph

The Reingold-Tilford graph layout algorithm

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

graph_from_isomorphism_class

Create a graph from an isomorphism class

Order (number of vertices) of a graph

Creates a communities object.

make_de_bruijn_graph

De Bruijn graphs

SVD layout, this was removed from igraph

layout_with_graphopt

The graphopt layout algorithm

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

Reverse the order in a vertex sequence

Trait-based random generation

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

Predict edges based on a hierarchical random graph model

Rewiring edges of a graph

printer_callback

Create a printer callback function

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

Sample stochastic block model

layout_randomly

Randomly place vertices on a plane or in 3d space

make_full_citation_graph

Create a complete (full) citation graph

make_full_graph

Create a full graph

Neighboring (adjacent) vertices in a graph

print.nexusDatasetInfo

Query and download from the Nexus network repository

modularity.igraph

Modularity of a community structure of a graph

min_st_separators

Minimum size vertex separators

split_join_distance

Split-join distance of two community structures

Query and manipulate a graph as it were an adjacency matrix

Strength or weighted vertex degree

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Creating a graph from LCF notation

Simple grid layout

layout_on_sphere

Graph layout with vertices on the surface of a sphere

The Davidson-Harel layout algorithm

layout_with_mds

Graph layout by multidimensional scaling

layout_with_sugiyama

The Sugiyama graph layout generator

Interactive plotting of graphs

Create a lattice graph

print.igraph.vs

Show a vertex sequence on the screen

Create a bipartite graph

make_line_graph

Line graph of a graph

Topological sorting of vertices in a graph

Add vertices, edges or another graph to a graph

plot_dendrogram.igraphHRG

HRG dendrogram plot

Create tree graphs

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

Match Graphs given a seeding of vertex correspondences

max_cardinality

Maximum cardinality search

Helper function to add or delete edges along a path

The Page Rank algorithm

Print graphs to the terminal

igraph-es-indexing

Indexing edge sequences

print.igraph.es

Print an edge sequence to the screen

Radius of a graph

Random walk on a graph

Union of graphs

Is this object an igraph graph?

Is a degree sequence graphical?

print.igraphHRG

Print a hierarchical random graph model to the screen

Replicate a graph multiple times

sample_bipartite

Bipartite random graphs

Sample from a random graph model

Reading foreign file formats

Reciprocity of graphs

make_chordal_ring

Create an extended chordal ring graph

sample_dot_product

Generate random graphs according to the random dot product graph model

sample_dirichlet

Sample from a Dirichlet distribution

Compute local scan statistics on graphs

Sample from a hierarchical random graph model

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

layout_as_bipartite

Simple two-row layout for bipartite graphs

Generate random graphs with a given degree sequence

sample_correlated_gnp

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

Reverse the order in an edge sequence

sample_correlated_gnp_pair

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

Make a new graph

Create a ring graph

Random graphs from vertex fitness scores

Maximum flow in a graph

sample_last_cit

Random citation graphs

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

union.igraph.es

Union of edge sequences

sample_smallworld

The Watts-Strogatz small-world model

Sampling a random integer sequence

Error of the spectral coarse graining (SCG) approximation

SCG Problem Solver

Merging graph layouts

Constructor modifier to drop multiple and loop edges

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

Minimum size vertex separators

Minimum cut in a graph

Similarity measures of two vertices

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

Plotting the results on multiple SIR model runs

A graph with subgraphs that are each a random graph.

plot_dendrogram

Community structure dendrogram plots

Geometric random graphs

Plotting of graphs

sample_k_regular

Create a random regular graph

Semi-Projectors

Sequential palette

Subgraph of a graph

subgraph_centrality

Find subgraph centrality scores of network positions

Spectral Coarse Graining

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

Helper function for adding and deleting vertices

with_igraph_opt

Run code with a temporary igraph options setting

Pie charts as vertices

Using pie charts as vertices in graph plots

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Find the multiple or loop edges in a graph

Query and manipulate a graph as it were an adjacency list

set_vertex_attr

Set vertex attributes

Various vertex shapes when plotting igraph graphs

In- or out- component of a vertex

Growing random graph generation

Normalize layout

Normalize coordinates for plotting graphs

Find mutual edges in a directed graph

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

Constructor modifier to add vertex attributes

Convert a general graph into a forest

SIR model on graphs

vertex_attr_names

List names of vertex attributes

Union of two or more sets

Set a graph attribute

Set edge attributes

vertex_connectivity

Vertex connectivity.

without_multiples

Constructor modifier to drop multiple edges

Better printing of R packages

3D plotting of graphs with OpenGL

The default R palette

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

Running mean of a time series

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

Writing the graph to a file in some format

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Transitivity of a graph

Triad census, subgraphs with three vertices

Tails of the edge(s) in a graph

Experimental basic igraph GUI

Query vertex attributes of a graph

Set one or more vertex attributes

sample_forestfire

Forest Fire Network Model

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

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Igraph data structure versions

Generate an evolving random graph with preferential attachment and aging

sample_traits_callaway

Graph generation based on different vertex types

Scan statistics on a time series of graphs

Constructor modifier to add graph attributes

Constructor modifier to add edge attributes

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

stochastic_matrix

Stochastic matrix of a graph

union.igraph.vs

Union of vertex sequences

unique.igraph.es

Remove duplicate edges from an edge sequence

Construtor modifier to remove all attributes from a graph

Constructor modifier to drop loop edges