vg
tools for working with variation graphs
|
#include <traversal_finder.hpp>
Public Member Functions | |
PathTraversalFinder (const PathHandleGraph &graph, SnarlManager &snarl_manager, const vector< string > &path_names={}) | |
virtual vector< SnarlTraversal > | find_traversals (const Snarl &site) |
virtual pair< vector< SnarlTraversal >, vector< pair< step_handle_t, step_handle_t > > > | find_path_traversals (const Snarl &site) |
![]() | |
virtual | ~TraversalFinder ()=default |
Protected Attributes | |
const PathHandleGraph & | graph |
SnarlManager & | snarl_manager |
unordered_set< path_handle_t > | paths |
This is a Handle Graph replacement for PathRestrictedTraversalFinder that uses the PathHandleGraph interface instead of the VG-based path index. It returns all traversals through a snarl that are contained within paths in the graph. It can also return a mapping from the traversals to their paths
vg::PathTraversalFinder::PathTraversalFinder | ( | const PathHandleGraph & | graph, |
SnarlManager & | snarl_manager, | ||
const vector< string > & | path_names = {} |
||
) |
|
virtual |
Like above, but return the path steps for the for the traversal endpoints
|
virtual |
Return all traversals through the site that are sub-paths of embedded paths in the graph
Implements vg::TraversalFinder.
|
protected |
|
protected |
|
protected |