mirror of
https://github.com/bensuperpc/astar.git
synced 2026-05-05 19:05:24 +02:00
Improve Templates name and readme
Signed-off-by: Bensuperpc <bensuperpc@gmail.com>
This commit is contained in:
@@ -1,6 +1,6 @@
|
||||
# astar
|
||||
|
||||
Fast and easy to use header only 2D astar algorithm library in C++20.
|
||||
Fast and easy to use standalone header only 2D astar algorithm library in C++20.
|
||||
|
||||
I made it for learning how the astar algorithm works, try to make the fastest, tested and configurable as possible for my needs (future games and works).
|
||||
|
||||
@@ -24,6 +24,20 @@ It is an [astar algorithm](https://en.wikipedia.org/wiki/A*_search_algorithm), t
|
||||
* [x] Debug mode in template argument and lambda function
|
||||
* [x] Support direct access and not access to the map
|
||||
* [x] Unit tests and benchmarks
|
||||
* [ ] Working CI (WIP)
|
||||
|
||||
### Heuristic function
|
||||
|
||||
You can set the heuristic function to calculate the distance between two points and return the cost.
|
||||
|
||||
| Heuristic | C++ Function | Description |
|
||||
|-----------|--------------|-------------|
|
||||
| euclidean | AStar::Heuristic::euclidean | Default |
|
||||
| manhattan | AStar::Heuristic::manhattan | |
|
||||
| octagonal | AStar::Heuristic::octagonal | |
|
||||
| chebyshev | AStar::Heuristic::chebyshev | |
|
||||
| euclideanNoSQR | AStar::Heuristic::euclideanNoSQR | |
|
||||
| dijkstra | AStar::Heuristic::dijkstra | Always return 0 |
|
||||
|
||||
# How to use it
|
||||
|
||||
|
||||
Reference in New Issue
Block a user