PathForge
C++17 • SFML • Web Demo
A* Search (Manhattan)
Dijkstra's Algorithm
Breadth-First Search (BFS)
Depth-First Search (DFS)
Draw Wall (Cost ∞)
Draw Weighted Terrain (Cost 5)
Eraser
Generate Maze
Speed
• Visualize
Clear Path
Reset Grid
Algorithm:
A*
Nodes Explored:
0
Shortest Path Length:
0
Path Cost:
0
Time:
0 ms
Start Node (drag to move)
Target Node (drag to move)
Obstacle / Wall
Weighted Terrain (Cost 5)
Explored Frontier
Shortest Path