Learn R Programming

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

igraph (version 1.2.2)

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

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

July 27th, 2018

Functions in igraph (1.2.2)

The igraph package

Conversion to igraph

bipartite_mapping

Decide whether a graph is bipartite

Edges of a graph

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Are two vertices adjacent?

bipartite_projection

Project a bipartite graph

Vertices of a graph

Convert a graph to an edge list

Convert a vertex or edge sequence to an ordinary vector

Convert igraph graphs to graphNEL objects from the graph package

Concatenate edge sequences

Concatenate vertex sequences

as_incidence_matrix

Incidence matrix of a bipartite graph

Breadth-first search

biconnected_components

Biconnected components

Assortativity coefficient

canonical_permutation

Canonical permutation of a graph

Centralize a graph according to the eigenvector centrality of vertices

centr_eigen_tmax

Theoretical maximum for betweenness centralization

cluster_louvain

Finding community structure by multi-level optimization of modularity

Convex hull of a set of vertices

cluster_optimal

Optimal community structure

K-core decomposition of graphs

categorical_pal

Palette for categories

Complementer of a graph

authority_score

Kleinberg's authority centrality scores.

Component-wise layout

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

arpack_defaults

ARPACK eigenvector calculation

Delete edges from a graph

articulation_points

Articulation points of a graph

all_simple_paths

List all simple paths from one source

delete_graph_attr

Delete a graph attribute

Centralize a graph according to the betweenness of vertices

Centralization of a graph

Create a consensus tree from several hierarchical random graph models

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

The igraph console

Difference of two sets

Eccentricity of the vertices in a graph

difference.igraph

Difference of graphs

centr_betw_tmax

Theoretical maximum for betweenness centralization

Helper function for adding and deleting edges

cluster_label_prop

Finding communities based on propagating labels

count_subgraph_isomorphisms

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

count_triangles

Find triangles in graphs

Set one or more edge attributes

Query edge attributes of a graph

Fitting a power-law distribution function to discrete data

cluster_leading_eigen

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

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

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

graph_from_atlas

Create a graph from the Graph Atlas

Creating igraph graphs from data frames or vice-versa

cluster_spinglass

Finding communities in graphs based on statistical meachanics

delete_vertex_attr

Delete a vertex attribute

Add layout to graph

delete_vertices

Delete vertices from a graph

Igraph data structure versions

Add vertices to a graph

Dimensionality selection for singular values using profile likelihood.

cluster_walktrap

Community strucure via short random walks

as_long_data_frame

Convert a graph to a long data frame

Graphlet decomposition of a graph

Adjacency lists

component_distribution

Connected components of a graph

Fit a hierarchical random graph model

Disjoint union of graphs

Declare a numeric vector as a membership vector

Convert object to a graph

as_adjacency_matrix

Convert a graph to an adjacency matrix

Compose two graphs as binary relations

Number of automorphisms

Create an igraph graph from a hierarchical random graph model

edge_attr_names

List names of edge attributes

Kleinberg's hub centrality scores.

Set all or some graph attributes

Centralize a graph according to the closeness of vertices

edge_connectivity

Edge connectivity.

estimate_betweenness

Vertex and edge betweenness centrality

Optimal edge curvature when plotting graphs

graph_from_literal

Creating (small) graphs via a simple interface

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-indexing2

Select vertices and show their metadata

Decompose a graph into components

intersection.igraph.vs

Intersection of vertex sequences

difference.igraph.vs

Difference of vertex sequences

difference.igraph.es

Difference of edge sequences

Is this object an igraph graph?

Chordality of a graph

is_min_separator

Minumal vertex separators

graph_from_isomorphism_class

Create a graph from an isomorphism class

Calculate all isomorphic mappings between the vertices of two graphs

Theoretical maximum for closeness centralization

Independent vertex sets

cluster_fast_greedy

Community structure via greedy optimization of modularity

Get the id of a graph

layout_on_sphere

Graph layout with vertices on the surface of a sphere

Creating a graph from LCF notation

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

identical_graphs

Decide if two graphs are identical

