bsp_pathfinding/
heuristics.rs

1use glam::Vec2;
2
3pub fn euclidiean(start: Vec2, end: Vec2) -> f32 {
4    (end - start).length()
5}
6
7pub fn manhattan(start: Vec2, end: Vec2) -> f32 {
8    let x = end.x - start.x;
9    let y = end.y - start.y;
10    x.abs() + y.abs()
11}