Edges of a graph
Vertices of a graph
The igraph package
Adjacency lists
Add edges to a graph
Adjacent vertices of multiple vertices in a graph
List all simple paths from one source
Convert a graph to an adjacency matrix
Add vertices to a graph
Add layout to graph
Convert a vertex or edge sequence to an ordinary vector
Are two vertices adjacent?
Find Bonacich alpha centrality scores of network positions
Kleinberg's authority centrality scores.
Conversion to igraph
ARPACK eigenvector calculation
Convert between directed and undirected graphs
Incidence matrix of a bipartite graph
Assortativity coefficient
Convert a graph to an edge list
Articulation points of a graph
Convert igraph graphs to graphNEL objects from the graph package
Centralize a graph according to the degrees of vertices
Decide whether a graph is bipartite
Theoretical maximum for degree centralization
Project a bipartite graph
Number of automorphisms
Convert a graph to a long data frame
Vertex and edge betweenness centrality
Breadth-first search
Biconnected components
Finding communities based on propagating labels
Centralize a graph according to the closeness of vertices
Declare a numeric vector as a membership vector
Component-wise layout
Concatenate vertex sequences
Concatenate edge sequences
Connected components of a graph
Community structure detecting based on the leading eigenvector of the
community matrix
Complementer of a graph
Delete a vertex attribute
Delete vertices from a graph
Compose two graphs as binary relations
Centralize a graph according to the betweenness of vertices
Theoretical maximum for betweenness centralization
Centralization of a graph
Theoretical maximum for closeness centralization
Palette for categories
The functions find cliques, ie. complete subgraphs in a graph
Canonical permutation of a graph
Functions to deal with the result of network community detection
Set one or more edge attributes
Depth-first search
Query edge attributes of a graph
Diameter of a graph
Closeness centrality of vertices
Graph density
Compares community structures using various metrics
Burt's constraint
Neighborhood of graph vertices
Community structure detection based on edge betweenness
Contract several vertices into a single one
Convex hull of a set of vertices
Delete edges from a graph
K-core decomposition of graphs
Girth of a graph
Finding communities in graphs based on statistical meachanics
Community structure via greedy optimization of modularity
Order (number of vertices) of a graph
Centralize a graph according to the eigenvector centrality of vertices
Finding community structure by multi-level optimization of modularity
Delete a graph attribute
Count the number of isomorphic mappings between two graphs
Theoretical maximum for betweenness centralization
Community strucure via short random walks
Infomap community finding
Convert graphNEL objects from the graph package to igraph
Shortest (directed or undirected) paths between vertices
Create an igraph graph from a hierarchical random graph model
Kleinberg's hub centrality scores.
Graph motifs
Optimal community structure
graph_from_incidence_matrix
Create graphs from an incidence matrix
count_subgraph_isomorphisms
Count the isomorphic mappings between a graph and the subgraphs of
another graph
Indexing edge sequences
Find triangles in graphs
Difference of two sets
Degree and degree distribution of the vertices
Difference of graphs
Delete an edge attribute
Create a consensus tree from several hierarchical random graph models
Diverging palette
Dyad census of a graph
The igraph console
Eccentricity of the vertices in a graph
Incident vertices of some graph edges
Convert object to a graph
Set all or some graph attributes
Cocitation coupling
Calculate Cohesive Blocks
Spectral Embedding of the Laplacian of a Graph
Helper function for adding and deleting edges
Rewires the endpoints of the edges of a graph to a random vertex
Fitting a power-law distribution function to discrete data
Optimal edge curvature when plotting graphs
Decompose a graph into components
Create a graph from the Graph Atlas
Groups of a vertex partitioning
Create a graph from an edge list matrix
The size of the graph (number of edges)
Creating igraph graphs from data frames or vice-versa
Find the edge ids based on the incident vertices of the edges
Select edges and show their metadata
Difference of edge sequences
Dimensionality selection for singular values using profile likelihood.
Load a graph from the graph database for testing graph isomorphism.
Run package tests
Query igraph's version string
Igraph data structure versions
Graphlet decomposition of a graph
Parameters for the igraph package
Indent a printout
Difference of vertex sequences
Intersection of two or more sets
Is this object an igraph graph?
Run igraph demos, step by step
Minumal vertex separators
layout.fruchterman.reingold.grid
Grid Fruchterman-Reingold layout, this was removed from igraph
Head of the edge(s) in a graph
Spring layout, this was removed from igraph
Disjoint union of graphs
List names of edge attributes
Decide if two graphs are isomorphic
Is this a printer callback?
Choose an appropriate graph layout algorithm automatically
Print the only the head of an R object
Getting and setting graph attributes, shortcut
make_full_bipartite_graph
Create a full bipartite graph
Edge connectivity.
Graph layout by multidimensional scaling
Isomorphism class of a graph
Find Eigenvector Centrality Scores of Network Positions
Named graphs
Large Graph Layout
Simple grid layout
Graph diversity
Intersection of edge sequences
Query or set attributes of the edges in an edge sequence
Generate random graphs according to the Erdos-Renyi model
Create a complete (full) citation graph
Fit a hierarchical random graph model
Intersection of graphs
Dominator tree
graph_from_isomorphism_class
Create a graph from an isomorphism class
Create a lattice graph
Graph layout with vertices on the surface of a sphere
Create graphs from adjacency lists
Spectral Embedding of Adjacency Matrices
Graph attributes of a graph
Get the id of a graph
List names of graph attributes
Creating (small) graphs via a simple interface
graph_from_adjacency_matrix
Create graphs from adjacency matrices
Check whether a graph is directed
Randomly place vertices on a plane or in 3d space
Neighboring (adjacent) vertices in a graph
Hierarchical random graphs
Minimum spanning tree
Kautz graphs
Creating a graph from LCF notation
Delete vertices or edges from a graph
Create a hierarchical random graph from an igraph graph
Create a printer callback function
The Fruchterman-Reingold layout algorithm
Is a degree sequence graphical?
Graph Laplacian
Create an extended chordal ring graph
Query or set attributes of the vertices in a vertex sequence
The default R palette
Decide if two graphs are identical
Incident edges of a vertex in a graph
Plotting of graphs
The GEM layout algorithm
Line graph of a graph
Plotting the results on multiple SIR model runs
Deprecated layout functions
Incident edges of multiple vertices in a graph
Creates a communities object.
Reverse the order in a vertex sequence
Rewiring edges of a graph
igraph-attribute-combination
How igraph functions handle attributes when the graph changes
Vertex separators
Print an edge sequence to the screen
Helper function to add or delete edges along a path
Minimum cut in a graph
Create a ring graph
Weighted graphs
Merging graph layouts
Generate random graphs according to the random dot product graph model
Show a vertex sequence on the screen
Permute the vertices of a graph
Average nearest neighbor degree
Radius of a graph
Random walk on a graph
The Reingold-Tilford graph layout algorithm
Graph rewiring while preserving the degree distribution
Select vertices and show their metadata
Indexing vertex sequences
Intersection of vertex sequences
The graphopt layout algorithm
Make a new graph
Graph layout with vertices on a circle.
Chordality of a graph
Generate a new random graph from a given graph by randomly
adding/removing edges
Graph motifs
Calculate all isomorphic mappings between the vertices of two graphs
Random citation graphs
Check if a degree sequence is valid for a multi-graph
The Kamada-Kawai layout algorithm
Directed acyclic graphs
Maximum flow in a graph
Independent vertex sets
Random graphs from vertex fitness scores
Semi-Projectors
Maximum cardinality search
Create a bipartite graph
SVD layout, this was removed from igraph
Sequential palette
Graph layouts
Generate coordinates to place the vertices of a graph in a star-shape
Create a random regular graph
Sampling a random integer sequence
Construtor modifier to remove all attributes from a graph
The Sugiyama graph layout generator
The Watts-Strogatz small-world model
Compute local scan statistics on graphs
Sample vectors uniformly from the surface of a sphere
A graph with subgraphs that are each a random graph.
Minimum size vertex separators
sample_correlated_gnp_pair
Sample a pair of correlated G(n,p) random graphs
Sample vectors uniformly from the volume of a sphere
A graph with no edges
Decide if a graph is subgraph isomorphic to another one
Simple two-row layout for bipartite graphs
Simple graphs
Set edge attributes
The Davidson-Harel layout algorithm
All isomorphic mappings between a graph and subgraphs of another graph
SIR model on graphs
Minimum size vertex separators
The DrL graph layout generator
Set a graph attribute
Create a full graph
Split-join distance of two community structures
Eigenvalues and eigenvectors of the adjacency matrix of a graph
Magrittr's pipes
Match Graphs given a seeding of vertex correspondences
Union of vertex sequences
De Bruijn graphs
Triad census, subgraphs with three vertices
Helper function for adding and deleting vertices
Remove duplicate edges from an edge sequence
Transitivity of a graph
Remove duplicate vertices from a vertex sequence
Run code with a temporary igraph options setting
Print a hierarchical random graph model to the screen
Igraph data structure versions
Subgraph of a graph
Graph matching
Create an igraph graph from a list of edges, or a notable graph
Create a star graph, a tree with n vertices and n - 1 leaves
Find subgraph centrality scores of network positions
Create tree graphs
Constructor modifier to add vertex attributes
Constructor modifier to drop loop edges
Drawing graphs
Print a hierarchical random graph consensus tree to the screen
Query and download from the Nexus network repository
Using pie charts as vertices in graph plots
Normalize layout
Graph motifs
Forest Fire Network Model
The Page Rank algorithm
Reading foreign file formats
Add vertices, edges or another graph to a graph
Reciprocity of graphs
Community structure dendrogram plots
Normalize coordinates for plotting graphs
Scale-free random graphs, from vertex fitness scores
Replicate a graph multiple times
Modularity of a community structure of a graph
Predict edges based on a hierarchical random graph model
Generate random graphs according to the G(n,m) Erdos-Renyi model
Find Bonacich Power Centrality Scores of Network Positions
Reverse the order in an edge sequence
Generate random graphs according to the G(n,p) Erdos-Renyi model
plot_dendrogram.igraphHRG
HRG dendrogram plot
Print graphs to the terminal
Sample from a Dirichlet distribution
Geometric random graphs
Running mean of a time series
3D plotting of graphs with OpenGL
Graph generation based on different vertex types
Generate random graphs with a given degree sequence
Sample from a random graph model
Scan statistics on a time series of graphs
Error of the spectral coarse graining (SCG) approximation
Growing random graph generation
SCG Problem Solver
Constructor modifier to drop multiple and loop edges
Strength or weighted vertex degree
Similarity measures of two vertices
Bipartite random graphs
Query and manipulate a graph as it were an adjacency matrix
Generate an evolving random graph with preferential attachment and aging
Sample from a hierarchical random graph model
Set vertex attributes
Union of edge sequences
Various vertex shapes when plotting igraph graphs
Generate scale-free graphs according to the Barabasi-Albert model
Sample the hierarchical stochastic block model
Find the multiple or loop edges in a graph
Union of graphs
Trait-based random generation
List all minimum \((s,t)\)-cuts of a graph
Constructor modifier to drop multiple edges
Stochastic matrix of a graph
Query and manipulate a graph as it were an adjacency list
Find mutual edges in a directed graph
Writing the graph to a file in some format
Sample stochastic block model
Spectral Coarse Graining
In- or out- component of a vertex
Union of two or more sets
All-in-one Function for the SCG of Matrices and Graphs
Query vertex attributes of a graph
Set one or more vertex attributes
Constructor modifier to add edge attributes
Deprecated function, used to set random seed of the C library's RNG
Convert a general graph into a forest
Constructor modifier to add graph attributes
List all (s,t)-cuts of a graph
Interactive plotting of graphs
Tails of the edge(s) in a graph
Experimental basic igraph GUI
Topological sorting of vertices in a graph
List names of vertex attributes
Vertex connectivity.