A Tidy API for Graph Manipulation
Determine the context of subsequent manipulations
Add graphs, nodes, or edges to a tbl_graph
Calculate node and edge centrality
Graph games based on connected components
Access graph, nodes, and edges directly inside verbs
Create different types of well-defined graphs
Calculate edge ranking
Querying edge types
Graph games based on evolution
Select specific nodes or edges to compute on
Fortify a tbl_graph for ggplot2 plotting
Register a graph context for the duration of the current frame
Join graphs on common nodes
Graph measurements
Querying graph types
Group nodes and edges based on community structure
Repeatedly modify a graph by a function
Measures based on the neighborhood of each node
Apply a function to nodes in the order of a breath first search
Apply a function to nodes in the reverse order of a breath first searc...
Apply a function to nodes in the order of a depth first search
Apply a function to nodes in the reverse order of a depth first search
Map a function over a graph representing the neighborhood of each node
Create a temporary alternative representation of the graph to compute ...
Functions to generate alternate representations of graphs
Base implementation of mutate
Querying node measures
Calculate node ranking
Node properties related to the graph topology
Querying node types
Calculate node pair properties
Perform a random walk on the graph and return encounter rank
Objects exported from other packages
Change terminal nodes of edges
Graph games based on direct sampling
Search a graph with depth first and breath first
A data structure for tidy graph manipulation
tidygraph: A Tidy API for Graph Manipulation
Graph games based on different node types
Evaluate a tidygraph algorithm in the context of a graph
A graph, while not "tidy" in itself, can be thought of as two tidy data frames describing node and edge data respectively. 'tidygraph' provides an approach to manipulate these two virtual data frames using the API defined in the 'dplyr' package, as well as provides tidy interfaces to a lot of common graph algorithms.
Useful links