vg
tools for working with variation graphs
vg::TargetValueSearch Member List

This is the complete list of members for vg::TargetValueSearch, including all inherited members.

handle_graphvg::TargetValueSearchprotected
lower_bound_heuristicvg::TargetValueSearchprotected
TargetValueSearch()=deletevg::TargetValueSearch
TargetValueSearch(const HandleGraph &handle_graph, DistanceHeuristic *upper_bound_heuristic, DistanceHeuristic *lower_bound_heuristic)vg::TargetValueSearch
tv_path(const pos_t &pos_1, const pos_t &pos_2, int64_t target_value, int64_t tolerance)vg::TargetValueSearch
tv_path_exists(const pos_t &pos_1, const pos_t &pos_2, int64_t target_value, int64_t tolerance)vg::TargetValueSearch
tv_path_length(const pos_t &pos_1, const pos_t &pos_2, int64_t target_value, int64_t tolerance)vg::TargetValueSearch
tv_phase2(const pos_t &pos_1, const pos_t &pos_2, int64_t target_value, int64_t tolerance, hash_map< pair< id_t, bool >, int64_t > &node_to_target_shorter, hash_map< pair< id_t, bool >, int64_t > &node_to_target_longer, pair< int64_t, pair< pair< id_t, bool >, int64_t >> &best_lng, pair< int64_t, pair< pair< id_t, bool >, int64_t >> &next_best, hash_map< pair< pair< id_t, bool >, int64_t >, pair< pair< id_t, bool >, int64_t >> &node_to_path)vg::TargetValueSearchprotected
upper_bound_heuristicvg::TargetValueSearchprotected
~TargetValueSearch()=defaultvg::TargetValueSearch