Graph/Network Visualization
Get coreness values for graph nodes
Get total degree distribution data for a graph
Get histogram data for a graph's degree frequency
Get indegree values for all nodes
Get outdegree values for all nodes
Get total degree values for all nodes
Get Dice similarity coefficient scores
Get node eccentricities
Get the graph's edf filtered by a selection of edges
Get a vector of edge ID values
Get detailed information on edges
Get node IDs associated with edges
Get the eigen centrality for all nodes
Get the graph girth
Get global graph attributes
Get information on any available graph actions
Get a graph available in a series
Get metrics for a graph
Get the graph log information
Get graph name
Get information on a graph series
Get the graph date-time or timezone
Get Jaccard similarity coefficient scores
Get the last set of edges created in a graph
Get the last set of nodes created in a graph
Get edge attribute values
Get edge attribute values from a selection of edges
Get count of edge definitions where multiple edges occur
Add a balanced tree to the graph
Add a cycle of nodes to the graph
Add an edge between nodes in a graph object
Add a clone of an existing edge to the graph
Add edges from an edge data frame to an existing graph object
Add edges and attributes to graph from a table
Add one or more edges using a text string
Add new edges with identical definitions as with a selection of edges
Add a fully connected graph
Add one or more global graph attributes
Add a G(n, m) Erdos-Renyi graph
Add a G(n, p) Erdos-Renyi graph
Add a graph action for execution at every transform
Add graph object to a graph series object
Add a 2D grid of nodes to the graph
Add a 3D grid of nodes to the graph
Create a random growing graph with m edges added per step
Create a random islands graph with edges between the islands
Add MathJax-formatted equation text
Add one or several clones of an existing node to the graph
Add one or several unconnected nodes to the graph
Add a multiple of new nodes with edges to or from one or more selected...
Add a node to an existing graph object
Add clones of a selection of nodes
Add nodes from a node data frame to an existing graph object
Get an edge data frame from a graph
Add nodes from distinct values in data frame columns
Add nodes and attributes to graph from a table
Add a preferential attachment graph
Add a path of nodes to the graph
Add a prism of nodes to the graph
Add new edges in the opposite directions of a selection of edges
Add a Watts-Strogatz small-world graph
Add a star of nodes to the graph
Clear an active selection of nodes or edges
Apply colors based on edge attribute values
Apply colors based on node attribute values
Combine multiple edge data frames into a single edge data frame
Combine two graphs into a single graph
Combine multiple node data frames
Copy an edge attribute column and set the name
Copy a node attribute column and set the name
Get the number of asymmetrically-connected node pairs
Get the number of automorphisms
Get a count of all edges
Count graphs in a graph series object
Get count of all loop edges
Get the number of mutually-connected node pairs
Get a count of all nodes
Get the number of strongly-connected components
Get the number of unconnected node pairs
Get count of all unconnected nodes
Get the number of weakly-connected components
Create an edge data frame
Create a graph object
Create a graph series object
Create a node data frame
Delete vectors cached in a graph object
Delete an edge from an existing graph object
Delete all selected edges in an edge selection
Delete one of the global graph attributes stored within a graph object
Delete one or more graph actions stored within a graph object
Delete all loop edges associated with a selection of nodes
Delete a node from an existing graph object
Delete all nodes in a node selection
Deselect any selected edges in a graph
Deselect any selected nodes in a graph
DiagrammeR: Graph/Network Visualization
R + mermaid.js
Widget output function for use in Shiny
Display a property graph's underlying model
Use the breadth-first search (bfs) algorithm
Use the depth-first search (dfs) algorithm
Drop an edge attribute column
Drop a node attribute column
Insert edge aesthetic attributes during edge creation
Insert edge data attributes during edge creation
Export a graph to CSV files
Export a graph to various image formats
Subset a graph series object
Create a graph using an adjacency matrix
Convert an igraph graph to a DiagrammeR one
Fully connect all nodes in a selection of nodes
Fully disconnect all nodes in a selection of nodes
Generate DOT code using a graph object
Get graph adhesion
Get an aggregate value from the indegree of nodes
Get an aggregate value from the outdegree of nodes
Get an aggregate value from the total degree of nodes
Get all nodes connected to a specified node
Get the alpha centrality for all nodes
Get articulation points
Get the authority scores for all nodes
Get betweenness centrality scores
Get a cached vector from a graph object
Get closeness centrality values
Get closeness vitality
Get community membership by edge betweenness
Get community membership by modularity optimization
Get community membership by leading eigenvector
Get community membership by Louvain optimization
Get community membership using the Walktrap method
Get all common neighbors between two or more nodes
Get leverage centrality
Get the maximum graph eccentricity
Get the mean distance
Get the minimum cut between source and sink nodes
Get the minimum graph eccentricity
Get the count of multiple edges
Get all neighbors of one or more nodes
Get node attribute values
Get node attribute values from a selection of nodes
Get a node data frame from a graph
Get the graph's ndf filtered by a selection of nodes
Get a vector of node ID values
Get detailed information on nodes
Get non-neighbors of a node in a graph
Get the PageRank values for all nodes
Get paths from a specified node in a directed graph
Get nodes that form the graph periphery
Get node IDs for predecessor nodes to the specified node
Get radiality centrality scores
Get the graph reciprocity
Get nodes within strongly connected components
Get the current selection available in a graph object
Get neighboring nodes based on node attribute similarity
Get node IDs for successor nodes to the specified node
Get all nodes associated with connected components
R + viz.js
Widget output function for use in Shiny
Import a graph from various graph formats
Invert selection of nodes or edges in a graph
Is the edge a loop edge?
Is the edge a multiple edge?
Is the edge mutual with another edge?
Determine whether a specified edge is present
Is the graph a connected graph?
Is the graph a directed acyclic graph?
Is the graph a directed graph?
Is the graph empty?
Is the graph a simple graph?
Is the graph an undirected graph?
Is the graph a weighted graph?
Determine whether a specified node is present
Is the graph a property graph?
Join new edge attribute values using a data frame
Join new node attribute values using a data frame
Layout nodes using a text-based schematic
R + mermaid.js
Mutate a set of edge attribute values
Mutate edge attribute values for a selection of edges
Mutate a set of node attribute values
Mutate node attribute values for a selection of nodes
Insert node aesthetic attributes during node creation
Insert node data attributes during node creation
Options for node and edge aesthetics and data
Move layout positions of a selection of nodes
Read a graph or graph series from disk
Pipe operator
Print the graph to the terminal
Recode a set of edge attribute values
Recode a set of node attribute values
Remove a graph from a graph series
Rename an edge attribute
Rename a node attribute
Render the graph in various formats
Render a graph available in a series
Widget render function for use in Shiny
Widget render function for use in Shiny
Reorder the stored series of graph actions
Razor-like template for diagram specification
Rescale numeric edge attribute values
Rescale numeric node attribute values
Reverse the direction of all edges in a graph
Reverse the direction of selected edges in a graph using an edge selec...
Save a graph or graph series to disk
Select edges in a graph
Select edges in a graph using edge ID values
Select edges in a graph using node ID values
Select the last set of edges created in a graph
Select the last set of nodes created in a graph
Select nodes in a graph
Select nodes in the graph based on their degree values
Select nodes in a graph by their ID values
Select nodes based on a walk distance from a specified node
Cache a vector in the graph
Set the edge attribute values to be rendered
Set edge attribute values
Set edge attributes with an edge selection
Convert an undirected graph to a directed graph
Set graph name
Set graph date-time and timezone
Convert a directed graph to an undirected graph
Set the node attribute values to be rendered
Set node attribute values with a graph function
Set node attribute values
Set node attributes with a node selection
Apply a layout position to a single node
Convert a DiagrammeR graph to an igraph one
Create a complement of a graph
Get a minimum spanning tree subgraph
Create a subgraph using a node or edge selection
Traverse from one or more selected nodes onto neighboring nodes
Traverse from one or more selected nodes onto adjacent edges
Traverse from one or more selected nodes onto adjacent, inward nodes
Traverse from one or more selected nodes onto adjacent, inward edges
Traverse from one or more selected edges onto adjacent, inward nodes
Traverse inward node-by-node until stopping conditions are met
Traverse from one or more selected nodes onto adjacent, outward nodes
Traverse from one or more selected nodes onto adjacent, outward edges
Traverse from one or more selected edges onto adjacent, outward nodes
Traverse outward node-by-node until stopping conditions are met
Traverse to any reverse edges
Trigger the execution of a series of graph actions
Render graph with visNetwork
X11 colors and hexadecimal color values
Build graph/network structures using functions for stepwise addition and deletion of nodes and edges. Work with data available in tables for bulk addition of nodes, edges, and associated metadata. Use graph selections and traversals to apply changes to specific nodes or edges. A wide selection of graph algorithms allow for the analysis of graphs. Visualize the graphs and take advantage of any aesthetic properties assigned to nodes and edges.
Useful links