vg::TrivialTraversalFinder Class Reference

#include <traversal_finder.hpp>

Inheritance diagram for vg::TrivialTraversalFinder:

Public Member Functions
	TrivialTraversalFinder (const HandleGraph &graph)
virtual	~TrivialTraversalFinder ()=default
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
const HandleGraph &	graph

Detailed Description

This traversal finder finds one or more traversals through leaf sites with no children. It uses a depth-first search. It doesn't work on non-leaf sites, and is not guaranteed to find all traversals. Only works on acyclic sites that are start-end-reachable.

Constructor & Destructor Documentation

TrivialTraversalFinder()

vg::TrivialTraversalFinder::TrivialTraversalFinder

(

const HandleGraph &

graph

)

~TrivialTraversalFinder()

virtual vg::TrivialTraversalFinder::~TrivialTraversalFinder ( )

virtualdefault

Member Function Documentation

find_traversals()

vector< SnarlTraversal > vg::TrivialTraversalFinder::find_traversals ( const Snarl &  site )

virtual

Find at least one traversal of the site by depth first search, if any exist. Only works on sites with no children.

Implements vg::TraversalFinder.

Member Data Documentation

graph

const HandleGraph& vg::TrivialTraversalFinder::graph

private

---

The documentation for this class was generated from the following files:

• src/traversal_finder.hpp
• src/traversal_finder.cpp