R: Fast and Efficient Graph Data Structures

# Fast and Efficient Graph Data Structures

## Documentation for package ‘orbweaver’ version 0.18.2

- DESCRIPTION file
- Package NEWS

## Help Pages

add_edge | Add an edge to a graph builder
add_path | Add a path to a graph
build_acyclic | Build a DirectedAcyclicGraph from a builder
build_directed | Build a DirectedGraph from a builder
children | Get the children on a node
find_all_paths | Find all paths between two nodes
find_path | Find a path between two nodes
find_path_one_to_many | Find the a valid path from one node to many
get_all_leaves | Get all the leaf nodes of a graph
get_all_roots | Get the all the root nodes of a graph
get_leaves_as_df | Get leaves as a data frame
get_leaves_under | Get the leaf nodes of a graph under some nodes
get_roots_over | Get the root nodes of a graph over some nodes
graph_builder | A new builder for a graph based on the type
graph_from_bin | Read the graph from a binary blob
graph_to_bin | Save the graph into a binary blob
has_children | Checks if a node in a graph has children
has_parents | Checks if a node in a graph has parents
least_common_parents | Find the least common parents in a graph
nodes | Get the nodes in the graph
parents | Get the parents on a node
populate_edges | Populates the edges of a graph from a 'data.frame'