Learn R Programming

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

igraph (version 1.2.3)

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

379,721

Version

1.2.3

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

February 10th, 2019

Functions in igraph (1.2.3)

as_long_data_frame

Convert a graph to a long data frame

Number of automorphisms

all_simple_paths

List all simple paths from one source

Convert between directed and undirected graphs

Conversion to igraph

categorical_pal

Palette for categories

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Add layout to graph

cluster_label_prop

Finding communities based on propagating labels

estimate_betweenness

Vertex and edge betweenness centrality

Complementer of a graph

Component-wise layout

cluster_leading_eigen

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

Add vertices to a graph

arpack_defaults

ARPACK eigenvector calculation

articulation_points

Articulation points of a graph

Are two vertices adjacent?

Create a consensus tree from several hierarchical random graph models

The igraph console

Contract several vertices into a single one

Burt's constraint

Shortest (directed or undirected) paths between vertices

Optimal edge curvature when plotting graphs

Decompose a graph into components

Diverging palette

Dimensionality selection for singular values using profile likelihood.

Adjacency lists

Centralize a graph according to the betweenness of vertices

centr_betw_tmax

Theoretical maximum for betweenness centralization

cluster_fast_greedy

Community structure via greedy optimization of modularity

Eccentricity of the vertices in a graph

The igraph package

cluster_infomap

Infomap community finding

as_adjacency_matrix

Convert a graph to an adjacency matrix

Add edges to a graph

Disjoint union of graphs

Convert a vertex or edge sequence to an ordinary vector

cluster_spinglass

Finding communities in graphs based on statistical meachanics

cluster_walktrap

Community strucure via short random walks

component_distribution

Connected components of a graph

Helper function for adding and deleting edges

Fitting a power-law distribution function to discrete data

Assortativity coefficient

Graph diversity

Edges of a graph

Compose two graphs as binary relations

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

authority_score

Kleinberg's authority centrality scores.

Fit a hierarchical random graph model

Vertices of a graph

Convert a graph to an edge list

Convert igraph graphs to graphNEL objects from the graph package

Centralize a graph according to the degrees of vertices

centr_degree_tmax

Theoretical maximum for degree centralization

Centralization of a graph

bipartite_mapping

Decide whether a graph is bipartite

bipartite_projection

Project a bipartite graph

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

cluster_louvain

Finding community structure by multi-level optimization of modularity

Centralize a graph according to the closeness of vertices

count_subgraph_isomorphisms

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

Graph attributes of a graph

Theoretical maximum for closeness centralization

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

Igraph data structure versions

cluster_edge_betweenness

Community structure detection based on edge betweenness

Closeness centrality of vertices

Compares community structures using various metrics

Functions to deal with the result of network community detection

graph_attr_names

List names of graph attributes

cluster_optimal

Optimal community structure

count_triangles

Find triangles in graphs

Delete edges from a graph

Difference of two sets

Graphlet decomposition of a graph

difference.igraph

Difference of graphs

Convex hull of a set of vertices

K-core decomposition of graphs

delete_graph_attr

Delete a graph attribute

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

graph_from_incidence_matrix

Create graphs from an incidence matrix

identical_graphs

Decide if two graphs are identical

Set one or more edge attributes

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Query edge attributes of a graph

delete_vertex_attr

Delete a vertex attribute

Indent a printout

Breadth-first search

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

as_incidence_matrix

Incidence matrix of a bipartite graph

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Head of the edge(s) in a graph

delete_vertices

Delete vertices from a graph

Depth-first search

graph_from_atlas

Create a graph from the Graph Atlas

Girth of a graph

Diameter of a graph

Order (number of vertices) of a graph

Intersection of two or more sets

Print the only the head of an R object

biconnected_components

Biconnected components

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

Directed acyclic graphs

graph_from_isomorphism_class

Create a graph from an isomorphism class

Concatenate edge sequences

Concatenate vertex sequences

edge_attr_names

List names of edge attributes

Calculate all isomorphic mappings between the vertices of two graphs

Creating igraph graphs from data frames or vice-versa

Creating a graph from LCF notation

Hierarchical random graphs

Incident vertices of some graph edges

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

edge_connectivity

Edge connectivity.

Groups of a vertex partitioning

Centralize a graph according to the eigenvector centrality of vertices

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Create a hierarchical random graph from an igraph graph

Delete vertices or edges from a graph

Convert object to a graph

Cocitation coupling

Run igraph demos, step by step

Set all or some graph attributes

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.

Independent vertex sets

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

intersection.igraph

Intersection of graphs

The size of the graph (number of edges)

cohesive_blocks

Calculate Cohesive Blocks

Getting and setting graph attributes, shortcut

Parameters for the igraph package

count_isomorphisms

Count the number of isomorphic mappings between two graphs

SVD layout, this was removed from igraph

intersection.igraph.es

Intersection of edge sequences

The Davidson-Harel layout algorithm

Incident edges of a vertex in a graph

igraph-es-indexing

Indexing edge sequences

Degree and degree distribution of the vertices

layout_with_drl

The DrL graph layout generator

Vertex separators

delete_edge_attr

Delete an edge attribute

Weighted graphs

laplacian_matrix

Graph Laplacian

layout.reingold.tilford

Deprecated layout functions

igraph-es-indexing2

Select edges and show their metadata

layout_as_bipartite

Simple two-row layout for bipartite graphs

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

difference.igraph.es

Difference of edge sequences

Check whether a graph is directed

Incident edges of multiple vertices in a graph

difference.igraph.vs

Difference of vertex sequences

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

intersection.igraph.vs

Intersection of vertex sequences

make_full_graph

Create a full graph

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

Run package tests

Query igraph's version string

Dyad census of a graph

make_kautz_graph

Make a new graph

Chordality of a graph

Create a bipartite graph

Is this object an igraph graph?

Graph rewiring while preserving the degree distribution

Average nearest neighbor degree

is_min_separator

Minumal vertex separators

Create a lattice graph

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

Spring layout, this was removed from igraph

Is a degree sequence graphical?

layout_with_lgl

Large Graph Layout

layout_with_mds

Graph layout by multidimensional scaling

layout_on_sphere

Graph layout with vertices on the surface of a sphere

max_cardinality

Maximum cardinality search

Decide if two graphs are isomorphic

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

Minimum cut in a graph

Merging graph layouts

Neighborhood of graph vertices

graph_from_adj_list

Create graphs from adjacency lists

layout_randomly

Randomly place vertices on a plane or in 3d space

isomorphism_class

Isomorphism class of a graph

Choose an appropriate graph layout algorithm automatically

Simple grid layout

graph_from_adjacency_matrix

Create graphs from adjacency matrices

graph_from_literal

Creating (small) graphs via a simple interface

Get the id of a graph

The Fruchterman-Reingold layout algorithm

layout_with_gem

The GEM layout algorithm

Create an igraph graph from a hierarchical random graph model

layout_with_sugiyama

The Sugiyama graph layout generator

Kleinberg's hub centrality scores.

Maximum flow in a graph

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-indexing2

Select vertices and show their metadata

Compute local scan statistics on graphs

make_chordal_ring

Create an extended chordal ring graph

is_printer_callback

Is this a printer callback?

Creates a communities object.

make_de_bruijn_graph

De Bruijn graphs

print.nexusDatasetInfo

Query and download from the Nexus network repository

Add vertices, edges or another graph to a graph

The Reingold-Tilford graph layout algorithm

Normalize coordinates for plotting graphs

layout_in_circle

Graph layout with vertices on a circle.

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

make_empty_graph

A graph with no edges

Random walk on a graph

layout_with_graphopt

The graphopt layout algorithm

Minimum spanning tree

Helper function to add or delete edges along a path

Permute the vertices of a graph

Match Graphs given a seeding of vertex correspondences

Reading foreign file formats

sample_bipartite

Bipartite random graphs

Neighboring (adjacent) vertices in a graph

sample_correlated_gnp

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

make_line_graph

Line graph of a graph

Create a ring graph

printer_callback

Create a printer callback function

The Kamada-Kawai layout algorithm

Better printing of R packages

Plotting of graphs

Minimum size vertex separators

make_full_bipartite_graph

Create a full bipartite graph

Plotting the results on multiple SIR model runs

min_st_separators

Minimum size vertex separators

make_full_citation_graph

Create a complete (full) citation graph

Magrittr's pipes

The default R palette

Radius of a graph

sample_forestfire

Forest Fire Network Model

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

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

Predict edges based on a hierarchical random graph model

Create tree graphs

modularity.igraph

Modularity of a community structure of a graph

print.igraph.es

Print an edge sequence to the screen

sample_smallworld

The Watts-Strogatz small-world model

Normalize layout

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

sample_dirichlet

Sample from a Dirichlet distribution

sample_dot_product

Generate random graphs according to the random dot product graph model

print.igraph.vs

Show a vertex sequence on the screen

The Page Rank algorithm

Reciprocity of graphs

Sequential palette

Replicate a graph multiple times

Print graphs to the terminal

Reverse the order in an edge sequence

Reverse the order in a vertex sequence

plot_dendrogram

Community structure dendrogram plots

print.igraphHRG

Print a hierarchical random graph model to the screen

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

sample_correlated_gnp_pair

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

Rewiring edges of a graph

plot_dendrogram.igraphHRG

HRG dendrogram plot

Set edge attributes

In- or out- component of a vertex

3D plotting of graphs with OpenGL

Sample stochastic block model

Sampling a random integer sequence

Subgraph of a graph

Running mean of a time series

Sample from a random graph model

Generate random graphs with a given degree sequence

Scan statistics on a time series of graphs

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

Geometric random graphs

Topological sorting of vertices in a graph

Spectral Coarse Graining

sample_k_regular

Create a random regular graph

split_join_distance

Split-join distance of two community structures

Transitivity of a graph

Random graphs from vertex fitness scores

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

Query vertex attributes of a graph

vertex_attr_names

List names of vertex attributes

union.igraph.es

Union of edge sequences

Constructor modifier to drop loop edges

sample_last_cit

Random citation graphs

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Sample from a hierarchical random graph model

A graph with subgraphs that are each a random graph.

union.igraph.vs

Union of vertex sequences

without_multiples

Constructor modifier to drop multiple edges

Generate an evolving random graph with preferential attachment and aging

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

Trait-based random generation

SCG Problem Solver

Semi-Projectors

SIR model on graphs

Growing random graph generation

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

Error of the spectral coarse graining (SCG) approximation

Set a graph attribute

vertex_connectivity

Vertex connectivity.

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

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

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

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Eigenvalues and eigenvectors of the adjacency matrix of a graph

set_vertex_attr

Set vertex attributes

subgraph_centrality

Find subgraph centrality scores of network positions

Query and manipulate a graph as it were an adjacency matrix

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

Constructor modifier to add edge attributes

Constructor modifier to drop multiple and loop edges

Query and manipulate a graph as it were an adjacency list

stochastic_matrix

Stochastic matrix of a graph

Strength or weighted vertex degree

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

Triad census, subgraphs with three vertices

sample_traits_callaway

Graph generation based on different vertex types

Experimental basic igraph GUI

Various vertex shapes when plotting igraph graphs

Interactive plotting of graphs

Union of two or more sets

Convert a general graph into a forest

unique.igraph.es

Remove duplicate edges from an edge sequence

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Union of graphs

Constructor modifier to add graph attributes

Similarity measures of two vertices

Igraph data structure versions

Helper function for adding and deleting vertices

Writing the graph to a file in some format

with_igraph_opt

Run code with a temporary igraph options setting

Tails of the edge(s) in a graph

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Set one or more vertex attributes

Pie charts as vertices

Using pie charts as vertices in graph plots

Constructor modifier to add vertex attributes

Construtor modifier to remove all attributes from a graph

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

Declare a numeric vector as a membership vector

canonical_permutation

Canonical permutation of a graph