Learn R Programming

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

igraph (version 1.2.5)

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

432,884

Version

1.2.5

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

March 19th, 2020

Functions in igraph (1.2.5)

Edges of a graph

Vertices of a graph

The igraph package

Adjacency lists

Add edges to a graph

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

all_simple_paths

List all simple paths from one source

as_adjacency_matrix

Convert a graph to an adjacency matrix

Add vertices to a graph

Add layout to graph

Convert a vertex or edge sequence to an ordinary vector

Are two vertices adjacent?

alpha_centrality

Find Bonacich alpha centrality scores of network positions

authority_score

Kleinberg's authority centrality scores.

Conversion to igraph

arpack_defaults

ARPACK eigenvector calculation

Convert between directed and undirected graphs

as_incidence_matrix

Incidence matrix of a bipartite graph

Assortativity coefficient

Convert a graph to an edge list

articulation_points

Articulation points of a graph

Convert igraph graphs to graphNEL objects from the graph package

Centralize a graph according to the degrees of vertices

bipartite_mapping

Decide whether a graph is bipartite

centr_degree_tmax

Theoretical maximum for degree centralization

bipartite_projection

Project a bipartite graph

Number of automorphisms

as_long_data_frame

Convert a graph to a long data frame

estimate_betweenness

Vertex and edge betweenness centrality

Breadth-first search

biconnected_components

Biconnected components

cluster_label_prop

Finding communities based on propagating labels

Centralize a graph according to the closeness of vertices

Declare a numeric vector as a membership vector

Component-wise layout

Concatenate vertex sequences

Concatenate edge sequences

component_distribution

Connected components of a graph

cluster_leading_eigen

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

Complementer of a graph

delete_vertex_attr

Delete a vertex attribute

delete_vertices

Delete vertices from a graph

Compose two graphs as binary relations

Centralize a graph according to the betweenness of vertices

centr_betw_tmax

Theoretical maximum for betweenness centralization

Centralization of a graph

Theoretical maximum for closeness centralization

categorical_pal

Palette for categories

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

canonical_permutation

Canonical permutation of a graph

Functions to deal with the result of network community detection

Set one or more edge attributes

Depth-first search

Query edge attributes of a graph

Diameter of a graph

Closeness centrality of vertices

Compares community structures using various metrics

Burt's constraint

Neighborhood of graph vertices

cluster_edge_betweenness

Community structure detection based on edge betweenness

Contract several vertices into a single one

Convex hull of a set of vertices

Delete edges from a graph

K-core decomposition of graphs

Girth of a graph

cluster_spinglass

Finding communities in graphs based on statistical meachanics

cluster_fast_greedy

Community structure via greedy optimization of modularity

Order (number of vertices) of a graph

Centralize a graph according to the eigenvector centrality of vertices

cluster_louvain

Finding community structure by multi-level optimization of modularity

delete_graph_attr

Delete a graph attribute

count_isomorphisms

Count the number of isomorphic mappings between two graphs

centr_eigen_tmax

Theoretical maximum for betweenness centralization

cluster_walktrap

Community strucure via short random walks

cluster_infomap

Infomap community finding

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Shortest (directed or undirected) paths between vertices

Create an igraph graph from a hierarchical random graph model

Kleinberg's hub centrality scores.

cluster_optimal

Optimal community structure

graph_from_incidence_matrix

Create graphs from an incidence matrix

count_subgraph_isomorphisms

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

igraph-es-indexing

Indexing edge sequences

count_triangles

Find triangles in graphs

Difference of two sets

Degree and degree distribution of the vertices

difference.igraph

Difference of graphs

delete_edge_attr

Delete an edge attribute

Create a consensus tree from several hierarchical random graph models

Diverging palette

Dyad census of a graph

The igraph console

Eccentricity of the vertices in a graph

Incident vertices of some graph edges

Convert object to a graph

Set all or some graph attributes

Cocitation coupling

cohesive_blocks

Calculate Cohesive Blocks

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Helper function for adding and deleting edges

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

Fitting a power-law distribution function to discrete data

Optimal edge curvature when plotting graphs

Decompose a graph into components

