|
vg
tools for working with variation graphs
|
#include <unordered_map>#include <vg/vg.pb.h>#include "../position.hpp"#include "../hash_map.hpp"#include "../handle.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) |
Definitions for the find_shortest_paths algorithm.
1.8.20