API for orbweaver
Fast and Efficient Graph Data Structures
| Global functions | |
|---|---|
| add_edge | Man page Source code Source code |
| add_path | Man page Source code Source code |
| as.character.NodeVec | Source code |
| as.data.frame.DirectedAcyclicGraph | Source code |
| as.data.frame.DirectedGraph | Source code |
| as_character | Source code |
| as_data_frame | Source code Source code |
| as_data_frame_generic | Source code |
| build_acyclic | Man page Source code Source code |
| build_directed | Man page Source code Source code |
| children | Man page Source code Source code Source code |
| children.DirectedAcyclicGraph | Source code |
| children.DirectedGraph | Source code |
| find_all_paths | Man page Source code Source code Source code |
| find_all_paths.DirectedAcyclicGraph | Source code |
| find_all_paths.DirectedGraph | Source code |
| find_path | Man page Source code Source code Source code |
| find_path.DirectedAcyclicGraph | Source code |
| find_path.DirectedGraph | Source code |
| find_path_one_to_many | Man page Source code Source code Source code |
| find_path_one_to_many.DirectedAcyclicGraph | Source code |
| find_path_one_to_many.DirectedGraph | Source code |
| from_bin_disk | Source code Source code |
| from_bin_mem | Source code Source code |
| get_all_leaves | Man page Source code Source code Source code |
| get_all_leaves.DirectedAcyclicGraph | Source code |
| get_all_leaves.DirectedGraph | Source code |
| get_all_roots | Man page Source code Source code Source code |
| get_all_roots.DirectedAcyclicGraph | Source code |
| get_all_roots.DirectedGraph | Source code |
| get_leaves_as_df | Man page Source code Source code Source code |
| get_leaves_under | Man page Source code Source code Source code |
| get_leaves_under.DirectedAcyclicGraph | Source code |
| get_leaves_under.DirectedGraph | Source code |
| get_roots_over | Man page Source code Source code Source code |
| get_roots_over.DirectedAcyclicGraph | Source code |
| get_roots_over.DirectedGraph | Source code |
| graph_builder | Man page Source code |
| graph_from_bin | Man page Source code |
| graph_to_bin | Man page Source code |
| has_children | Man page Source code Source code Source code |
| has_children.DirectedAcyclicGraph | Source code |
| has_children.DirectedGraph | Source code |
| has_parents | Man page Source code Source code Source code |
| has_parents.DirectedAcyclicGraph | Source code |
| has_parents.DirectedGraph | Source code |
| is_empty | Source code |
| least_common_parents | Man page Source code Source code Source code |
| least_common_parents.DirectedAcyclicGraph | Source code |
| least_common_parents.DirectedGraph | Source code |
| len | Source code |
| length | Source code Source code |
| length.DirectedAcyclicGraph | Source code |
| length.DirectedGraph | Source code |
| length.DirectedGraphBuilder | Source code |
| length.NodeVec | Source code |
| new | Source code |
| nodes | Man page Source code Source code Source code |
| parents | Man page Source code Source code Source code |
| parents.DirectedAcyclicGraph | Source code |
| parents.DirectedGraph | Source code |
| populate_edges | Man page Source code |
| Source code Source code Source code | |
| print.DirectedAcyclicGraph | Source code |
| print.DirectedGraph | Source code |
| print.NodeVec | Source code |
| rs_populate_edges_builder | Source code |
| subset.DirectedAcyclicGraph | Source code |
| subset.DirectedGraph | Source code |
| subset_multi | Source code Source code |
| subset_multi_with_limit | Source code Source code |
| throw_if_error | Source code |
| to_bin_disk | Source code Source code |
| to_bin_mem | Source code Source code |
