|
vg
tools for working with variation graphs
|
This is the complete list of members for vg::IntegratedSnarlFinder, including all inherited members.
| extra_node_weight | vg::IntegratedSnarlFinder | private |
| find_snarls() | vg::HandleGraphSnarlFinder | virtual |
| find_snarls_parallel() | vg::IntegratedSnarlFinder | virtual |
| find_snarls_unindexed() | vg::HandleGraphSnarlFinder | protectedvirtual |
| graph | vg::HandleGraphSnarlFinder | protected |
| HandleGraphSnarlFinder(const HandleGraph *graph) | vg::HandleGraphSnarlFinder | |
| IntegratedSnarlFinder(const HandleGraph &graph, const std::unordered_map< nid_t, size_t > &extra_node_weight={}) | vg::IntegratedSnarlFinder | |
| traverse_computed_decomposition(MergedAdjacencyGraph &cactus, const MergedAdjacencyGraph &forest, vector< pair< size_t, vector< handle_t >>> &longest_paths, unordered_map< handle_t, handle_t > &towards_deepest_leaf, vector< pair< size_t, handle_t >> &longest_cycles, unordered_map< handle_t, handle_t > &next_along_cycle, const function< void(handle_t)> &begin_chain, const function< void(handle_t)> &end_chain, const function< void(handle_t)> &begin_snarl, const function< void(handle_t)> &end_snarl) const | vg::IntegratedSnarlFinder | private |
| traverse_decomposition(const function< void(handle_t)> &begin_chain, const function< void(handle_t)> &end_chain, const function< void(handle_t)> &begin_snarl, const function< void(handle_t)> &end_snarl) const | vg::IntegratedSnarlFinder | virtual |
| ~HandleGraphSnarlFinder()=default | vg::HandleGraphSnarlFinder | virtual |
| ~SnarlFinder()=default | vg::SnarlFinder | virtual |
1.8.17