Pathfinding Visualizer

Visualize Dijkstra's and A* algorithms on directed and undirected graphs

Instructions:

  • Click anywhere on the canvas to add nodes.
  • How to Add Edges:
    1. Click a node to select it (it will be highlighted).
    2. Click the Add Edge button.
    3. Click another node to connect to (you'll be prompted for the edge weight).
    4. For undirected graphs, edges work in both directions.
  • Use the toggle buttons to select start/end nodes for pathfinding.
  • Toggle between directed and undirected graph modes.
  • Choose an algorithm and click Run Algorithm to find the shortest path.
Click anywhere to add nodes • Select a node, then click "Add Edge" to connect

Algorithm Status

Graph Type:Undirected
Start Node:Not selected
End Node:Not selected

Node Legend:

Normal Node
Visited by Algorithm
Final Path Node
Selected Node

Edge Legend:

Normal Edge
Path Edge