Graph Traversal Algorithms

Dijkstra's Algorithm

Greedy algorithm that determines the shortest path from a source vertex to all other vertices in a weighted graph with non-negative weights.

← Zurück