path-finding 0.8.0

This library provides a variety of path finding and graph operations. Work in progress.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123

use std::cmp::Eq;
use std::cmp::PartialEq;
use std::hash::{Hash, Hasher};

use crate::graph::Edge;

#[derive(Clone)]
pub struct Node {
    pub id: usize,
    pub edges: Vec<Edge>,
}

impl Node {
    pub fn from(id: usize, edges: Vec<Edge>) -> Node {
        return Node {
            id,
            edges,
        };
    }
}

#[derive(Clone)]
pub struct Vec3 {
    pub x: f32,
    pub y: f32,
    pub z: f32,
}

impl PartialEq for Vec3 {
    fn eq(&self, other: &Self) -> bool {
        return (self.x - other.x).abs() <= f32::EPSILON
            && (self.y - other.y).abs() <= f32::EPSILON
            && (self.z - other.z).abs() <= f32::EPSILON;
    }
}


impl Hash for Vec3 {
    fn hash<H: Hasher>(&self, state: &mut H) {
        let precision = 1e6;
        let x_int = (self.x * precision).round() as i32;
        let y_int = (self.y * precision).round() as i32;
        let z_int = (self.z * precision).round() as i32;

        x_int.hash(state);
        y_int.hash(state);
        z_int.hash(state);
    }
}

impl Eq for Vec3 {}

impl Vec3 {
    pub fn zeroed() -> Vec3 {
        return Vec3 {
            x: 0.0,
            y: 0.0,
            z: 0.0,
        };
    }

    pub fn from(x: f32, y: f32, z: f32) -> Vec3 {
        return Vec3 {
            x,
            y,
            z,
        };
    }

    pub fn euclidean_dist(&self, o: &Vec3) -> f32 {
        return ((o.x - self.x).powf(2.0) +
            (o.y - self.y).powf(2.0) +
            (o.z - self.z).powf(2.0)).sqrt();
    }

    pub fn manhattan_dist(&self, o: &Vec3) -> f32 {
        return (o.x - self.x).abs() + (o.y - self.y).abs() + (o.z - self.z).abs();
    }
}

#[test]
fn create_node_should_succeed() {
    let node = Node::from(1, vec![]);

    assert_eq!(1, node.id);
    assert!(node.edges.is_empty());
}

#[test]
fn create_zeroed_position_should_succeed() {
    let position = Vec3::zeroed();

    assert_eq!(0.0, position.x);
    assert_eq!(0.0, position.y);
    assert_eq!(0.0, position.z);
}

#[test]
fn create_position_should_succeed() {
    let position = Vec3::from(0.1, 0.2, 0.3);

    assert_eq!(0.1, position.x);
    assert_eq!(0.2, position.y);
    assert_eq!(0.3, position.z);
}

#[test]
fn test_euclidean_distance() {
    let position1 = Vec3::from(0.0, 0.0, 0.0);
    let position2 = Vec3::from(1.0, 1.0, 1.0);

    let dist = position1.euclidean_dist(&position2);
    assert_eq!(1.7320508, dist);
}

#[test]
fn test_manhattan_distance() {
    let position1 = Vec3::from(0.0, 0.0, 0.0);
    let position2 = Vec3::from(1.0, 1.0, 1.0);

    let dist = position1.manhattan_dist(&position2);
    assert_eq!(3.0, dist);
}