Simple Rust implementation of some pathfinding algorithms.

• Generate graph from a 2d vector of generic types implementing Walkable and AStarHeuristic traits.
• Find path between two elements generic type using A* search algorithm.

• Add more ways to generate graph.
• Other limitations are due to the used Graph library.
  • Edges have no weight.
  • Graph cannot be changed.

• Pierre-André Gagnon - Initial work - pag4k

This project is licensed under the MIT License - see the LICENSE.md file for details.