Shortest Path Problem Analysis Using Dijkstra's Algorithm Project

This project examines the application of Dijkstra's algorithm in solving the shortest path problem within computer networks and map-related systems. The assignment begins with an introduction to the shortest path problem, graph theory, and the motivation behind studying Dijkstra's algorithm. The core of the project involves calculating the shortest path and alternative paths (re-routing) between a source and destination, considering both distance and fare. The project includes tasks such as calculating and displaying the shortest distance and fare, removing nodes to determine new shortest routes, and displaying all possible paths and fares. The literature review covers graph representations using adjacency matrices and arrays of edges, while the solution section provides a detailed explanation and implementation of Dijkstra's algorithm. The project concludes with an evaluation of the algorithm, highlighting its time complexity and potential for improvement through artificial intelligence techniques.