Struct gt_graph_path::GraphPath

pub struct GraphPath<'a, G: Graph> { /* fields omitted */ }

Methods

impl<'a, G: Graph> GraphPath<'a, G>

pub fn new(graph: &'a G) -> Self

pub fn new_with_initial_size(graph: &'a G, size: usize) -> Self

pub fn from_vec(graph: &'a G, src: Vec<G::Node>) -> Self

pub fn push_back(&mut self, n: G::Node)

pub fn inner_path(&self) -> &Vec<G::Node>

pub fn inner_path_mut(&mut self) -> &mut Vec<G::Node>

impl<'a, N, D, G> GraphPath<'a, G> where
    N: Copy + PartialEq,
    D: Copy + InterChangeUsize,
    G: Graph<Node = N, Dims = D>, 

pub fn is_valid(&self) -> bool

Trait Implementations

impl<'a, G: Clone + Graph> Clone for GraphPath<'a, G> where
    G::Node: Clone, 

fn clone(&self) -> GraphPath<'a, G>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a, G, N> PartialEq<GraphPath<'a, G>> for GraphPath<'a, G> where
    N: PartialEq,
    G: Graph<Node = N>, 

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use] fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<'a, G, N, D> Debug for GraphPath<'a, G> where
    N: PartialEq + Binary,
    D: InterChangeUsize,
    G: Graph<Node = N, Dims = D>, 

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.