Learn R Programming

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

igraph (version 1.2.1)

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

License

GPL (>= 2)

Maintainer

Gabor Csardi

Last Published

March 10th, 2018

Functions in igraph (1.2.1)

as_adjacency_matrix

Convert a graph to an adjacency matrix

Breadth-first search

as_long_data_frame

Convert a graph to a long data frame

Centralize a graph according to the degrees of vertices

centr_degree_tmax

Theoretical maximum for degree centralization

Centralize a graph according to the eigenvector centrality of vertices

count_isomorphisms

Count the number of isomorphic mappings between two graphs

categorical_pal

Palette for categories

centr_eigen_tmax

Theoretical maximum for betweenness centralization

bipartite_mapping

Decide whether a graph is bipartite

cluster_fast_greedy

Community structure via greedy optimization of modularity

cluster_infomap

Infomap community finding

cluster_optimal

Optimal community structure

biconnected_components

Biconnected components

canonical_permutation

Canonical permutation of a graph

bipartite_projection

Project a bipartite graph

cluster_walktrap

Community strucure via short random walks

cluster_louvain

Finding community structure by multi-level optimization of modularity

cluster_spinglass

Finding communities in graphs based on statistical meachanics

Burt's constraint

as_incidence_matrix

Incidence matrix of a bipartite graph

estimate_betweenness

Vertex and edge betweenness centrality

Concatenate edge sequences

Centralize a graph according to the closeness of vertices

Concatenate vertex sequences

Assortativity coefficient

Centralization of a graph

Number of automorphisms

Declare a numeric vector as a membership vector

Contract several vertices into a single one

count_subgraph_isomorphisms

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

Theoretical maximum for closeness centralization

Difference of two sets

Eccentricity of the vertices in a graph

cluster_label_prop

Finding communities based on propagating labels

cluster_leading_eigen

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

Complementer of a graph

count_triangles

Find triangles in graphs

difference.igraph

Difference of graphs

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

Component-wise layout

authority_score

Kleinberg's authority centrality scores.

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

Helper function for adding and deleting edges

Fitting a power-law distribution function to discrete data

Centralize a graph according to the betweenness of vertices

Cocitation coupling

centr_betw_tmax

Theoretical maximum for betweenness centralization

component_distribution

Connected components of a graph

Create a consensus tree from several hierarchical random graph models

Closeness centrality of vertices

cohesive_blocks

Calculate Cohesive Blocks

cluster_edge_betweenness

Community structure detection based on edge betweenness

Compose two graphs as binary relations

Compares community structures using various metrics

Convert object to a graph

Optimal edge curvature when plotting graphs

Convex hull of a set of vertices

Functions to deal with the result of network community detection

The igraph console

delete_vertex_attr

Delete a vertex attribute

Delete edges from a graph

delete_graph_attr

Delete a graph attribute

K-core decomposition of graphs

Depth-first search

Set all or some graph attributes

delete_vertices

Delete vertices from a graph

Degree and degree distribution of the vertices

Igraph data structure versions

Graphlet decomposition of a graph

identical_graphs

Decide if two graphs are identical

Decompose a graph into components

Shortest (directed or undirected) paths between vertices

delete_edge_attr

Delete an edge attribute

igraph-es-indexing

Indexing edge sequences

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

difference.igraph.es

Difference of edge sequences

Dimensionality selection for singular values using profile likelihood.

edge_attr_names

List names of edge attributes

Diameter of a graph

difference.igraph.vs

Difference of vertex sequences

Diverging palette

Disjoint union of graphs

Set one or more edge attributes

igraph-es-indexing2

Select edges and show their metadata

edge_connectivity

Edge connectivity.

Run package tests

Graph diversity

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

Graph attributes of a graph

Query edge attributes of a graph

graph_attr_names

List names of graph attributes

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Neighborhood of graph vertices

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

graph_from_incidence_matrix

Create graphs from an incidence matrix

Girth of a graph

Order (number of vertices) of a graph

Hierarchical random graphs

Create a hierarchical random graph from an igraph graph

graph_from_edgelist

Create a graph from an edge list matrix

Groups of a vertex partitioning

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Query igraph's version string

graph_from_graphdb

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

The size of the graph (number of edges)

Run igraph demos, step by step

igraph-vs-indexing

Indexing vertex sequences

Fit a hierarchical random graph model

Parameters for the igraph package

Indent a printout

Dyad census of a graph

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

igraph-vs-indexing2

Select vertices and show their metadata

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Incident edges of a vertex in a graph

Intersection of two or more sets

Vertex separators

Check whether a graph is directed

Incident edges of multiple vertices in a graph

Incident vertices of some graph edges

graph_from_adj_list

Create graphs from adjacency lists

Decide if two graphs are isomorphic

graph_from_atlas

Create a graph from the Graph Atlas

Weighted graphs

Is a degree sequence graphical?

graph_from_isomorphism_class

Create a graph from an isomorphism class

Calculate all isomorphic mappings between the vertices of two graphs

graph_from_adjacency_matrix

Create graphs from adjacency matrices

isomorphism_class

Isomorphism class of a graph

Independent vertex sets

Creating igraph graphs from data frames or vice-versa

The Reingold-Tilford graph layout algorithm

Creating a graph from LCF notation

layout_in_circle

Graph layout with vertices on a circle.

Create an igraph graph from a hierarchical random graph model

SVD layout, this was removed from igraph

The Fruchterman-Reingold layout algorithm

layout_with_gem

The GEM layout algorithm

is_printer_callback

Is this a printer callback?

make_full_graph

Create a full graph

The Davidson-Harel layout algorithm

graph_from_literal

Creating (small) graphs via a simple interface

Get the id of a graph

layout_with_drl

The DrL graph layout generator

Kleinberg's hub centrality scores.

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

Head of the edge(s) in a graph

Match Graphs given a seeding of vertex correspondences

Delete vertices or edges from a graph

make_de_bruijn_graph

De Bruijn graphs

make_empty_graph

A graph with no edges

Graph rewiring while preserving the degree distribution

Getting and setting graph attributes, shortcut

Print the only the head of an R object

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

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

intersection.igraph.vs

Intersection of vertex sequences

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

Magrittr's pipes

modularity.igraph

Modularity of a community structure of a graph

Create tree graphs

Average nearest neighbor degree

intersection.igraph.es

Intersection of edge sequences

intersection.igraph

Intersection of graphs

Directed acyclic graphs

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

layout.reingold.tilford

Deprecated layout functions

laplacian_matrix

Graph Laplacian

print.nexusDatasetInfo

Query and download from the Nexus network repository

Normalize coordinates for plotting graphs

Chordality of a graph

Choose an appropriate graph layout algorithm automatically

Is this object an igraph graph?

printer_callback

Create a printer callback function

layout_on_sphere

Graph layout with vertices on the surface of a sphere

Simple grid layout

layout_randomly

Randomly place vertices on a plane or in 3d space

layout_with_sugiyama

The Sugiyama graph layout generator

layout_with_lgl

Large Graph Layout

layout_with_mds

Graph layout by multidimensional scaling

Better printing of R packages

is_min_separator

Minumal vertex separators

Make a new graph

Create a bipartite graph

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

make_kautz_graph

Create a lattice graph

Plotting of graphs

Plotting the results on multiple SIR model runs

Rewiring edges of a graph

Compute local scan statistics on graphs

make_chordal_ring

Create an extended chordal ring graph

3D plotting of graphs with OpenGL

sample_bipartite

Bipartite random graphs

Creates a communities object.

Minimum cut in a graph

Merging graph layouts

print.igraphHRG

Print a hierarchical random graph model to the screen

make_line_graph

Line graph of a graph

Create a ring graph

Spring layout, this was removed from igraph

Helper function to add or delete edges along a path

Minimum size vertex separators

layout_as_bipartite

Simple two-row layout for bipartite graphs

Permute the vertices of a graph

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

Add vertices, edges or another graph to a graph

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

Reverse the order in an edge sequence

