This interactive A* algorithm visualizer provides a clear and intuitive way to explore the A* pathfinding algorithm on weighted graphs. Ideal for students, educators, and enthusiasts alike, the tool enables users to visualize how the A* algorithm efficiently finds the shortest path between a start and goal node on a graph with varying edge weights.

The map features 44 cities across the United States, with distances based on real-life driving routes between each city. Users can select any city as the start or destination by using the search input at the bottom of the screen or by clicking directly on the map and choosing the respective option.

In the bottom-left corner, the adjacency graph displays the actual distances between cities and updates in real time as the algorithm progresses. Users can expand this graph for a more detailed view. The visualization speed can be adjusted in the bottom-right corner, allowing for closer inspection of each step or faster playback.

Additionally, you can switch to Dijkstra's algorithm to compare the two methods by simply clicking the switch button, also located in the bottom-right of the screen. This feature lets you see the differences in how each algorithm processes the graph and determines the shortest path.

Explore, learn, and enjoy as you dive into the mechanics of heuristic-based pathfinding and witness the A* algorithm in action!