vg
tools for working with variation graphs
Namespaces | Functions
dijkstra.cpp File Reference
#include "dijkstra.hpp"
#include <structures/updateable_priority_queue.hpp>

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)
 

Detailed Description

Implementation of Dijkstra's Algorithm over the bidirected graph.