#include <graph_caller.hpp>
GraphCaller: Use the snarl decomposition to call snarls in a graph
◆ GraphCaller()
vg::GraphCaller::GraphCaller |
( |
SnarlCaller & |
snarl_caller, |
|
|
SnarlManager & |
snarl_manager, |
|
|
ostream & |
out_stream = cout |
|
) |
| |
◆ ~GraphCaller()
vg::GraphCaller::~GraphCaller |
( |
| ) |
|
|
virtual |
◆ call_snarl()
virtual bool vg::GraphCaller::call_snarl |
( |
const Snarl & |
snarl | ) |
|
|
pure virtual |
◆ call_top_level_snarls()
void vg::GraphCaller::call_top_level_snarls |
( |
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
◆ out_stream
ostream& vg::GraphCaller::out_stream |
|
protected |
Where all output written.
◆ snarl_caller
◆ snarl_manager
The documentation for this class was generated from the following files: