Master Dijkstra's Algorithm, the greedy single-source shortest-path method for graphs with non-negative weights. Read weighted edges, build the full distance computation in your language of choice, and answer point-to-point and farthest-vertex queries.
Prerequisites:
- Knowledge of a programming language of your choice.
- Familiarity with basic graph traversal (BFS/DFS).