Centralize a graph according to the degrees of vertices

cluster_infomap

Infomap community finding

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Incident vertices of some graph edges

Hierarchical random graphs

centr_degree_tmax

Theoretical maximum for degree centralization

graph_from_adj_list

Create graphs from adjacency lists

layout_randomly

Randomly place vertices on a plane or in 3d space

The Davidson-Harel layout algorithm

Closeness centrality of vertices

Functions to deal with the result of network community detection

graph_from_adjacency_matrix

Create graphs from adjacency matrices

Compares community structures using various metrics

count_isomorphisms

Count the number of isomorphic mappings between two graphs

Delete vertices or edges from a graph

Create a hierarchical random graph from an igraph graph

layout_with_drl

The DrL graph layout generator

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

Make a new graph

Degree and degree distribution of the vertices

Run igraph demos, step by step

Run package tests

Getting and setting graph attributes, shortcut

delete_edge_attr

Delete an edge attribute

Cocitation coupling

cluster_edge_betweenness

Community structure detection based on edge betweenness

Depth-first search

Query igraph's version string

cohesive_blocks

Calculate Cohesive Blocks

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

Burt's constraint

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

Create a bipartite graph

Parameters for the igraph package

Directed acyclic graphs

Indent a printout

Intersection of two or more sets

Create tree graphs

Diameter of a graph

Minimum spanning tree

Neighboring (adjacent) vertices in a graph

Dyad census of a graph

intersection.igraph

Intersection of graphs

Contract several vertices into a single one

Normalize layout

is_printer_callback

Is this a printer callback?

The Page Rank algorithm

layout_with_lgl

Large Graph Layout

layout_with_mds

Graph layout by multidimensional scaling

print.igraph.es

Print an edge sequence to the screen

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

print.igraph.vs

Show a vertex sequence on the screen

Diverging palette

Shortest (directed or undirected) paths between vertices

Graph rewiring while preserving the degree distribution

make_chordal_ring

Create an extended chordal ring graph

Average nearest neighbor degree

intersection.igraph.es

Intersection of edge sequences

Creates a communities object.

Choose an appropriate graph layout algorithm automatically

make_line_graph

Line graph of a graph

Decide if two graphs are isomorphic

Create a ring graph

isomorphism_class

Isomorphism class of a graph

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

Simple grid layout

modularity.igraph

Modularity of a community structure of a graph

The Fruchterman-Reingold layout algorithm

Graph diversity

make_full_bipartite_graph

Create a full bipartite graph

layout_with_gem

The GEM layout algorithm

Random graphs from vertex fitness scores

plot_dendrogram

Community structure dendrogram plots

plot_dendrogram.igraphHRG

HRG dendrogram plot

printer_callback

Create a printer callback function

Growing random graph generation

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

layout_as_bipartite

Simple two-row layout for bipartite graphs

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

Better printing of R packages

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Neighborhood of graph vertices

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Girth of a graph

Random walk on a graph

Graph attributes of a graph

Reading foreign file formats

make_kautz_graph

sample_correlated_gnp_pair

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

Create a lattice graph

Generate random graphs with a given degree sequence

make_full_citation_graph

Create a complete (full) citation graph

Minimum cut in a graph

Order (number of vertices) of a graph

Merging graph layouts

graph_attr_names

List names of graph attributes

sample_smallworld

The Watts-Strogatz small-world model

Plotting of graphs

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Plotting the results on multiple SIR model runs

graph_from_incidence_matrix

Create graphs from an incidence matrix

graph_from_edgelist

Create a graph from an edge list matrix

Generate an evolving random graph with preferential attachment and aging

graph_from_graphdb

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

Head of the edge(s) in a graph

Groups of a vertex partitioning

Trait-based random generation

The size of the graph (number of edges)

max_cardinality

Maximum cardinality search

Print the only the head of an R object

Scan statistics on a time series of graphs

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

SIR model on graphs

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Spectral Coarse Graining

Incident edges of a vertex in a graph

Eigenvalues and eigenvectors of the adjacency matrix of a graph

igraph-es-indexing2

Select edges and show their metadata

