|
vg
tools for working with variation graphs
|
#include <traversal_finder.hpp>
Public Member Functions | |
| ReadRestrictedTraversalFinder (AugmentedGraph &augmented_graph, SnarlManager &snarl_manager, int min_recurrence=2, int max_path_search_steps=100) | |
| virtual | ~ReadRestrictedTraversalFinder () |
| virtual vector< SnarlTraversal > | find_traversals (const Snarl &site) |
| Public Member Functions inherited from vg::TraversalFinder | |
| virtual | ~TraversalFinder ()=default |
| virtual vector< Traversal > | find_traversals (const handle_t &snarl_start, const handle_t &snarl_end) |
Private Attributes | |
| AugmentedGraph & | aug |
| SnarlManager & | snarl_manager |
| int | min_recurrence |
| int | max_path_search_steps |
| vg::ReadRestrictedTraversalFinder::ReadRestrictedTraversalFinder | ( | AugmentedGraph & | augmented_graph, |
| SnarlManager & | snarl_manager, | ||
| int | min_recurrence = 2, | ||
| int | max_path_search_steps = 100 ) |
|
virtual |
|
virtual |
For the given site, emit all traversals with unique sequences that run from start to end, out of the paths in the graph. Uses the map of reads by name to determine if a path is a read or a real named path. Paths through the site supported only by reads are subject to a min recurrence count, while those supported by actual embedded named paths are not.
Implements vg::TraversalFinder.
|
private |
|
private |
|
private |
|
private |
1.17.0