blitz-path 0.2.0

Implementations of the A* and JPS pathfinding algorithms.
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

use movingai::Coords2D;
use std::cmp::Ordering;

use crate::utils::distance;

#[derive(Debug, Copy, Clone)]
pub struct Node {
    pub f: f64,
    pub g: f64,
    pub h: f64,
    pub position: Coords2D,
    pub parent: Coords2D,
}

impl Node {
    pub fn new(g: f64, h: f64, position: Coords2D, parent: Coords2D) -> Node {
        Node {
            f: g + h,
            g,
            h,
            position,
            parent,
        }
    }

    pub fn from_parent(parent: &Node, position: Coords2D, goal: Coords2D) -> Node {
        //Calculate distances
        let distance_to_goal = distance(position, goal);
        let distance_from_parent = distance(parent.position, position);
        let total_distance = parent.g + distance_from_parent;

        //Build node from distances
        Node {
            f: total_distance + distance_to_goal,
            g: total_distance,
            h: distance_to_goal,
            position: position,
            parent: parent.position,
        }
    }
}

impl PartialOrd for Node {
    fn partial_cmp(&self, other: &Node) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl Ord for Node {
    fn cmp(&self, other: &Node) -> Ordering {
        // This is reversed on purpose to make the max-heap into min-heap.
        other.f.partial_cmp(&self.f).unwrap()
    }
}

impl PartialEq for Node {
    fn eq(&self, other: &Node) -> bool {
        self.position == other.position
    }
}

impl Eq for Node {
    // add code here
}