4 QUESTIONS
Q1 1 / 4 medium
Dijkstra's Algorithm
Given a weighted directed graph with non-negative edge weights, find the shortest path from a source vertex to all other vertices.
What is the key data structure or technique required?
Given a weighted directed graph with non-negative edge weights, find the shortest path from a source vertex to all other vertices.
What is the key data structure or technique required?