igraph2.0.3 package

Network Analysis and Visualization

Chordality of a graph

Connected components of a graph

Directed acyclic graphs

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

Check whether a graph is directed

Is a degree sequence graphical?

Functions to deal with the result of network community detection

Is this object an igraph graph?

Find the multiple or loop edges in a graph

Matching

Matching

Minimal vertex separators

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

Named graphs

Vertex separators

Simple graphs

Weighted graphs

Creating a bipartite graph from two degree sequences, deterministicall...

Creating a graph from a given degree sequence, deterministically

Acyclic graphs

Check biconnectedness

Checks whether the graph has a vertex attribute called `type`

.

Intersection of graphs

Intersection of vertex sequences

The igraph package

Add edges to a graph

Various vertex shapes when plotting igraph graphs

Add vertices to a graph

Intersection of two or more sets

Add edges to a graph

Add layout to graph

Add vertices to a graph

Find triangles in graphs

Adjacent vertices of multiple vertices in a graph

Generate an evolving random graph with preferential attachment and agi...

Checks whether the graph has a vertex attribute called `type`

Generate an evolving random graph with preferential attachment and agi...

Generate an evolving random graph with preferential attachment and agi...

List all simple paths from one source

Find Bonacich alpha centrality scores of network positions

Find Bonacich alpha centrality scores of network positions

Are two vertices adjacent?

Are two vertices adjacent?

ARPACK eigenvector calculation

Articulation points and bridges of a graph

Articulation points and bridges of a graph

Convert between directed and undirected graphs

Conversion to igraph

Convert igraph objects to adjacency or edge list matrices

Adjacency lists

Convert a graph to an adjacency matrix

Bipartite adjacency matrix of a bipartite graph

Convert a graph to an edge list

Convert igraph graphs to graphNEL objects from the graph package

Convert a vertex or edge sequence to an ordinary vector

As incidence matrix

Convert a graph to a long data frame

Declare a numeric vector as a membership vector

as_phylo

Assortativity coefficient

Assortativity coefficient

Assortativity coefficient

Trait-based random generation

Kleinberg's hub and authority centrality scores.

Optimal edge curvature when plotting graphs

Generating set of the automorphism group of a graph

Number of automorphisms

Shortest (directed or undirected) paths between vertices

Generate random graphs using preferential attachment

Generate random graphs using preferential attachment

Vertex and edge betweenness centrality

Breadth-first search

Biconnected components

Biconnected components

Decide whether a graph is bipartite

Project a bipartite graph

Project a bipartite graph

Bipartite random graphs

Decide whether a graph is bipartite

Project a bipartite graph

Calculate Cohesive Blocks

Find Bonacich Power Centrality Scores of Network Positions

Concatenate edge sequences

Concatenate vertex sequences

Graph generation based on different vertex types

Canonical permutation of a graph

Canonical permutation of a graph

Palette for categories

Centralize a graph according to the betweenness of vertices

Theoretical maximum for betweenness centralization

Centralize a graph according to the closeness of vertices

Theoretical maximum for closeness centralization

Centralize a graph according to the degrees of vertices

Theoretical maximum for degree centralization

Centralize a graph according to the eigenvector centrality of vertices

Theoretical maximum for betweenness centralization

Centralize a graph according to the betweenness of vertices

Theoretical maximum for betweenness centralization

Centralize a graph according to the closeness of vertices

Theoretical maximum for closeness centralization

Centralize a graph according to the degrees of vertices

Theoretical maximum for degree centralization

Centralize a graph according to the eigenvector centrality of vertices

Theoretical maximum for betweenness centralization

Centralization of a graph

Centralization of a graph

Random citation graphs

Random citation graphs

Functions to find cliques, i.e. complete subgraphs in a graph

Functions to find cliques, i.e. complete subgraphs in a graph

Closeness centrality of vertices

Connected components of a graph

Community structure detection based on edge betweenness

Community structure via greedy optimization of modularity

Community detection algorithm based on interacting fluids