graph_from_atlas

Create a graph from the Graph Atlas

Groups of a vertex partitioning

graph_from_edgelist

Create a graph from an edge list matrix

The size of the graph (number of edges)

Creating igraph graphs from data frames or vice-versa

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

igraph-es-indexing2

Select edges and show their metadata

difference.igraph.es

Difference of edge sequences

Dimensionality selection for singular values using profile likelihood.

graph_from_graphdb

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

Run package tests

Query igraph's version string

Igraph data structure versions

Graphlet decomposition of a graph

Parameters for the igraph package

Indent a printout

difference.igraph.vs

Difference of vertex sequences

Intersection of two or more sets

Is this object an igraph graph?

Run igraph demos, step by step

is_min_separator

Minumal vertex separators

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

Head of the edge(s) in a graph

Spring layout, this was removed from igraph

Disjoint union of graphs

edge_attr_names

List names of edge attributes

Decide if two graphs are isomorphic

is_printer_callback

Is this a printer callback?

Choose an appropriate graph layout algorithm automatically

Print the only the head of an R object

Getting and setting graph attributes, shortcut

make_full_bipartite_graph

Create a full bipartite graph

edge_connectivity

Edge connectivity.

layout_with_mds

Graph layout by multidimensional scaling

isomorphism_class

Isomorphism class of a graph

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

layout_with_lgl

Large Graph Layout

Simple grid layout

Graph diversity

intersection.igraph.es

Intersection of edge sequences

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

make_full_citation_graph

Create a complete (full) citation graph

Fit a hierarchical random graph model

intersection.igraph

Intersection of graphs

graph_from_isomorphism_class

Create a graph from an isomorphism class

Create a lattice graph

layout_on_sphere

Graph layout with vertices on the surface of a sphere

graph_from_adj_list

Create graphs from adjacency lists

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Graph attributes of a graph

Get the id of a graph

graph_attr_names

List names of graph attributes

graph_from_literal

Creating (small) graphs via a simple interface

graph_from_adjacency_matrix

Create graphs from adjacency matrices

Check whether a graph is directed

layout_randomly

Randomly place vertices on a plane or in 3d space

Neighboring (adjacent) vertices in a graph

Hierarchical random graphs

Minimum spanning tree

make_kautz_graph

Creating a graph from LCF notation

Delete vertices or edges from a graph

Create a hierarchical random graph from an igraph graph

printer_callback

Create a printer callback function

The Fruchterman-Reingold layout algorithm

Is a degree sequence graphical?

laplacian_matrix

Graph Laplacian

make_chordal_ring

Create an extended chordal ring graph

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

The default R palette

identical_graphs

Decide if two graphs are identical

Incident edges of a vertex in a graph

Plotting of graphs

layout_with_gem

The GEM layout algorithm

make_line_graph

Line graph of a graph

Plotting the results on multiple SIR model runs

layout.reingold.tilford

Deprecated layout functions

Incident edges of multiple vertices in a graph

Creates a communities object.

Reverse the order in a vertex sequence

Rewiring edges of a graph

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Vertex separators

print.igraph.es

Print an edge sequence to the screen

Helper function to add or delete edges along a path

Minimum cut in a graph

Create a ring graph

Weighted graphs

Merging graph layouts

sample_dot_product

Generate random graphs according to the random dot product graph model

print.igraph.vs

Show a vertex sequence on the screen

Permute the vertices of a graph

Average nearest neighbor degree

Radius of a graph

Random walk on a graph

The Reingold-Tilford graph layout algorithm

Graph rewiring while preserving the degree distribution

igraph-vs-indexing2

Select vertices and show their metadata

igraph-vs-indexing

Indexing vertex sequences

intersection.igraph.vs

Intersection of vertex sequences

layout_with_graphopt

The graphopt layout algorithm

Make a new graph

layout_in_circle

Graph layout with vertices on a circle.

Chordality of a graph

sample_correlated_gnp

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

Calculate all isomorphic mappings between the vertices of two graphs

sample_last_cit

Random citation graphs

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

The Kamada-Kawai layout algorithm

Directed acyclic graphs

Maximum flow in a graph

