vg
tools for working with variation graphs
Namespaces | Functions
count_walks.hpp File Reference
#include "../handle.hpp"
#include "topological_sort.hpp"
#include <unordered_map>
#include <vector>

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)
 

Detailed Description

Defines algorithm for counting the number of distinct walks through a DAG.