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