nearest_offsets_in_paths.hpp File Reference

#include "../handle.hpp"
#include <vector>
#include <utility>
#include <unordered_map>
#include <map>
#include "structures/rank_pairing_heap.hpp"

Namespaces
	vg
	vg::algorithms

Typedefs
using	vg::algorithms::path_offset_collection_t = unordered_map< path_handle_t, vector< pair< size_t, bool > >>

Functions
path_offset_collection_t	vg::algorithms::nearest_offsets_in_paths (const PathPositionHandleGraph *graph, const pos_t &pos, int64_t max_search, const std::unordered_set< PathSense > &desired_senses, const std::function< bool(const path_handle_t &)> *path_filter, bool subtract_traversal_dist, pair< size_t, bool > *traversal_dist)
map< string, vector< pair< size_t, bool > > >	vg::algorithms::offsets_in_paths (const PathPositionHandleGraph *graph, const pos_t &pos)
path_offset_collection_t	vg::algorithms::simple_offsets_in_paths (const PathPositionHandleGraph *graph, pos_t pos)
	A "simple" model for path position getting for debugging. More...

Detailed Description

Defines algorithm for finding the nearest offset along a path of the the closest position in the graph that overlaps a path