pathfinding

Personal project to teach myself pathfinding and stuff

dependencies

• com.airhacks:afterburner-topgun
• javax.inject:javax.inject
• com.google.guava:guava
• it.unimi.dsi:fastutil
• de.lighti.clipper (http://www.lighti.de/projects/polygon-clipper-for-java/)

pathfinders

• A*
• BFS
• DFS
• Dijkstra
• Fringe
• IDA*
• IDDFS
• JPS
• Theta
• Lazy Theta

searchspaces

• Graph
• Grid
• NavMesh
• QuadTree

TODO

• QuadTree does not currently permit traveling diagonally between equal sized nodes
• Implement Linear QuadTree instead/also?
• Implement HOT queues?
• Refactor node to not explicitly depend on Vertex?

Thoughts

• how to handle pathfinder specific rendering needs, such as jps peeked nodes, and hpa abstracted graphs?
• editable and searchable graph maps should probably be separated from the rest. right?