SHORTEST PATH BETWEEN TWO NODES
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a graph represented by an adjacency matrix, implement a function that finds the shortest path between two given nodes using Dijkstra's algorithm.
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<