Infomap community finding

Finding communities based on propagating labels

Community structure detecting based on the leading eigenvector of the ...

Finding community structure of a graph using the Leiden algorithm of T...

Finding community structure by multi-level optimization of modularity

Optimal community structure

Finding communities in graphs based on statistical meachanics

Community structure via short random walks

Connected components of a graph

Cocitation coupling

Functions to deal with the result of network community detection

Calculate Cohesive Blocks

Calculate Cohesive Blocks

Functions to deal with the result of network community detection

Compares community structures using various metrics

Complementer of a graph

Component-wise layout

Connected components of a graph

Compose two graphs as binary relations

Neighborhood of graph vertices

Create a consensus tree from several hierarchical random graph models

The igraph console

Burt's constraint

Contract several vertices into a single one

Contract several vertices into a single one

Convex hull of a set of vertices

Convex hull of a set of vertices

K-core decomposition of graphs

Find the multiple or loop edges in a graph

Number of automorphisms

Count the number of isomorphic mappings between two graphs

Graph motifs

Count the isomorphic mappings between a graph and the subgraphs of ano...

Find triangles in graphs

Creates a communities object.

Optimal edge curvature when plotting graphs

Functions to deal with the result of network community detection

Decompose a graph into components

Decompose a graph into components

Degree and degree distribution of the vertices

Degree and degree distribution of the vertices

Generate random graphs with a given degree sequence

Delete edges from a graph

Delete vertices from a graph

Delete an edge attribute

Delete edges from a graph

Delete a graph attribute

Delete a vertex attribute

Delete vertices from a graph

Community structure dendrogram plots

Depth-first search

Diameter of a graph

Difference of edge sequences

Difference of graphs

Difference of vertex sequences

Difference of two sets

Dimensionality selection for singular values using profile likelihood.

Disjoint union of graphs

Shortest (directed or undirected) paths between vertices

Diverging palette

Graph diversity

Dominator tree

Dominator tree

`.data`

and `.env`

pronouns

Dyad census of a graph

Dyad census of a graph

Edges of a graph

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

Eccentricity of the vertices in a graph

Community structure detection based on edge betweenness

Vertex and edge betweenness centrality

Edge connectivity

Edge connectivity

Helper function for adding and deleting edges

Set one or more edge attributes

Query edge attributes of a graph

List names of edge attributes

Edge connectivity

Graph density

Neighborhood of graph vertices

Find Eigenvector Centrality Scores of Network Positions

Spectral Embedding of Adjacency Matrices

Spectral Embedding of the Laplacian of a Graph

Incident vertices of some graph edges

Generate random graphs according to the ErdÅ‘s-RÃ©nyi model

Graph generation based on different vertex types

Deprecated version of `betweenness()`

Deprecated version of `closeness()`

Deprecated version of `edge_betweenness()`

Find Eigenvector Centrality Scores of Network Positions

Calculate Cohesive Blocks

Diameter of a graph

Community structure via greedy optimization of modularity

Finding a feedback arc set in a graph

Fit a hierarchical random graph model

Fitting a power-law distribution function to discrete data

Forest Fire Network Model

Graph from incidence matrix

Convert a graph to an adjacency matrix

Adjacency lists

Adjacency lists

Shortest (directed or undirected) paths between vertices

Creating igraph graphs from data frames or vice-versa

Diameter of a graph

Query edge attributes of a graph

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

Convert a graph to an edge list

Graph attributes of a graph

Bipartite adjacency matrix of a bipartite graph

Shortest (directed or undirected) paths between vertices

Stochastic matrix of a graph

Query vertex attributes of a graph

Parameters for the igraph package

Girth of a graph

Efficiency of a graph

Order (number of vertices) of a graph

Edge connectivity

Create graphs from adjacency matrices

Create graphs from adjacency lists

Number of automorphisms

Breadth-first search

Vertex connectivity

Complementer of a graph

Compose two graphs as binary relations

K-core decomposition of graphs

Creating igraph graphs from data frames or vice-versa

Graph density

Depth-first search

Difference of two sets

Disjoint union of graphs

Graph diversity

Create a graph from an edge list matrix

Eigenvalues and eigenvectors of the adjacency matrix of a graph

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

Create graphs from a bipartite adjacency matrix

Intersection of two or more sets

Create a graph from an isomorphism class

Average nearest neighbor degree

Graph Laplacian

Maximum flow in a graph

Minimum cut in a graph

Graph motifs

Graph motifs

Graph motifs

Neighborhood of graph vertices

Strength or weighted vertex degree

Union of graphs

Convert object to a graph

Set all or some graph attributes

Graph attributes of a graph

List names of graph attributes

Create graphs from adjacency lists

Create graphs from adjacency matrices

Create a graph from the Graph Atlas

Create graphs from a bipartite adjacency matrix

Creating igraph graphs from data frames or vice-versa

Create a graph from an edge list matrix

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

Convert graphNEL objects from the graph package to igraph

From incidence matrix

Create a graph from an isomorphism class

Creating a graph from LCF notation

Creating (small) graphs via a simple interface

Get the id of a graph

igraph data structure versions

Graphlet decomposition of a graph

Graphlet decomposition of a graph

Graphlet decomposition of a graph

Greedy vertex coloring

Geometric random graphs

Groups of a vertex partitioning

Growing random graph generation

The size of the graph (number of edges)

Common handler for vertex type arguments in igraph functions

Harmonic centrality of vertices

Find the multiple or loop edges in a graph

Find Eulerian paths or cycles in a graph

Head of the edge(s) in a graph

Print the only the head of an R object

Hierarchical random graphs

Create a consensus tree from several hierarchical random graph models

Create a hierarchical random graph from an igraph graph

Create an igraph graph from a hierarchical random graph model

Fit a hierarchical random graph model

Sample from a hierarchical random graph model

Predict edges based on a hierarchical random graph model

Create a hierarchical random graph from an igraph graph

Create an igraph graph from a hierarchical random graph model

Kleinberg's hub and authority centrality scores.

Kleinberg's hub and authority centrality scores.

Decide if two graphs are identical

How igraph functions handle attributes when the graph changes

Getting and setting graph attributes, shortcut

Query or set attributes of the edges in an edge sequence

Indexing edge sequences

Select edges and show their metadata

Delete vertices or edges from a graph

Query or set attributes of the vertices in a vertex sequence

Indexing vertex sequences

Select vertices and show their metadata

The igraph console

Convert graphNEL objects from the graph package to igraph

Parameters for the igraph package

Sampling a random integer sequence

Various vertex shapes when plotting igraph graphs

Various vertex shapes when plotting igraph graphs

Convert igraph graphs to graphNEL objects from the graph package

Query igraph's version string

Run igraph demos, step by step

Parameters for the igraph package

Run package tests

Query igraph's version string

Run igraph demos, step by step

Run package tests

Incident edges of a vertex in a graph

Incident edges of multiple vertices in a graph

Indent a printout

Independent vertex sets

Independent vertex sets

Subgraph of a graph

Infomap community finding

A graph with subgraphs that are each a random graph.

Intersection of edge sequences

Chordality of a graph

Directed acyclic graphs

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

Check whether a graph is directed

Decide whether a graph is a forest.

Is a degree sequence graphical?

Is this object an igraph graph?

Minimal vertex separators

Named graphs

Is this a printer callback?

Vertex separators

Decide whether a graph is a tree.

Weighted graphs

Decide if two graphs are isomorphic

Isomorphism class of a graph

Calculate all isomorphic mappings between the vertices of two graphs

Independent vertex sets

Create a random regular graph

Find the $k$ shortest paths between two vertices

Graph rewiring while preserving the degree distribution

Average nearest neighbor degree

Finding communities based on propagating labels

Graph Laplacian

Functions to find cliques, i.e. complete subgraphs in a graph

Independent vertex sets

