vg
tools for working with variation graphs
|
#include "find_shortest_paths.hpp"
#include "dijkstra.hpp"
#include <structures/updateable_priority_queue.hpp>
Namespaces | |
vg | |
vg::algorithms | |
Functions | |
unordered_map< handle_t, size_t > | vg::algorithms::find_shortest_paths (const HandleGraph *g, handle_t start, bool traverse_leftward) |
Implementation for the find_shortest_paths algorithm.