Graph single pair shortest path algorithms:

• Dijkstra
• AStar
• Bi-Dijkstra
• Bi-AStar
• ALT (random, planar, avoid)
• Bi-ALT (random, planar, avoid)
• Tests
• BMP visualization

TODO:

• TNR

Build

make

Test

make test