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