Random citation graphs

Choose an appropriate graph layout algorithm automatically

Simple two-row layout for bipartite graphs

The Davidson-Harel layout algorithm

Deprecated layout functions

The DrL graph layout generator

Grid Fruchterman-Reingold layout, this was removed from igraph

The GEM layout algorithm

The graphopt layout algorithm

Simple grid layout

Graph layout by multidimensional scaling

Merging graph layouts

Normalize coordinates for plotting graphs

Spring layout, this was removed from igraph

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

The Sugiyama graph layout generator

SVD layout, this was removed from igraph

Graph layouts

Simple two-row layout for bipartite graphs

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

The Reingold-Tilford graph layout algorithm

Graph layout with vertices on a circle.

Choose an appropriate graph layout algorithm automatically

Simple grid layout

Graph layout with vertices on the surface of a sphere

Randomly place vertices on a plane or in 3d space

The Davidson-Harel layout algorithm

The DrL graph layout generator

The Fruchterman-Reingold layout algorithm

The GEM layout algorithm

The graphopt layout algorithm

The Kamada-Kawai layout algorithm

Large Graph Layout

Graph layout by multidimensional scaling

The Sugiyama graph layout generator

Community structure detecting based on the leading eigenvector of the ...

List names of edge attributes

List names of graph attributes

List names of vertex attributes

Compute local scan statistics on graphs

Make a new graph

Create a bipartite graph

Create an extended chordal ring graph

Creates a communities object.

De Bruijn graphs

A graph with no edges

Create an undirected tree graph from its PrÃ¼fer sequence

Create a full bipartite graph

Create a complete (full) citation graph

Create a full graph

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

Kautz graphs

Create a lattice graph

Line graph of a graph

Create a ring graph

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

Create tree graphs

Match Graphs given a seeding of vertex correspondences

Matching

Maximum cardinality search

Maximum flow in a graph

Calculate Cohesive Blocks

Functions to find cliques, i.e. complete subgraphs in a graph

Functions to find cliques, i.e. complete subgraphs in a graph

Independent vertex sets

Matching

Maximum cardinality search

Merging graph layouts

Minimum cut in a graph

Minimum size vertex separators

Minimum size vertex separators

Minimum size vertex separators

Minimum size vertex separators

Minimum spanning tree

Modularity of a community structure of a graph

Modularity of a community structure of a graph

Graph motifs

Minimum spanning tree

Finding community structure by multi-level optimization of modularity

Neighborhood of graph vertices

Neighboring (adjacent) vertices in a graph

Connected components of a graph

Normalize coordinates for plotting graphs

Normalize layout

Optimal community structure

The Page Rank algorithm

The Page Rank algorithm

Shortest (directed or undirected) paths between vertices

Helper function to add or delete edges along a path

Permute the vertices of a graph

Permute the vertices of a graph

Merging graph layouts

Magrittr's pipes

Drawing graphs

Plotting of graphs

Plotting the results on multiple SIR model runs

Community structure dendrogram plots

HRG dendrogram plot

Calculate Cohesive Blocks

Add vertices, edges or another graph to a graph

Fitting a power-law distribution function to discrete data

Find Bonacich Power Centrality Scores of Network Positions

Predict edges based on a hierarchical random graph model

Trait-based random generation

Print an edge sequence to the screen

Print graphs to the terminal

Show a vertex sequence on the screen

Print a hierarchical random graph model to the screen

Print a hierarchical random graph consensus tree to the screen

Create a printer callback function

The default R palette

Radius of a graph

Random walk on a graph

Reading foreign file formats

Reading foreign file formats

Reciprocity of graphs

Delete an edge attribute

Delete a graph attribute

Delete a vertex attribute

Replicate a graph multiple times

Reverse the order in an edge sequence

Reverse the order in a vertex sequence

Reverse edges in a graph

Rewiring edges of a graph

3D plotting of graphs with OpenGL

Running mean of a time series

Running mean of a time series

Sample from a random graph model

