Explorer

🧬 Features

• Based on Graph theory for more flexibility
  • Multiple graphs support, use the same nodes instances for differents graph instances
• Graph builder helper for 2D Arrays
  • Any access order supported ([x][y] or [y][x])
  • Diagonals move support, with or without corner-cutting
  • Toric maps support (maps wrapped on itself)
  • Jump Point Search (JPS) support for faster computations on uniform cost grids. (NB: Toric support isn't yet supported with JPS)
• 3 heuristics functions availables : Manhattan, Diagonals or Euclidian
  • Custom heuristic function also supported
• Variable cost support
• Multi-threading support (with Web Workers)
• Use of Binary Heaps and Connectivity to speed up calculations