a year agoThis clearly isn't the shortest path bro. See it carefully and just think about it.
a year ago🧭 Dijkstra finds the shortest path from one node to all others in a weighted graph! Time Complexity: → With Min-Heap: O((V + E) log V) Used in GPS, network routing, and... exam nightmares 😵💫
