Welcome to PathVisor
Pick an algorithm to start.
Click the Start (π¦) or End (π§) node once to change its position.
Use the Player to control the speed and execution of the algorithm. Click the right and left arrows for step-by-step analysis.
Select Walls or Weights from the menu and draw them on the grid.
Walls represent impassable obstacles that the algorithm cannot traverse,β β forcing it to avoid them.
Weights are nodes that the algorithm can pass through, but with additional costs.β β A tile with a β2β has a low cost.β β A tile with a β9β however has a higher cost, making it less desirable for the algorithm to choose, unless itβs the only optimal path.β β The algorithm prefers to choose paths with lower costs.
Note: ββ Only the Dijkstra and A-star algorithms work with weighted nodes; β other algorithms treat them as regular nodes.
Visited nodes can't be modified.β β To reset the grid, click the button on the bottom right.
Created by Raj Shah