2 releases
Uses new Rust 2024
| 0.1.1 | May 26, 2025 |
|---|---|
| 0.1.0 | May 26, 2025 |
#1669 in Algorithms
32 downloads per month
1.5MB
129 lines
Quantized-pathfinding
Motivation
I had a picking plugin, which is getting bloated. So i decided to separate the algorithmic part.
Currently working algorithm(s)
quantized_astar
How does this work
This preprocesses the input before the target algorithm(pathfinding) and roughly recovers the output.
flowchart LR
subgraph quantized-pathfinding
direction LR
quantizer --> algorithm
algorithm --> dequantizer
end
id1[/input/] --> quantized-pathfinding
quantized-pathfinding --> id2[/output/]
Why shoud i use this?
Indeed(to just use algorithm), you don't need to use this. You can, for example, implement float-like type to directly work with pathfinding](https://docs.rs/pathfinding/latest/pathfinding/).
QnA
What'd be different from theory?
It's finite. Use the boundry instead of infinity in from-book procedures.
Any unobvious catch?
The input type seems very generous but it may need more traits or method as you need within the explorative body of the algorithm.
Dependencies
~1.3–2MB
~36K SLoC