Trait DistanceMap 

pub trait DistanceMap<K> {
    // Required methods
    fn get(&self, node: NodeId) -> Option<&K>;
    fn insert(&mut self, node: NodeId, dist: K);

    // Provided method
    fn contains(&self, node: NodeId) -> bool { ... }
}

A map from nodes to distances/costs.

This trait abstracts over different distance map implementations, allowing algorithms to work with various storage strategies.

Required Methods

fn get(&self, node: NodeId) -> Option<&K>

Gets the distance to a node, if known.

fn insert(&mut self, node: NodeId, dist: K)

Sets the distance to a node.

Provided Methods

fn contains(&self, node: NodeId) -> bool

Returns true if the node has a recorded distance.

Implementations on Foreign Types

impl<K> DistanceMap<K> for HashMap<NodeId, K>

fn get(&self, node: NodeId) -> Option<&K>

fn insert(&mut self, node: NodeId, dist: K)

Implementors