vg
tools for working with variation graphs
Loading...
Searching...
No Matches
Namespaces | Functions
a_star.hpp File Reference
#include "../handle.hpp"
#include <unordered_map>
#include <vector>

Namespaces

namespace  vg
 
namespace  vg::algorithms
 

Functions

template<class DistHeuristic >
vector< handle_tvg::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)
 

Detailed Description

Defines an implementation of the A* heuristic-guided search algorithm.