vg
tools for working with variation graphs
|
#include "handlegraph/algorithms/dijkstra.hpp"
#include <queue>
Namespaces | |
handlegraph | |
handlegraph::algorithms | |
Functions | |
bool | handlegraph::algorithms::dijkstra (const HandleGraph *g, handle_t start, function< bool(const handle_t &, size_t)> reached_callback, bool traverse_leftward) |
bool | handlegraph::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.