vg
tools for working with variation graphs
Namespaces | Functions
subgraph.cpp File Reference
#include "subgraph.hpp"
#include "../path.hpp"
#include "../crash.hpp"

Namespaces

 vg
 
 vg::algorithms
 

Functions

void vg::algorithms::expand_subgraph_by_steps (const HandleGraph &source, MutableHandleGraph &subgraph, const uint64_t &steps, bool forward_only=false)
 expand the subgraph iteratively for this many steps More...
 
void vg::algorithms::expand_subgraph_to_node_count (const HandleGraph &source, MutableHandleGraph &subgraph, const uint64_t &node_count, bool forward_only=false)
 expand the subgraph iteratively until its node count is at least node_count More...
 
void vg::algorithms::expand_subgraph_by_length (const HandleGraph &source, MutableHandleGraph &subgraph, const uint64_t &length, bool forward_only=false)
 expand the subgraph iteratively to include at least length new sequence More...
 
void vg::algorithms::expand_subgraph_to_length (const HandleGraph &source, MutableHandleGraph &subgraph, const uint64_t &length, bool forward_only=false)
 expand the subgraph iterativel until its total sequence length is greater than length More...
 
void vg::algorithms::extract_context (const HandleGraph &source, MutableHandleGraph &subgraph, const handle_t &handle, const uint64_t &offset, const uint64_t &length, bool fwd, bool rev)
 expand the context around a single handle position More...
 
void vg::algorithms::extract_id_range (const HandleGraph &source, const nid_t &id1, const nid_t &id2, MutableHandleGraph &subgraph)
 extract the node id range More...
 
void vg::algorithms::extract_path_range (const PathPositionHandleGraph &source, path_handle_t path_handle, int64_t start, int64_t end, MutableHandleGraph &subgraph)
 
void vg::algorithms::add_subpaths_to_subgraph (const PathPositionHandleGraph &source, MutablePathHandleGraph &subgraph)
 
void vg::algorithms::add_connecting_edges_to_subgraph (const HandleGraph &source, MutableHandleGraph &subgraph)