Struct gfatk::gfa::graph::GFAungraph

source · [−]

pub struct GFAungraph(pub Graph<usize, (), Undirected>);

Expand description

A wrapper of petgraph’s undirected Graph struct, applied to a GFA. No weights.

Tuple Fields

0: Graph<usize, (), Undirected>

Implementations

source

impl GFAungraph

source

pub fn recursive_search(
 &self,
 sequence_id: Vec<usize>,
 iterations: i32,
 collect_sequence_names: Vec<NodeIndex>,
 graph_indices: GFAGraphLookups
) -> Result<Vec<usize>>

The algorithm called in gfatk extract.

The number of iterations of searching for neighbouring nodes can be modified.

It’s a naive algorithm, but it’s fast enough for our purposes.

Auto Trait Implementations

impl RefUnwindSafe for GFAungraph

impl Send for GFAungraph

impl Sync for GFAungraph

impl Unpin for GFAungraph

impl UnwindSafe for GFAungraph

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct gfatk::gfa::graph::GFAungraph

Tuple Fields

Implementations

impl GFAungraph

pub fn recursive_search(
    &self,
    sequence_id: Vec<usize>,
    iterations: i32,
    collect_sequence_names: Vec<NodeIndex>,
    graph_indices: GFAGraphLookups
) -> Result<Vec<usize>>

Auto Trait Implementations

impl RefUnwindSafe for GFAungraph

impl Send for GFAungraph

impl Sync for GFAungraph

impl Unpin for GFAungraph

impl UnwindSafe for GFAungraph

Blanket Implementations

impl<T> Any for T where
T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where
T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where
T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where
U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for T where
U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

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

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct gfatk::gfa::graph::GFAungraph

Tuple Fields

Implementations

impl GFAungraph

pub fn recursive_search( &self, sequence_id: Vec<usize>, iterations: i32, collect_sequence_names: Vec<NodeIndex>, graph_indices: GFAGraphLookups) -> Result<Vec<usize>>

Auto Trait Implementations

impl RefUnwindSafe for GFAungraph

impl Send for GFAungraph

impl Sync for GFAungraph

impl Unpin for GFAungraph

impl UnwindSafe for GFAungraph

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

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

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

pub fn recursive_search(
&self,
sequence_id: Vec<usize>,
iterations: i32,
collect_sequence_names: Vec<NodeIndex>,
graph_indices: GFAGraphLookups
) -> Result<Vec<usize>>

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,