Skip to content

navsukumar/Djikstra-Algorithm-Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This is a web application that visualizes the shortest path between two points in a maze like scenario. The application will first prompt you to provide the desired locations of the starting and ending points. THe application will then load a grid with the starting point in green and the ending point in red. The user can click on grid points to set up walls. Finally, when the user clicks the visualize button, the app will use Djikstra's algorithm to determine the shortest path betwen the two points that does not go through any of the walls that the user has set up.

To run the application, use npm start

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published