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