Beginner · Research
Dijkstra's algorithm
Visual diagram · (in preparation) · Math · (in preparation) · Worked example · 3 difficulty levels.
TL;DR. An algorithm that finds the shortest paths from a single source node to all other nodes in a graph with non-negative edge weights.
Technical Definition
An algorithm that finds the shortest paths from a single source node to all other nodes in a graph with non-negative edge weights.
How it works
Dijkstra's algorithm is a fundamental graph traversal algorithm used to find the shortest path between two nodes in a weighted graph. It works by iteratively exploring the graph, always selecting the unvisited node closest to the starting node, and updating the distances to its neighbors. It is widely used in network routing and mapping applications.
Related Concepts
- Graph theory — The study of graphs, which are mathematical structures used to model relationships between objects.