vg
tools for working with variation graphs
|
Namespaces | |
vg | |
vg::algorithms | |
Functions | |
bool | vg::algorithms::dijkstra (const HandleGraph *g, handle_t start, function< bool(const handle_t &, size_t)> reached_callback, bool traverse_leftward) |
bool | vg::algorithms::dijkstra (const HandleGraph *g, const unordered_set< handle_t > &starts, function< bool(const handle_t &, size_t)> reached_callback, bool traverse_leftward) |
Implementation of Dijkstra's Algorithm over the bidirected graph.