#include <traversal_finder.hpp>
◆ ReadRestrictedTraversalFinder()
vg::ReadRestrictedTraversalFinder::ReadRestrictedTraversalFinder |
( |
AugmentedGraph & |
augmented_graph, |
|
|
SnarlManager & |
snarl_manager, |
|
|
int |
min_recurrence = 2 , |
|
|
int |
max_path_search_steps = 100 |
|
) |
| |
◆ ~ReadRestrictedTraversalFinder()
vg::ReadRestrictedTraversalFinder::~ReadRestrictedTraversalFinder |
( |
| ) |
|
|
virtual |
◆ find_traversals()
vector< SnarlTraversal > vg::ReadRestrictedTraversalFinder::find_traversals |
( |
const Snarl & |
site | ) |
|
|
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.
◆ aug
◆ max_path_search_steps
int vg::ReadRestrictedTraversalFinder::max_path_search_steps |
|
private |
◆ min_recurrence
int vg::ReadRestrictedTraversalFinder::min_recurrence |
|
private |
◆ snarl_manager
SnarlManager& vg::ReadRestrictedTraversalFinder::snarl_manager |
|
private |
The documentation for this class was generated from the following files: