Learn R Programming

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

igraph (version 1.1.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

473,412

Version

1.1.2

License

GPL (>= 2)

Maintainer

Last Published

July 21st, 2017

Functions in igraph (1.1.2)

adjacent_vertices

Adjacent vertices of multiple vertices in a graph

all_simple_paths

List all simple paths from one source

alpha_centrality

Find Bonacich alpha centrality scores of network positions

Are two vertices adjacent?

Edges of a graph

Vertices of a graph

The igraph package

Add edges to a graph

Add layout to graph

Add vertices to a graph

Adjacency lists

as_adjacency_matrix

Convert a graph to an adjacency matrix

Assortativity coefficient

arpack_defaults

ARPACK eigenvector calculation

articulation_points

Articulation points of a graph

bipartite_mapping

Decide whether a graph is bipartite

bipartite_projection

Project a bipartite graph

canonical_permutation

Canonical permutation of a graph

categorical_pal

Palette for categories

Centralization of a graph

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

Convert a vertex or edge sequence to an ordinary vector

as_incidence_matrix

Incidence matrix of a bipartite graph

Number of automorphisms

cluster_louvain

Finding community structure by multi-level optimization of modularity

cluster_optimal

Optimal community structure

component_distribution

Connected components of a graph

Compose two graphs as binary relations

Convert between directed and undirected graphs

Conversion to igraph

biconnected_components

Biconnected components

Centralize a graph according to the degrees of vertices

centr_degree_tmax

Theoretical maximum for degree centralization

Closeness centrality of vertices

cluster_edge_betweenness

Community structure detection based on edge betweenness

Breadth-first search

estimate_betweenness

Vertex and edge betweenness centrality

Concatenate edge sequences

Concatenate vertex sequences

cluster_label_prop

Finding communities based on propagating labels

authority_score

Kleinberg's authority centrality scores.

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

cluster_spinglass

Finding communities in graphs based on statistical meachanics

cluster_walktrap

Community strucure via short random walks

Create a consensus tree from several hierarchical random graph models

The igraph console

delete_vertex_attr

Delete a vertex attribute

delete_vertices

Delete vertices from a graph

Shortest (directed or undirected) paths between vertices

Diverging palette

cluster_infomap

Infomap community finding

Complementer of a graph

Component-wise layout

count_isomorphisms

Count the number of isomorphic mappings between two graphs

Optimal edge curvature when plotting graphs

Decompose a graph into components

Dimensionality selection for singular values using profile likelihood.

Disjoint union of graphs

Delete edges from a graph

delete_graph_attr

Delete a graph attribute

Depth-first search

Diameter of a graph

Set one or more edge attributes

Query edge attributes of a graph

Neighborhood of graph vertices

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

Girth of a graph

graph_from_adjacency_matrix

Create graphs from adjacency matrices

cluster_leading_eigen

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

Cocitation coupling

cohesive_blocks

Calculate Cohesive Blocks

Burt's constraint

graph_from_atlas

Create a graph from the Graph Atlas

Create a hierarchical random graph from an igraph graph

Create an igraph graph from a hierarchical random graph model

Kleinberg's hub centrality scores.

identical_graphs

Decide if two graphs are identical

Parameters for the igraph package

Dyad census of a graph

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

embed_laplacian_matrix

Spectral Embedding of the Laplacian of a Graph

Contract several vertices into a single one

Degree and degree distribution of the vertices

delete_edge_attr

Delete an edge attribute

Incident vertices of some graph edges

Set all or some graph attributes

Graph attributes of a graph

Creating a graph from LCF notation

Run package tests

Is a degree sequence graphical?

Is this object an igraph graph?

Weighted graphs

Graph diversity

eigen_centrality

Find Eigenvector Centrality Scores of Network Positions

embed_adjacency_matrix

Spectral Embedding of Adjacency Matrices

Convert a graph to an edge list

Convert igraph graphs to graphNEL objects from the graph package

as_long_data_frame

Convert a graph to a long data frame

Declare a numeric vector as a membership vector

graph_from_literal

Creating (small) graphs via a simple interface

The size of the graph (number of edges)

Head of the edge(s) in a graph

igraph-es-indexing2

Select edges and show their metadata

Delete vertices or edges from a graph

Query igraph's version string

Incident edges of a vertex in a graph

intersection.igraph.es

Intersection of edge sequences

intersection.igraph.vs

Intersection of vertex sequences

Centralize a graph according to the closeness of vertices

Theoretical maximum for closeness centralization

Centralize a graph according to the eigenvector centrality of vertices

centr_eigen_tmax

Theoretical maximum for betweenness centralization

Functions to deal with the result of network community detection

Compares community structures using various metrics

Convex hull of a set of vertices

K-core decomposition of graphs

difference.igraph.es

Difference of edge sequences

difference.igraph.vs

Difference of vertex sequences

edge_attr_names

List names of edge attributes

count_subgraph_isomorphisms

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

count_triangles

Find triangles in graphs

Difference of two sets

difference.igraph

Difference of graphs

Decide if two graphs are isomorphic

layout.reingold.tilford

Deprecated layout functions

layout_with_gem

The GEM layout algorithm

isomorphism_class

Isomorphism class of a graph

Calculate all isomorphic mappings between the vertices of two graphs

graph_attr_names

List names of graph attributes

graph_from_adj_list

Create graphs from adjacency lists

Creating igraph graphs from data frames or vice-versa

graph_from_edgelist

Create a graph from an edge list matrix

Get the id of a graph

layout.fruchterman.reingold.grid

Grid Fruchterman-Reingold layout, this was removed from igraph

layout_as_bipartite

Simple two-row layout for bipartite graphs

Simple grid layout

layout_on_sphere

Graph layout with vertices on the surface of a sphere

layout_with_mds

Graph layout by multidimensional scaling

Igraph data structure versions

igraph-vs-attributes

Query or set attributes of the vertices in a vertex sequence

igraph-vs-indexing

Indexing vertex sequences

igraph-vs-indexing2

Select vertices and show their metadata

Run igraph demos, step by step

Chordality of a graph

Directed acyclic graphs

Independent vertex sets

Graph rewiring while preserving the degree distribution

layout_in_circle

Graph layout with vertices on a circle.

Choose an appropriate graph layout algorithm automatically

The Kamada-Kawai layout algorithm

layout_with_graphopt

The graphopt layout algorithm

Creates a communities object.

make_de_bruijn_graph

De Bruijn graphs

Create tree graphs

Match Graphs given a seeding of vertex correspondences

Minimum spanning tree

layout_with_sugiyama

The Sugiyama graph layout generator

Create a lattice graph

make_line_graph

Line graph of a graph

min_st_separators

Minimum size vertex separators

modularity.igraph

Modularity of a community structure of a graph

Permute the vertices of a graph

Magrittr's pipes

power_centrality

Find Bonacich Power Centrality Scores of Network Positions

layout_with_lgl

Large Graph Layout

Create a bipartite graph

make_chordal_ring

Create an extended chordal ring graph

Create a ring graph

edge_connectivity

Edge connectivity.

Fitting a power-law distribution function to discrete data

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

Plotting of graphs

plot_dendrogram.igraphHRG

HRG dendrogram plot

Add vertices, edges or another graph to a graph

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

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

graph_from_graphdb

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

Predict edges based on a hierarchical random graph model

Replicate a graph multiple times

Reverse the order in an edge sequence

sample_correlated_gnp

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

sample_correlated_gnp_pair

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

graph_from_graphnel

Convert graphNEL objects from the graph package to igraph

Print the only the head of an R object

Hierarchical random graphs

sample_dot_product

Generate random graphs according to the random dot product graph model

Random graphs from vertex fitness scores

Trait-based random generation

Sample stochastic block model

Eccentricity of the vertices in a graph

Helper function for adding and deleting edges

erdos.renyi.game

Generate random graphs according to the Erdos-Renyi model

Fit a hierarchical random graph model

Semi-Projectors

Sequential palette

SIR model on graphs

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

Minimum cut in a graph

Minimum size vertex separators

Normalize coordinates for plotting graphs

Order (number of vertices) of a graph

Convert object to a graph

graph_from_incidence_matrix

Create graphs from an incidence matrix

graph_from_isomorphism_class

Create a graph from an isomorphism class

Graphlet decomposition of a graph

Groups of a vertex partitioning

igraph-es-attributes

Query or set attributes of the edges in an edge sequence

igraph-es-indexing

Indexing edge sequences

igraph-attribute-combination

How igraph functions handle attributes when the graph changes

Getting and setting graph attributes, shortcut

Incident edges of multiple vertices in a graph

Indent a printout

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

Check whether a graph is directed

is_printer_callback

Is this a printer callback?

Vertex separators

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

stochastic_matrix

Stochastic matrix of a graph

Transitivity of a graph

Intersection of two or more sets

intersection.igraph

Intersection of graphs

Average nearest neighbor degree

laplacian_matrix

Graph Laplacian

Spring layout, this was removed from igraph

SVD layout, this was removed from igraph

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

The Reingold-Tilford graph layout algorithm

layout_randomly

Randomly place vertices on a plane or in 3d space

The Davidson-Harel layout algorithm

is_min_separator

Minumal vertex separators

layout_with_drl

The DrL graph layout generator

The Fruchterman-Reingold layout algorithm

make_empty_graph

A graph with no edges

make_full_bipartite_graph

Create a full bipartite graph

Radius of a graph

Random walk on a graph

Reverse the order in a vertex sequence

Rewiring edges of a graph

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

make_kautz_graph

max_cardinality

Maximum cardinality search

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

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

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

Generate an evolving random graph with preferential attachment and aging

sample_sphere_surface

Sample vectors uniformly from the surface of a sphere

sample_sphere_volume

Sample vectors uniformly from the volume of a sphere

Set edge attributes

Normalize layout

Plotting the results on multiple SIR model runs

plot_dendrogram

Community structure dendrogram plots

Reading foreign file formats

Set a graph attribute

Subgraph of a graph

subgraph_centrality

Find subgraph centrality scores of network positions

Convert a general graph into a forest

Triad census, subgraphs with three vertices

Union of graphs

union.igraph.es

Union of edge sequences

Construtor modifier to remove all attributes from a graph

Constructor modifier to drop loop edges

Reciprocity of graphs

Sample from a random graph model

sample_bipartite

Bipartite random graphs

sample_fitness_pl

Scale-free random graphs, from vertex fitness scores

sample_forestfire

Forest Fire Network Model

Union of two or more sets

Set one or more vertex attributes

Query vertex attributes of a graph

Constructor modifier to add edge attributes

Sampling a random integer sequence

sample_smallworld

The Watts-Strogatz small-world model

Error of the spectral coarse graining (SCG) approximation

SCG Problem Solver

The Page Rank algorithm

Helper function to add or delete edges along a path

print.igraph.vs

Show a vertex sequence on the screen

print.igraphHRG

Print a hierarchical random graph model to the screen

Better printing of R packages

The default R palette

Generate random graphs with a given degree sequence

sample_dirichlet

Sample from a Dirichlet distribution

sample_hierarchical_sbm

Sample the hierarchical stochastic block model

Constructor modifier to add graph attributes

set_vertex_attr

Set vertex attributes

Various vertex shapes when plotting igraph graphs

Strength or weighted vertex degree

Query and manipulate a graph as it were an adjacency matrix

Compute local scan statistics on graphs

Make a new graph

make_full_citation_graph

Create a complete (full) citation graph

make_full_graph

Create a full graph

Maximum flow in a graph

Sample from a hierarchical random graph model

sample_last_cit

Random citation graphs

sample_traits_callaway

Graph generation based on different vertex types

Neighboring (adjacent) vertices in a graph

print.nexusDatasetInfo

Query and download from the Nexus network repository

Print graphs to the terminal

print.igraph.es

Print an edge sequence to the screen

Interactive plotting of graphs

Topological sorting of vertices in a graph

unique.igraph.vs

Remove duplicate vertices from a vertex sequence

Igraph data structure versions

Merging graph layouts

print.igraphHRGConsensus

Print a hierarchical random graph consensus tree to the screen

printer_callback

Create a printer callback function

3D plotting of graphs with OpenGL

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

Running mean of a time series

Geometric random graphs

Growing random graph generation

A graph with subgraphs that are each a random graph.

sample_k_regular

Create a random regular graph

Spectral Coarse Graining

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

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Scan statistics on a time series of graphs

Similarity measures of two vertices

Constructor modifier to drop multiple and loop edges

split_join_distance

Split-join distance of two community structures

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

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

Tails of the edge(s) in a graph

Experimental basic igraph GUI

Helper function for adding and deleting vertices

Pie charts as vertices

Using pie charts as vertices in graph plots

with_igraph_opt

Run code with a temporary igraph options setting

Query and manipulate a graph as it were an adjacency list

In- or out- component of a vertex

subgraph_isomorphic

Decide if a graph is subgraph isomorphic to another one

subgraph_isomorphisms

All isomorphic mappings between a graph and subgraphs of another graph

union.igraph.vs

Union of vertex sequences

unique.igraph.es

Remove duplicate edges from an edge sequence

vertex_attr_names

List names of vertex attributes

vertex_connectivity

Vertex connectivity.

without_multiples

Constructor modifier to drop multiple edges

Writing the graph to a file in some format

Constructor modifier to add vertex attributes