dijkstra.hpp File Reference

#include <unordered_map>
#include <vg/vg.pb.h>
#include "../position.hpp"
#include "../hash_map.hpp"
#include "../handle.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

Definitions of Dijkstra's Algorithm utilities for traversing the graph closest-first.