vg
tools for working with variation graphs
|
Namespaces | |
vg | |
vg::algorithms | |
Functions | |
template<class DistHeuristic > | |
vector< handle_t > | vg::algorithms::a_star (const HandleGraph *graph, const pos_t &pos_1, const pos_t &pos_2, const DistHeuristic &dist_heuristic, bool find_min=true, int64_t extremal_distance=numeric_limits< int64_t >::max(), bool monotonic_heuristic=true) |
Defines an implementation of the A* heuristic-guided search algorithm.