dijkstra.cpp File Reference

#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 prune, bool cycle_to_start)
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, bool prune, bool cycle_to_start)
void	handlegraph::algorithms::for_each_handle_in_shortest_path (const HandleGraph *g, handle_t start, handle_t end, std::function< bool(const handle_t &, size_t)> iteratee)

Detailed Description

Implementation of Dijkstra's Algorithm over the bidirected graph.