Struct debruijn::graph::BaseGraph [−][src]
pub struct BaseGraph<K, D> {
pub sequences: PackedDnaStringSet,
pub exts: Vec<Exts>,
pub data: Vec<D>,
pub stranded: bool,
// some fields omitted
}
Expand description
A compressed DeBruijn graph carrying auxiliary data on each node of type D
.
This type does not carry the sorted index arrays the allow the graph
to be walked efficiently. The DeBruijnGraph
type wraps this type and add those
vectors.
Fields
sequences: PackedDnaStringSet
exts: Vec<Exts>
data: Vec<D>
stranded: bool
Implementations
Trait Implementations
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations
impl<K, D> RefUnwindSafe for BaseGraph<K, D> where
D: RefUnwindSafe,
K: RefUnwindSafe,
impl<K, D> UnwindSafe for BaseGraph<K, D> where
D: UnwindSafe,
K: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more