vg
tools for working with variation graphs
|
#include <constructor.hpp>
Public Attributes | |
Graph | graph |
id_t | max_id |
set< id_t > | left_ends |
set< id_t > | right_ends |
Represents a constructed region of the graph along a single linear sequence. Contains the protobuf Graph holding all the created components (which may be too large to serialize), a set of node IDs whose left sides need to be connected to when you connect to the start of the chunk, and a set of node IDs whose right sides need to be connected to when you connect to the end of the chunk.
Node ordering is restricted: if there is a single source, it must be the very first node in the graph with ID 1, and if there is a single sink it must be the very last node in the graph with ID max_id. Additionally, single sources and single sinks must be visited by only a single path, the reference path.
The overall reference path must also always be path 0. Also, all mappings in all paths must be full-length matches on the forward strand, and they must be sorted by rank. Ranks must be filled and start with rank 1 in each path.
Graph vg::ConstructedChunk::graph |
set<id_t> vg::ConstructedChunk::left_ends |
id_t vg::ConstructedChunk::max_id |
set<id_t> vg::ConstructedChunk::right_ends |