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.
theunderdogdev/algo-dijkstra
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.
JavaScript