How to use:
1. Click on the map to set start point
2. Click again to set end point
3. Choose algorithm and click "Find Route"
Selection Status
○ Click map to set start point
○ Click map to set end point
Dijkstra
O((V+E) log V)
Bidirectional
≈ 2·O((V+E) log V) frontier cut
A*
O(b^d)
Node Exploration (last 3 runs)
Dijkstra
Bidirectional
A*