Skip to content

๐ŸŽฏ VanillaJS pathfinding visualizer using bunch of different shortest-path algorithms (A*, DFS, BFS, ...etc.)

License

Notifications You must be signed in to change notification settings

AbdallahHemdan/Pathfinding-Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 

History

47 Commits
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 

Repository files navigation

Pathfinding visualizer

๐ŸŽฏ Pathfinding Visualizer

GitHub contributors GitHub issues GitHub forks GitHub stars GitHub license


๐ŸŽˆ Pathfinding Visualizer (Click to try ๐Ÿš€)

Built VanillaJS pathfinding visualizer using bunch of different shortest-path algorithms (A*, DFS, BFS, ...etc.) and Generate the grid using maze-generation algorithm and add the ability of controlling the grid structure and the distribution of the blocks and the position of the source and the destination.

โš™ How it Works

  1. Users can drag around a start and end node and set them in any place.
  2. Users can then choose a speed of the visualization .
  3. Users can optionally choose to clear the maze or draw walls by dragging the mouse.
  4. Users can optionally randomize the walls in the maze and add more walls by dragging the mouse.

๐Ÿ“ท ScreenShots

๐Ÿ•ถ Demo