The project is about dijkstra's algorithm working on weighted graph data structure to find the shortest path among two nodes. The project uses p5 js to project random graphs on a canvas and dijkstra's algorithm is used to find out the shortest path between two given nodes.
-
Notifications
You must be signed in to change notification settings - Fork 1
An implementation of Dijkstra's Algorithm used to find minimum cost path between two nodes of a weighted graph. P5.js helps visualizing the graph as well as path taken by Dijkstra's Algorithm on canvas.
theunderdogdev/algo-dijkstra
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An implementation of Dijkstra's Algorithm used to find minimum cost path between two nodes of a weighted graph. P5.js helps visualizing the graph as well as path taken by Dijkstra's Algorithm on canvas.
Topics
Resources
Stars
Watchers
Forks
Packages 0
No packages published