Reverse the order in a vertex sequence

layout_with_graphopt

The graphopt layout algorithm

sample_correlated_gnp_pair

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

sample_correlated_gnp

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

The Kamada-Kawai layout algorithm

Generate random graphs with a given degree sequence

make_full_bipartite_graph

Create a full bipartite graph

make_full_citation_graph

Create a complete (full) citation graph

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

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

Semi-Projectors

max_cardinality

Maximum cardinality search

split_join_distance

Split-join distance of two community structures

SCG Problem Solver

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

sample_forestfire

Forest Fire Network Model

sample_smallworld

The Watts-Strogatz small-world model

Maximum flow in a graph

Minimum spanning tree

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

Sample from a hierarchical random graph model

subgraph_centrality

Find subgraph centrality scores of network positions

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

Random walk on a graph

Topological sorting of vertices in a graph

Transitivity of a graph

min_st_separators

Minimum size vertex separators

Reading foreign file formats

Normalize layout

Neighboring (adjacent) vertices in a graph

Running mean of a time series

Sample from a random graph model

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

A graph with subgraphs that are each a random graph.

Predict edges based on a hierarchical random graph model

Print graphs to the terminal

The Page Rank algorithm

sample_traits_callaway

Graph generation based on different vertex types

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

unique.igraph.es

Remove duplicate edges from an edge sequence

Sequential palette

Geometric random graphs

Generate an evolving random graph with preferential attachment and aging

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Reciprocity of graphs

Trait-based random generation

Scan statistics on a time series of graphs

Replicate a graph multiple times

Spectral Coarse Graining

sample_dirichlet

Sample from a Dirichlet distribution

plot_dendrogram

Community structure dendrogram plots

Writing the graph to a file in some format

Set edge attributes

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

print.igraph.es

Print an edge sequence to the screen

plot_dendrogram.igraphHRG

HRG dendrogram plot

print.igraph.vs

Show a vertex sequence on the screen

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

Constructor modifier to drop multiple and loop edges

The default R palette

sample_dot_product

Generate random graphs according to the random dot product graph model

Radius of a graph

stochastic_matrix

Stochastic matrix of a graph

sample_k_regular

Create a random regular graph

Random graphs from vertex fitness scores

In- or out- component of a vertex

sample_last_cit

Random citation graphs

Strength or weighted vertex degree

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

Sample stochastic block model

Sampling a random integer sequence

Triad census, subgraphs with three vertices

Convert a general graph into a forest

Growing random graph generation

vertex_connectivity

Vertex connectivity.

Error of the spectral coarse graining (SCG) approximation

Subgraph of a graph

Union of two or more sets

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

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

Constructor modifier to add edge attributes

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Union of graphs

SIR model on graphs

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

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

Eigenvalues and eigenvectors of the adjacency matrix 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

Interactive plotting of graphs

Query vertex attributes of a graph

Set a graph attribute

vertex_attr_names

List names of vertex attributes

set_vertex_attr

Set vertex attributes

Various vertex shapes when plotting igraph graphs

Constructor modifier to add vertex attributes

Similarity measures of two vertices

Construtor modifier to remove all attributes from a graph

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

Tails of the edge(s) in a graph

union.igraph.es

Union of edge sequences

union.igraph.vs

Union of vertex sequences

Igraph data structure versions

Helper function for adding and deleting vertices

without_multiples

Constructor modifier to drop multiple edges

Constructor modifier to drop loop edges

Add vertices to a graph

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

Add layout to graph

all_simple_paths

List all simple paths from one source

Add edges to a graph

The igraph package

Are two vertices adjacent?

Convert igraph graphs to graphNEL objects from the graph package

Edges of a graph

Convert a vertex or edge sequence to an ordinary vector

Convert a graph to an edge list

Convert between directed and undirected graphs

alpha_centrality

Find Bonacich alpha centrality scores of network positions

articulation_points

Articulation points of a graph

Adjacency lists

arpack_defaults

ARPACK eigenvector calculation

Vertices of a graph

Conversion to igraph