|
vg
tools for working with variation graphs
|
Namespaces | |
| vg | |
| vg::algorithms | |
Functions | |
| tuple< vector< handle_t >, unordered_map< handle_t, size_t >, bool > | vg::algorithms::count_walks_through_nodes (const HandleGraph *graph) |
| size_t | vg::algorithms::count_walks (const HandleGraph *graph) |
Defines algorithm for counting the number of distinct walks through a DAG.
1.8.20