Trait sfcpl::graph::def::Graph

pub trait Graph<'a> {
    type NodeId: Copy;
    type Iter: Iterator<Item = Self::NodeId>;
    fn len(&self) -> usize;
    fn is_empty(&self) -> bool;
    fn index(&self, a: Self::NodeId) -> usize;
    fn neighbors(&'a self, a: Self::NodeId) -> Self::Iter;
}

Associated Types

type NodeId: Copy

type Iter: Iterator<Item = Self::NodeId>

Loading content...

Required methods

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn index(&self, a: Self::NodeId) -> usize

fn neighbors(&'a self, a: Self::NodeId) -> Self::Iter

Loading content...

Implementors

impl<'a> Graph<'a> for Dijkstra

type NodeId = usize

type Iter = Cloned<Iter<'a, Self::NodeId>>

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn index(&self, a: Self::NodeId) -> usize

fn neighbors(&'a self, a: Self::NodeId) -> Self::Iter

impl<'a> Graph<'a> for UnweightedGraph

type NodeId = usize

type Iter = Cloned<Iter<'a, Self::NodeId>>

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn index(&self, a: Self::NodeId) -> usize

fn neighbors(&'a self, a: Self::NodeId) -> Self::Iter

impl<'a, W> Graph<'a> for WeightedVertexGraph<W> where
    W: Copy + Clone + 'a, 

type NodeId = (usize, W)

type Iter = Cloned<Iter<'a, Self::NodeId>>

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn index(&self, a: Self::NodeId) -> usize

fn neighbors(&'a self, a: Self::NodeId) -> Self::Iter

Loading content...