vg
tools for working with variation graphs
Loading...
Searching...
No Matches
sorted_id_ranges.hpp File Reference
#include <vector>
#include <utility>
#include "../handle.hpp"

Namespaces

namespace  vg
namespace  vg::algorithms

Functions

std::vector< std::pair< nid_t, nid_t > > vg::algorithms::sorted_id_ranges (const HandleGraph *graph)
 Get a sorted list of inclusive ranges of IDs used in the given HandleGraph.
bool vg::algorithms::is_in_sorted_id_ranges (const nid_t &value, const std::vector< std::pair< nid_t, nid_t > > &ranges)
 Get whether an ID is in a sorted list of inclusive ID ranges.

Detailed Description

Defines an algorithm to get the ranges of IDs covered by a HandleGraph.