Bipartite random graphs

Generate a new random graph from a given graph by randomly adding/remo...

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

Generate random graphs with a given degree sequence

Sample from a Dirichlet distribution

Generate random graphs according to the random dot product graph model

Random graphs from vertex fitness scores

Scale-free random graphs, from vertex fitness scores

Forest Fire Network Model

Generate random graphs according to the $G(n,m)$ ErdÅ‘s-RÃ©nyi model

Generate random graphs according to the $G(n,p)$ ErdÅ‘s-RÃ©nyi model

Geometric random graphs

Growing random graph generation

Sample the hierarchical stochastic block model

Sample from a hierarchical random graph model

A graph with subgraphs that are each a random graph.

Create a random regular graph

Random citation graphs

Graph motifs

Generate random graphs using preferential attachment

Generate an evolving random graph with preferential attachment and agi...

Trait-based random generation

Sample stochastic block model

Sampling a random integer sequence

The Watts-Strogatz small-world model

Samples from the spanning trees of a graph randomly and uniformly

Sample vectors uniformly from the surface of a sphere

Sample vectors uniformly from the volume of a sphere

Graph generation based on different vertex types

Sample trees randomly and uniformly

Sample stochastic block model

Scan statistics on a time series of graphs

Sequential palette

Set edge attributes

Set a graph attribute

Set vertex attributes

Set edge attributes

Set a graph attribute

Set vertex attributes

Various vertex shapes when plotting igraph graphs

Shortest (directed or undirected) paths between vertices

Functions to deal with the result of network community detection

Similarity measures of two vertices

Constructor modifier to drop multiple and loop edges

Simple graphs

SIR model on graphs

Eigenvalues and eigenvectors of the adjacency matrix of a graph

Finding communities in graphs based on statistical meachanics

Split-join distance of two community structures

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

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

Random graphs from vertex fitness scores

Scale-free random graphs, from vertex fitness scores

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

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

Stochastic matrix of a graph

Strength or weighted vertex degree

Query and manipulate a graph as it were an adjacency matrix

Query and manipulate a graph as it were an adjacency list

In- or out- component of a vertex

Find subgraph centrality scores of network positions

Subgraph of a graph

Find subgraph centrality scores of network positions

Decide if a graph is subgraph isomorphic to another one

All isomorphic mappings between a graph and subgraphs of another graph

Tails of the edge(s) in a graph

Experimental basic igraph GUI

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Interactive plotting of graphs

Convert a tree graph to its PrÃ¼fer sequence

Topological sorting of vertices in a graph

Topological sorting of vertices in a graph

Transitivity of a graph

Triad census, subgraphs with three vertices

Triad census, subgraphs with three vertices

Convert a general graph into a forest

Convert a general graph into a forest

Union of edge sequences

Union of graphs

Union of vertex sequences

Union of two or more sets

Remove duplicate edges from an edge sequence

Remove duplicate vertices from a vertex sequence

igraph data structure versions

Vertices of a graph

Vertex connectivity

Vertex connectivity

Helper function for adding and deleting vertices

Using pie charts as vertices in graph plots

Various vertex shapes when plotting igraph graphs

Set one or more vertex attributes

Query vertex attributes of a graph

List names of vertex attributes

Vertex connectivity

Voronoi partitioning of a graph

Community structure via short random walks

The Watts-Strogatz small-world model

Functions to find weighted cliques, i.e. vertex-weighted complete subg...

Find the multiple or loop edges in a graph

Find mutual edges in a directed graph

Constructor modifier to add edge attributes

Constructor modifier to add graph attributes

Run code with a temporary igraph options setting

Constructor modifier to add vertex attributes

Construtor modifier to remove all attributes from a graph

Constructor modifier to drop loop edges

Constructor modifier to drop multiple edges

Writing the graph to a file in some format

Writing the graph to a file in some format

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.

Maintainer: Kirill MÃ¼ller License: GPL (>= 2) Last published: 2024-03-13

Useful links