A* Search Algorithm Calculator
Pro-Tip: Analyze the pre-loaded map below to see how A* balances edge costs and heuristics to find the shortest path, then verify it against the manual steps in theTheory Page.
How to Use?
- Move Nodes: Click and drag the center of any circle.
- Connect: Click and drag from a tiny gray dot to another node.
- Delete: Select a node or line, then press Backspace .
- Zoom & Pan: Use the mouse wheel to zoom. Click and drag the grid to pan.
Graph Type
Determine if paths act as one-way streets or two-way streets.
Loading Graph Visualizer...
Reference: Example Screenshot of a Solved A* Search Algorithm Problem
