Struct pathtracer::Network

pub struct Network<T: Draw + Hash + Copy> {
    pub hash_map: [Option<T>; 666],
}

Enables traversing through a network of connected nodes.

Checking if a path is valid and setting new paths.

Fields

hash_map: [Option<T>; 666]

Methods

impl<T: Draw + Hash + Copy> Network<T>

pub fn new(elements: Vec<T>) -> Self

impl Network<Node>

pub fn path<'a>(&'a self, a: &str, b: &str) -> Result<Vec<Node>>

Calculates the path from node A to node B.

Examples

let nodes = Node::from_list(&[(0, 0), (10, 10), (20, 20), (30, 30)]);
let mut nodes = Node::linked_list(nodes);
let path = Network::new(nodes).path("A", "D").unwrap();
assert_eq!(path.len(), 4);

pub fn path_rev<'a>(&'a self, a: &str, b: &str) -> Result<Vec<Node>>

Mimics path behaviour but works in reverse, Meaning stepping back in the links.

pub fn get(&self, element: &str) -> Option<Node>

Returns if the given hash exists in the network.

Examples

let nodes = Node::from_list(&[(0, 0), (10, 10), (20, 20), (30, 30), (40, 40)]);
let network = Network::new(nodes.clone());
assert!(network.get("A").is_some());
assert!(network.get("F").is_none());

Trait Implementations

impl<T: Clone + Draw + Hash + Copy> Clone for Network<T>

fn clone(&self) -> Network<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Copy + Draw + Hash> Copy for Network<T>