Struct cjdns_snode::pathsearch::dijkstra::Dijkstra

pub struct Dijkstra<T, W> {
    nodes: HashMap<T, Vec<(T, W)>>,
}

Dijkstra path search.

Fields

nodes: HashMap<T, Vec<(T, W)>>

Links node with tag <T> to the list of ajacent nodest with corresponding weights <W>.

Implementations

impl<T, W> Dijkstra<T, W>

pub fn new() -> Self

Create new instance with empty graph.

Trait Implementations

impl<T, W> GraphBuilder<T, W> for Dijkstra<T, W> where
    T: Eq + Hash,
    W: PartialEq + PartialOrd + Zero, 

fn add_node<I: IntoIterator<Item = (T, W)>>(&mut self, node_tag: T, links: I)

impl<T, W> GraphSolver<T, W> for Dijkstra<T, W> where
    T: Clone + Eq + Ord + Hash,
    W: Clone + PartialEq + PartialOrd + IntoOrd + Add<Output = W> + Zero, 

fn path(&self, from: &T, to: &T) -> Vec<T>

Find a path from from node to to node.

fn reverse_path(&self, from: &T, to: &T) -> Vec<T>

Find a reverse path from to node to from node.

fn path_search_tree(&self, start: &T) -> PathSearchTree<T>

Build a Path Search Tree from a given node.