[][src]Struct debruijn::clean_graph::CleanGraph

pub struct CleanGraph<K: Kmer, D, T1> where
    T1: Fn(&Node<K, D>) -> bool
{ /* fields omitted */ }

Methods

impl<K: Kmer, D: Debug, T1> CleanGraph<K, D, T1> where
    T1: Fn(&Node<K, D>) -> bool
[src]

pub fn new(tip_predicate: T1) -> CleanGraph<K, D, T1>[src]

pub fn find_bad_nodes(&self, graph: &DebruijnGraph<K, D>) -> Vec<usize>[src]

Auto Trait Implementations

impl<K, D, T1> Send for CleanGraph<K, D, T1> where
    D: Send,
    K: Send,
    T1: Send

impl<K, D, T1> Sync for CleanGraph<K, D, T1> where
    D: Sync,
    K: Sync,
    T1: Sync

Blanket Implementations

impl<T> From for T[src]

impl<T, U> Into for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T> Borrow for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> BorrowMut for T where
    T: ?Sized
[src]

impl<T, U> TryInto for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.