SeniorSenior (6–10 yrs)CodingPythonSystem DesignGoogleUberAmazon
Dijkstra Shortest Path
Explain Dijkstra's algorithm and implement shortest distances from a source in a weighted directed graph with non-negative weights.
Answers use simple, clear English.
Time: O((V+E) log V)Space: O(V+E)
Confidence
#graph#shortest-path