Skip to content

About

This is my first algorithm based course work. I used Dijkstra algorithm for finding the shortest path between two points A (start) and B (end) on a randomly generated 10 *10 squared grid with blocked cells.

Stars

0 stars

Watchers

0 watching

Forks

Latest commit

 

History

3 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 

About

This is my first algorithm based course work. I used Dijkstra algorithm for finding the shortest path between two points A (start) and B (end) on a randomly generated 10 *10 squared grid with blocked cells.

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages