Pathfinding Algorithms

What are they? A pathfinding algorithm attempts to find the shortest path between two points given the presence of obstacles. This is done through the utilization of various pre-determined characteristics unique to each algorithm. This particular program features graph search algorithms.

• How do They Work?

• Below is a list of algorithms that can be found in PathVis along with a brief description of how each one works.

Adding Walls

Click on the grid to add a wall. Generate mazes and various other patterns using the "Generate" tab in the control panel. Walls are viewed as impenetrable by all algorithms.

Medial Target Placement

Click the "Toggle Medial Target Placement" button in the control panel to summon in a medial target. Click and drag it around the grid to modify its position. To remove it, click the toggle button again.

Realtime Recalculations

After the initial visualization process has been completed, you may click on and move any node to another position on the grid. The shortest path and visited nodes will then be recalculated instantaneously.