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