Independent vertex sets

Random graphs from vertex fitness scores

Semi-Projectors

max_cardinality

Maximum cardinality search

Create a bipartite graph

SVD layout, this was removed from igraph

Sequential palette

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

sample_k_regular

Create a random regular graph

Sampling a random integer sequence

Construtor modifier to remove all attributes from a graph

layout_with_sugiyama

The Sugiyama graph layout generator

sample_smallworld

The Watts-Strogatz small-world model

Compute local scan statistics on graphs

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

A graph with subgraphs that are each a random graph.

Minimum size vertex separators

sample_correlated_gnp_pair

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

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

make_empty_graph

A graph with no edges

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

layout_as_bipartite

Simple two-row layout for bipartite graphs

Set edge attributes

The Davidson-Harel layout algorithm

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

SIR model on graphs

min_st_separators

Minimum size vertex separators

layout_with_drl

The DrL graph layout generator

Set a graph attribute

make_full_graph

Create a full graph

split_join_distance

Split-join distance of two community structures

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Magrittr's pipes

Match Graphs given a seeding of vertex correspondences

union.igraph.vs

Union of vertex sequences

make_de_bruijn_graph

De Bruijn graphs

Triad census, subgraphs with three vertices

Helper function for adding and deleting vertices

unique.igraph.es

Remove duplicate edges from an edge sequence

Transitivity of a graph

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

with_igraph_opt

Run code with a temporary igraph options setting

print.igraphHRG

Print a hierarchical random graph model to the screen

Igraph data structure versions

Subgraph of a graph

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

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

subgraph_centrality

Find subgraph centrality scores of network positions

Create tree graphs

Constructor modifier to add vertex attributes

Constructor modifier to drop loop edges

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

print.nexusDatasetInfo

Query and download from the Nexus network repository

Pie charts as vertices

Using pie charts as vertices in graph plots

Normalize layout

sample_forestfire

Forest Fire Network Model

The Page Rank algorithm

Reading foreign file formats

Add vertices, edges or another graph to a graph

Reciprocity of graphs

plot_dendrogram

Community structure dendrogram plots

Normalize coordinates for plotting graphs

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Replicate a graph multiple times

modularity.igraph

Modularity of a community structure of a graph

Predict edges based on a hierarchical random graph model

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

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Reverse the order in an edge sequence

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

plot_dendrogram.igraphHRG

HRG dendrogram plot

Print graphs to the terminal

sample_dirichlet

Sample from a Dirichlet distribution

Geometric random graphs

Running mean of a time series

3D plotting of graphs with OpenGL

sample_traits_callaway

Graph generation based on different vertex types

Generate random graphs with a given degree sequence

Sample from a random graph model

Scan statistics on a time series of graphs

Error of the spectral coarse graining (SCG) approximation

Growing random graph generation

SCG Problem Solver

Constructor modifier to drop multiple and loop edges

Strength or weighted vertex degree

Similarity measures of two vertices

sample_bipartite

Bipartite random graphs

Query and manipulate a graph as it were an adjacency matrix

Generate an evolving random graph with preferential attachment and aging

Sample from a hierarchical random graph model

set_vertex_attr

Set vertex attributes

union.igraph.es

Union of edge sequences

Various vertex shapes when plotting igraph graphs

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

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Find the multiple or loop edges in a graph

Union of graphs

Trait-based random generation

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

without_multiples

Constructor modifier to drop multiple edges

stochastic_matrix

Stochastic matrix of a graph

Query and manipulate a graph as it were an adjacency list

Find mutual edges in a directed graph

Writing the graph to a file in some format

Sample stochastic block model

Spectral Coarse Graining

In- or out- component of a vertex

Union of two or more sets

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

Query vertex attributes of a graph

Set one or more vertex attributes

Constructor modifier to add edge attributes

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

Convert a general graph into a forest

Constructor modifier to add graph attributes

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

Interactive plotting of graphs

Tails of the edge(s) in a graph

Experimental basic igraph GUI

Topological sorting of vertices in a graph

vertex_attr_names

List names of vertex attributes

vertex_connectivity

Vertex connectivity.