vg
tools for working with variation graphs
Public Member Functions | List of all members
vg::SnarlFinder Class Referenceabstract

#include <snarls.hpp>

Inheritance diagram for vg::SnarlFinder:
vg::CactusSnarlFinder

Public Member Functions

virtual ~SnarlFinder ()=default
 
virtual SnarlManager find_snarls ()=0
 
virtual SnarlManager find_snarls_parallel ()=0
 

Detailed Description

Represents a strategy for finding (nested) sites in a vg graph that can be described by snarls. Polymorphic base class/interface.

Constructor & Destructor Documentation

◆ ~SnarlFinder()

virtual vg::SnarlFinder::~SnarlFinder ( )
virtualdefault

Member Function Documentation

◆ find_snarls()

virtual SnarlManager vg::SnarlFinder::find_snarls ( )
pure virtual

Find all the snarls, and put them into a SnarlManager.

Implemented in vg::CactusSnarlFinder.

◆ find_snarls_parallel()

virtual SnarlManager vg::SnarlFinder::find_snarls_parallel ( )
pure virtual

Find all the snarls of weakly connected components in parallel. Even single-threaded, this may be worth using as it will use less memory by only considering one component at a time.

Implemented in vg::CactusSnarlFinder.


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