igraph-es-indexing

Indexing edge sequences

Tails of the edge(s) in a graph

union.igraph.es

Union of edge sequences

Vertex separators

Various vertex shapes when plotting igraph graphs

Incident edges of multiple vertices in a graph

Add vertices, edges or another graph to a graph

Check whether a graph is directed

Similarity measures of two vertices

Union of two or more sets

Is a degree sequence graphical?

laplacian_matrix

Graph Laplacian

Maximum flow in a graph

Union of graphs

union.igraph.vs

Union of vertex sequences

Weighted graphs

vertex_connectivity

Vertex connectivity.

Query vertex attributes of a graph

SVD layout, this was removed from igraph

layout.reingold.tilford

Deprecated layout functions

layout_with_graphopt

The graphopt layout algorithm

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

vertex_attr_names

List names of vertex attributes

Constructor modifier to drop loop edges

print.nexusDatasetInfo

Query and download from the Nexus network repository

without_multiples

Constructor modifier to drop multiple edges

Constructor modifier to add edge attributes

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Helper function to add or delete edges along a path

Normalize coordinates for plotting graphs

Spring layout, this was removed from igraph

The default R palette

Permute the vertices of a graph

Radius of a graph

sample_dirichlet

Sample from a Dirichlet distribution

sample_dot_product

Generate random graphs according to the random dot product graph model

The Reingold-Tilford graph layout algorithm

sample_k_regular

Create a random regular graph

layout_in_circle

Graph layout with vertices on a circle.

print.igraphHRG

Print a hierarchical random graph model to the screen

layout_with_sugiyama

The Sugiyama graph layout generator

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

Compute local scan statistics on graphs

Reciprocity of graphs

Replicate a graph multiple times

sample_last_cit

Random citation graphs

The Kamada-Kawai layout algorithm

make_de_bruijn_graph

De Bruijn graphs

make_empty_graph

A graph with no edges

make_full_graph

Create a full graph

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

Match Graphs given a seeding of vertex correspondences

sample_bipartite

Bipartite random graphs

Predict edges based on a hierarchical random graph model

Sample stochastic block model

sample_correlated_gnp

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

Sample from a hierarchical random graph model

Sampling a random integer sequence

A graph with subgraphs that are each a random graph.

Error of the spectral coarse graining (SCG) approximation

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

Minimum size vertex separators

Print graphs to the terminal

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

Rewiring edges of a graph

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

subgraph_centrality

Find subgraph centrality scores of network positions

3D plotting of graphs with OpenGL

Topological sorting of vertices in a graph

min_st_separators

Minimum size vertex separators

Transitivity of a graph

unique.igraph.es

Remove duplicate edges from an edge sequence

Running mean of a time series

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Sequential palette

sample_traits_callaway

Graph generation based on different vertex types

Set edge attributes

Writing the graph to a file in some format

Sample from a random graph model

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

Magrittr's pipes

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

Geometric random graphs

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

Query and manipulate a graph as it were an adjacency matrix

Query and manipulate a graph as it were an adjacency list

Experimental basic igraph GUI

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

Reverse the order in an edge sequence

Set a graph attribute

sample_forestfire

Forest Fire Network Model

Reverse the order in a vertex sequence

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

Interactive plotting of graphs

SCG Problem Solver

set_vertex_attr

Set vertex attributes

Semi-Projectors

Constructor modifier to drop multiple and loop edges

split_join_distance

Split-join distance of two community structures

In- or out- component of a vertex

Subgraph of a graph

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

Igraph data structure versions

Constructor modifier to add vertex attributes

Helper function for adding and deleting vertices

stochastic_matrix

Stochastic matrix of a graph

Construtor modifier to remove all attributes from a graph

Strength or weighted vertex degree

Triad census, subgraphs with three vertices

Convert a general graph into a forest

Pie charts as vertices

Using pie charts as vertices in graph plots

Set one or more vertex attributes

Constructor modifier to add graph attributes

with_igraph_opt

Run code with a temporary igraph options setting

Convert between directed and undirected graphs

Add edges to a graph