Mengenal Shortest Path- Algoritma Djikstra

This algorithm can be used to calculate the shortest distance between one node and every other node in a weighted graph.

Click https://youtu.be/bZkzH5x0SKU?si=Za-YbzgHu-mXNZ0c link to open resource.