Pathfinding using Dijkstra's Algorithm
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:
- Define a Graph class to store the nodes and edges of the graph.
- Implement Dijkstra's Algorithm to find the shortest path.
- Export the implemented function for testing.
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).