Skip to content

This visualizer displays an A* Pathfinding algorithm’s order of evaluation for nodes and the current believed optimal path as the algorithm finds the shortest path from one start node to an end node through a user-made maze.

Notifications You must be signed in to change notification settings

hammadfarooqi/AStar-Pathfinding-Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A* Pathfinding Visualizer

Visualizer Screenshot

The A* Pathfinding Visualizer models a script's line of thinking using an A* Pathfinding algorithm to find the shortest path from one start node to an end node through a user-made maze

Table of Contents

Controls

  • Moving Start/End Nodes: Click on the current node location, then click again on the desired location
  • Creating walls: Holding the spacebar while hovering over an empty node will convert it to a wall (You can hold the spacebar and use your mouse as a brush to make chains of walls)
  • Running the simulation: Pressing the return/enter key will run the visualization of the A* pathfinding algorithm
  • Deleting a wall: Holding the backspace or delete key while hovering over a wall will convert it to an empty node
  • Clearing the board: Pressing the escape key will clear all walls and any previous path visualizations

Technologies

  • Python javascript
  • Pygame node.js

About

This visualizer displays an A* Pathfinding algorithm’s order of evaluation for nodes and the current believed optimal path as the algorithm finds the shortest path from one start node to an end node through a user-made maze.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages