A Java test bed for testing pathfinding algorithms. This project features a graphical display for various pathfinding algorithms.

Arbitrary pathfinding algorithms can be plugged into the interface for this project. The purpose is to practice and demonstrate the usage of the algorithms.

• Dijkstra
• A*
  • Depth-limited A* (see Lightning AI)
  • Annotated A* (see Lightning AI)
  • Heirarchical A*
• Boid (see Zergling Speed)

Some algorithms only work with certain graph formations. Nydus can generate the following graph shapes.

• 2D Maze (Grid)
• Free 2D space (integral coordinates) (see Lightning AI)
• Arbitrary graph (see StaircaseChallenge)