Skip to content

DFS, BFS, Dijkstra, and A* algorithm visualizer

Notifications You must be signed in to change notification settings

romdavid/Path-Finder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Path Finder

made-with-python

Path Finder is an algorithm visualizer for Depth First Search, Breadth First Search, Dijkstra, and A* (Astar) algorithms.

Setup

  1. Make sure python3 and pygame are installed
  2. Clone this repository
  3. Run PathFinder.py

Documentation

Keyboard Shortcuts

  • Esc is the same as the restart button
  • Space will pause/play an algorithm's animation

Start & End

  • Start End
    • Note: After clicking Change Start & End select the block (start/end) you want to change, then select where you want to move it. Click Done when finished.

Walls

  • Left click to place walls, drag mouse to place them faster. Right click to delete walls.

Weights

  • Every block except walls has a weight value. You can increase a weight's value by left clicking on a weight. Hold left click and drag to increase the value of multiple weights faster. Right click to delete weights.

  • The weight values increase by a factor of 2.

    Color Value
    1
    2
    4
    8
    16

Algorithms

  • The turquoise block means the node is discovered but not officially visited.

  • The blue block means the node has been officially visited.

About

DFS, BFS, Dijkstra, and A* algorithm visualizer

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages