CrystalPathFinding (CPF)
Simple and effective library with an open source intended for the searching of the shortest paths by algorithms A/WA for maps based on tiles with 4 (simple), 8 (diagonal/diagonalex) or 6 (hexagonal) neighbors.
Library features:
Cross-platform: Windows x86/x64, Linux x86/x64, Mac OS, iOS, Android, Windows Mobile, and also other platforms accessible to the compilers Delphi and FreePascal
Extremely high performance
Smart constructing of a path
Limit is 16 million of cells (e.g. 4000x4000)
Sector test
Optional: OOP or procedural interface
Caching and search from several starting points support
Up to 255 types of tiles, weight is from 0.1 to 100.0
Contains demonstration projects
[
](https://github.com/d-mozulyov/CrystalPathFinding#help)Help
