igraph

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

Adjacent vertices of multiple vertices in a graph

List all simple paths from one source

Find Bonacich alpha centrality scores of network positions

Are two vertices adjacent?

ARPACK eigenvector calculation

Articulation points of a graph

Convert between directed and undirected graphs

Conversion to igraph

Adjacency lists

Convert a graph to an adjacency matrix

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

Incidence matrix of a bipartite graph

Convert a graph to a long data frame

Declare a numeric vector as a membership vector

Assortativity coefficient

Kleinberg's authority centrality scores.

Number of automorphisms

Vertex and edge betweenness centrality

Breadth-first search

Biconnected components

Decide whether a graph is bipartite

Project a bipartite graph

Concatenate edge sequences

Concatenate vertex sequences

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

Centralization of a graph

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

Closeness centrality of vertices

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 community matrix

Finding community structure of a graph using the Leiden algorithm of Traag, van Eck & Waltman.

Finding community structure by multi-level optimization of modularity

Optimal community structure

Finding communities in graphs based on statistical meachanics

Community strucure via short random walks

Cocitation coupling

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

Create a consensus tree from several hierarchical random graph models

The igraph console

Burt's constraint

Contract several vertices into a single one

Convex hull of a set of vertices

K-core decomposition of graphs

Count the number of isomorphic mappings between two graphs

Graph motifs

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

Find triangles in graphs

Optimal edge curvature when plotting graphs

Decompose a graph into components

Degree and degree distribution of the vertices

Delete an edge attribute

Delete edges from a graph

Delete a graph attribute

Delete a vertex attribute

Delete vertices from a graph

Depth-first search

Diameter of a graph

Difference of two sets

Difference of graphs

Difference of edge sequences

Difference of vertex sequences

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

Dyad census of a graph

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

Eccentricity of the vertices in a graph

Helper function for adding and deleting edges

Query edge attributes of a graph

Set one or more edge attributes

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 Erdos-Renyi model

Fit a hierarchical random graph model

Fitting a power-law distribution function to discrete data

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

Girth of a graph

Order (number of vertices) of a graph

Convert object to a graph

Graph attributes of a graph

Set all or some graph attributes

List names of graph attributes

Create graphs from adjacency lists

Create graphs from adjacency matrices

Create a graph from the Graph Atlas

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

Create graphs from an 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

Groups of a vertex partitioning

The size of the graph (number of edges)

Common handler for vertex type arguments in igraph functions

Head of the edge(s) in a graph

Print the only the head of an R object

Create a hierarchical random graph from an igraph graph

Hierarchical random graphs

Create an igraph graph from a hierarchical random graph model

Kleinberg's hub 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

Run igraph demos, step by step

Parameters for the igraph package

Run package tests

Query igraph's version string

Incident edges of a vertex in a graph

Incident edges of multiple vertices in a graph

Indent a printout

Intersection of two or more sets

Intersection of graphs

Intersection of edge sequences

Intersection of vertex 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

Is a degree sequence graphical?

Is this object an igraph graph?

Minimal vertex separators

Named graphs

Is this a printer callback?

Vertex separators

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

Graph rewiring while preserving the degree distribution

Average nearest neighbor degree

Graph Laplacian

Deprecated layout functions

Grid Fruchterman-Reingold layout, this was removed from igraph

Spring layout, this was removed from igraph

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

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

Graph matching

Maximum cardinality search

Maximum flow in a graph

Merging graph layouts

Minimum cut in a graph

Minimum size vertex separators

Minimum size vertex separators

Modularity of a community structure of a graph

Graph motifs

Minimum spanning tree

Neighboring (adjacent) vertices in a graph

Query and download from the Nexus network repository

Normalize coordinates for plotting graphs

Normalize layout

The Page Rank algorithm

Helper function to add or delete edges along a path

Permute the vertices of a graph

Magrittr's pipes

Drawing graphs

Plotting of graphs

Plotting the results on multiple SIR model runs

Community structure dendrogram plots

HRG dendrogram plot

Add vertices, edges or another graph to a graph

Find Bonacich Power Centrality Scores of Network Positions

Predict edges based on a hierarchical random graph model

Print graphs to the terminal

Print an edge sequence to the screen

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

Better printing of R packages

The default R palette

Radius of a graph

Random walk on a graph

Reading foreign file formats

Reciprocity of graphs

Replicate a graph multiple times

Reverse the order in an edge sequence

Reverse the order in a vertex sequence

Rewiring edges of a graph

3D plotting of graphs with OpenGL

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/removing edges

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