Dijkstra's Algorithm
Term side of the Card
Topic: Search Algorithms
Unit title: Dijkstra's Algorithm
Categories: Algorithm
Explanation side of the Card
Explanation: The shortest-path algorithm that finds the minimum distance from a starting node to all other nodes in a non-negative weighted graph. Works efficiently, achieving O(E log V) complexity.