Learn R Programming

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

igraph (version 1.0.0)

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

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

June 24th, 2015

Functions in igraph (1.0.0)

Number of automorphisms

delete_graph_attr

Delete a graph attribute

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

as_adjacency_matrix

Convert a graph to an adjacency matrix

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

graph_from_adj_list

Create graphs from adjacency lists

Burt's constraint

Convert a vertex or edge sequence to an ordinary vector

K-core decomposition of graphs

cluster_label_prop

Finding communities based on propagating labels

Graphlet decomposition of a graph

cluster_walktrap

Community strucure via short random walks

Depth-first search

Concatenate edge sequences

Reading foreign file formats

igraph-es-indexing

Indexing edge sequences

Component-wise layout

Is a degree sequence graphical?

Reverse the order in an edge sequence

make_de_bruijn_graph

De Bruijn graphs

Breadth-first search

igraph-vs-indexing2

Select vertices and show their metadata

intersection.igraph

Intersection of graphs

Graph Clustering Using SVT and NMF -- Clusters Implied by Singular Value Thresholding

graph_from_incidence_matrix

Create graphs from an incidence matrix

Generate an evolving random graph with preferential attachment and aging

sample_traits_callaway

Graph generation based on different vertex types

graph_from_literal

Creating (small) graphs via a simple interface

Chordality of a graph

Independent vertex sets

Run package tests

laplacian_matrix

Graph Laplacian

Simple grid layout

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

layout_with_gem

The GEM layout algorithm

The Kamada-Kawai layout algorithm

Various vertex shapes when plotting igraph graphs

Merging graph layouts

Add layout to graph

Experimental basic igraph GUI

Convert between directed and undirected graphs

vertex_connectivity

Vertex connectivity.

Print graphs to the terminal

layout_randomly

Randomly place vertices on a plane or in 3d space

alpha_centrality

Find Bonacich alpha centrality scores of network positions

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Plotting the results on multiple SIR model runs

sample_smallworld

The Watts-Strogatz small-world model

cluster_fast_greedy

Community structure via greedy optimization of modularity

Conversion to igraph

Add vertices to a graph

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

as_incidence_matrix

Incidence matrix of a bipartite graph

SIR model on graphs

delete_vertex_attr

Delete a vertex attribute

authority_score

Kleinberg's authority centrality scores.

difference.igraph

Difference of graphs

Delete edges from a graph

Constructor modifier to drop loop edges

Trait-based random generation

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Growing random graph generation

igraph-es-indexing2

Select edges and show their metadata

Centralize a graph according to the betweenness of vertices

Functions to deal with the result of network community detection

canonical_permutation

Canonical permutation of a graph

plot_dendrogram.igraphHRG

HRG dendrogram plot

Set all or some graph attributes

split_join_distance

Split-join distance of two community structures

delete_vertices

Delete vertices from a graph

Adjacency lists

component_distribution

Connected components of a graph

articulation_points

Articulation points of a graph

Set one or more edge attributes

Create a hierarchical random graph from an igraph graph

Convert a graph to an edge list

Convert object to a graph

union.igraph.vs

Union of vertex sequences

Creates a communities object.

Delete vertices or edges from a graph

igraph-vs-indexing

Indexing vertex sequences

Dimensionality selection for singular values using profile likelihood.

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

Create an igraph graph from a hierarchical random graph model

Girth of a graph

Add vertices, edges or another graph to a graph

print.igraph.vs

Show a vertex sequence on the screen

Declare a numeric vector as a membership vector

Choose an appropriate graph layout algorithm automatically

Assortativity coefficient

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

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Edges of a graph

Sampling a random integer sequence

layout_with_drl

The DrL graph layout generator

Head of the edge(s) in a graph

difference.igraph.vs

Difference of vertex sequences

Helper function for adding and deleting edges

layout_in_circle

Graph layout with vertices on a circle.

The igraph package

The size of the graph (number of edges)

Spring layout, this was removed from igraph

identical_graphs

Decide if two graphs are identical

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Intersection of two or more sets

Maximum flow in a graph

Graph rewiring while preserving the degree distribution

SVD layout, this was removed from igraph

A graph with subgraphs that are each a random graph.

Centralize a graph according to the closeness of vertices

Create a bipartite graph

Create tree graphs

vertex_attr_names

List names of vertex attributes

Compares community structures using various metrics

Centralization of a graph

make_line_graph

Line graph of a graph

Permute the vertices of a graph

centr_degree_tmax

Theoretical maximum for degree centralization

layout_on_sphere

Graph layout with vertices on the surface of a sphere

Create a consensus tree from several hierarchical random graph models

layout_with_graphopt

The graphopt layout algorithm

Vertex separators

edge_connectivity

Edge connectivity.

Union of two or more sets

graph_from_edgelist

Create a graph from an edge list matrix

Incident edges of a vertex in a graph

Make a new graph

Plotting of graphs

isomorphism_class

Isomorphism class of a graph

make_kautz_graph

Eccentricity of the vertices in a graph

Average nearest neighbor degree

Concatenate vertex sequences

Reverse the order in a vertex sequence

Normalize coordinates for plotting graphs

min_st_separators

Minimum size vertex separators

Helper function to add or delete edges along a path

sample_k_regular

Create a random regular graph

print.igraph.es

Print an edge sequence to the screen

Geometric random graphs

Rewiring edges of a graph

Query edge attributes of a graph

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

Dyad census of a graph

biconnected_components

Biconnected components

Neighborhood of graph vertices

sample_correlated_gnp_pair

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

Scan statistics on a time series of graphs

Sample stochastic block model

Random graphs from vertex fitness scores

edge_attr_names

List names of edge attributes

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

Graph diversity

Check whether a graph is directed

Similarity measures of two vertices

Calculate all isomorphic mappings between the vertices of two graphs

Decide if two graphs are isomorphic

Igraph data structure versions

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Subgraph of a graph

Topological sorting of vertices in a graph

Interactive plotting of graphs

union.igraph.es

Union of edge sequences

intersection.igraph.es

Intersection of edge sequences

Convert a general graph into a forest

Set one or more vertex attributes

Create a lattice graph

Are two vertices adjacent?

Is this object an igraph graph?

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Helper function for adding and deleting vertices

Find the multiple or loop edges in a graph

Semi-Projectors

Construtor modifier to remove all attributes from a graph

arpack_defaults

ARPACK eigenvector calculation

Transitivity of a graph

Constructor modifier to add graph attributes

without_multiples

Constructor modifier to drop multiple edges

make_chordal_ring

Create an extended chordal ring graph

Igraph data structure versions

Query vertex attributes of a graph

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

Find mutual edges in a directed graph

Vertices of a graph

layout_with_sugiyama

The Sugiyama graph layout generator

estimate_betweenness

Vertex and edge betweenness centrality

The Page Rank algorithm

Minimum size vertex separators

Generate random graphs with a given degree sequence

The default R palette

Predict edges based on a hierarchical random graph model

Sequential palette

bipartite_projection

Project a bipartite graph

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

Minimum spanning tree

Compute local scan statistics on graphs

intersection.igraph.vs

Intersection of vertex sequences

sample_correlated_gnp

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

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

sample_dirichlet

Sample from a Dirichlet distribution

Query and manipulate a graph as it were an adjacency list

categorical_pal

Palette for categories

Spectral Coarse Graining

layout_with_mds

Graph layout by multidimensional scaling

Theoretical maximum for closeness centralization

cluster_leading_eigen

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

In- or out- component of a vertex

Compose two graphs as binary relations

Magrittr's pipes

Writing the graph to a file in some format

print.igraphHRG

Print a hierarchical random graph model to the screen

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

sample_last_cit

Random citation graphs

Random walk on a graph

Tails of the edge(s) in a graph

unique.igraph.es

Remove duplicate edges from an edge sequence

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Fit a hierarchical random graph model

graph_from_adjacency_matrix

Create graphs from adjacency matrices

Pie charts as vertices

Using pie charts as vertices in graph plots

make_full_graph

Create a full graph

Creating a graph from LCF notation

Match Graphs given a seeding of vertex correspondences

Normalize layout

cluster_spinglass

Finding communities in graphs based on statistical meachanics

cluster_optimal

Optimal community structure

print.nexusDatasetInfo

Query and download from the Nexus network repository

Reciprocity of graphs

centr_betw_tmax

Theoretical maximum for betweenness centralization

SCG Problem Solver

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

Closeness centrality of vertices

sample_dot_product

Generate random graphs according to the random dot product graph model

Decompose a graph into components

difference.igraph.es

Difference of edge sequences

Graph Clustering Using NMF (and no SVT) -- Apparent Clusters

Parameters for the igraph package

Set a graph attribute

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Getting and setting graph attributes, shortcut

The Reingold-Tilford graph layout algorithm

layout_with_lgl

Large Graph Layout

Replicate a graph multiple times

Sample from a random graph model

3D plotting of graphs with OpenGL

Constructor modifier to add edge attributes

all_simple_paths

List all simple paths from one source

count_subgraph_isomorphisms

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

Disjoint union of graphs

Fitting a power-law distribution function to discrete data

Compute AIC based on a Poisson Approximation using the output from gclust

Groups of a vertex partitioning

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

max_cardinality

Maximum cardinality search

Neighboring (adjacent) vertices in a graph

Error of the spectral coarse graining (SCG) approximation

Strength or weighted vertex degree

Add edges to a graph

Complementer of a graph

Convex hull of a set of vertices

Degree and degree distribution of the vertices

delete_edge_attr

Delete an edge attribute

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

Centralize a graph according to the eigenvector centrality of vertices

Diameter of a graph

Incident vertices of some graph edges

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

cluster_infomap

Infomap community finding

Graph attributes of a graph

cluster_louvain

Finding community structure by multi-level optimization of modularity

cohesive_blocks

Calculate Cohesive Blocks

graph_attr_names

List names of graph attributes

bipartite_mapping

Decide whether a graph is bipartite

Contract several vertices into a single one

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Cocitation coupling

count_triangles

Find triangles in graphs

graph_from_atlas

Create a graph from the Graph Atlas

Run igraph demos, step by step

Query igraph's version string

graph_from_graphdb

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

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

plot_dendrogram

Community structure dendrogram plots

Radius of a graph

Optimal edge curvature when plotting graphs

Diverging palette

layout_as_bipartite

Simple two-row layout for bipartite graphs

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

Sample from a hierarchical random graph model

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

Order (number of vertices) of a graph

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

Weighted graphs

Set edge attributes

Running mean of a time series

make_full_citation_graph

Create a complete (full) citation graph

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

make_empty_graph

A graph with no edges

as_long_data_frame

Convert a graph to a long data frame

make_full_bipartite_graph

Create a full bipartite graph

set_vertex_attr

Set vertex attributes

Convert igraph graphs to graphNEL objects from the graph package

Centralize a graph according to the degrees of vertices

stochastic_matrix

Stochastic matrix of a graph

The igraph console

count_isomorphisms

Count the number of isomorphic mappings between two graphs

Difference of two sets

Shortest (directed or undirected) paths between vertices

Hierarchical random graphs

Kleinberg's hub centrality scores.

is_min_separator

Minumal vertex separators

Create a ring graph

The Fruchterman-Reingold layout algorithm

modularity.igraph

Modularity of a community structure of a graph

sample_forestfire

Forest Fire Network Model

Constructor modifier to drop multiple and loop edges

Query and manipulate a graph as it were an adjacency matrix

subgraph_centrality

Find subgraph centrality scores of network positions

Constructor modifier to add vertex attributes

cluster_edge_betweenness

Community structure detection based on edge betweenness

Creating igraph graphs from data frames or vice-versa

graph_from_isomorphism_class

Create a graph from an isomorphism class

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Incident edges of multiple vertices in a graph

Directed acyclic graphs

layout.reingold.tilford

Deprecated layout functions

The Davidson-Harel layout algorithm

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

sample_bipartite

Bipartite random graphs

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

Minimum cut in a graph

Triad census, subgraphs with three vertices

Union of graphs

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