#include <graph_caller.hpp>
GraphCaller: Use the snarl decomposition to call snarls in a graph
◆ GraphCaller()
◆ ~GraphCaller()
vg::GraphCaller::~GraphCaller |
( |
| ) |
|
|
virtual |
◆ break_chain()
vector< Chain > vg::GraphCaller::break_chain |
( |
const HandleGraph & |
graph, |
|
|
const Chain & |
chain, |
|
|
size_t |
max_edges, |
|
|
size_t |
max_trivial |
|
) |
| |
|
protected |
Break up a chain into bits that we want to call using size heuristics.
◆ call_snarl()
virtual bool vg::GraphCaller::call_snarl |
( |
const Snarl & |
snarl, |
|
|
int |
ploidy |
|
) |
| |
|
pure virtual |
◆ call_top_level_chains()
void vg::GraphCaller::call_top_level_chains |
( |
const HandleGraph & |
graph, |
|
|
int |
ploidy, |
|
|
size_t |
max_edges, |
|
|
size_t |
max_trivial, |
|
|
bool |
recurse_on_fail = true |
|
) |
| |
|
virtual |
For every chain, cut it up into pieces using max_edges and max_trivial to cap the size of each piece then make a fake snarl for each chain piece and call it. If a fake snarl fails to call, It's child chains will be recursed on (if selected)_
◆ call_top_level_snarls()
void vg::GraphCaller::call_top_level_snarls |
( |
const HandleGraph & |
graph, |
|
|
int |
ploidy, |
|
|
bool |
recurse_on_fail = true |
|
) |
| |
|
virtual |
Run call_snarl() on every top-level snarl in the manager. For any that return false, try the children, etc. (when recurse_on_fail true) Snarls are processed in parallel
◆ snarl_caller
◆ snarl_manager
The documentation for this class was generated from the following files: