/Lightweight-A-Star

Lightweight headers-only A* pathfinding algorithm implementation written in C++11 using templates. Based on graph and node adapters.

Primary LanguageC++GNU General Public License v2.0GPL-2.0

Lightweight A-Star

Lightweight A-Star pathfinding implementation written in C++11 using templates. Easy to use in your own project - just specify adapter for your graph/map and nodes and you're good to go!
This implementation uses onyl C++ standard libraries so you don't even have to load other libraries to use it.

Requirements

  • C++11 supporting compiler (tested on VS2013 and GCC 4.9.2)

Compilers tested

  • MSVC (tested on Visual Studio 2013)
  • GCC (tested on 4.9.2)

Dependencies

None! :)

License

GNU GPLv2.

Examples of usage

Example of usage can be found in files example*.cpp (with comments).

exampleInheritance.cpp - uses inheritance to implement adapter functionality. exampleFunctional.cpp - uses binded functions (std::function<>) to implement adapter functionality.