Pathfinding using Dijkstra's Algorithm

Medium
12.5% Acceptance

In this hands-on lab, you will implement Dijkstra's Algorithm to find the shortest path between two nodes in a graph. You will complete the following tasks:

  1. Define a Graph class to store the nodes and edges of the graph.
  2. Implement Dijkstra's Algorithm to find the shortest path.
  3. Export the implemented function for testing.

Graph Representation

The graph will be represented using an adjacency list. Each node will be an integer, and an edge between two nodes will have a weight (a positive integer value).