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