Graph Theory Application in City Distance Calculation
Published:
This project presents the implementation of a program designed to optimize travel routes between seven major cities using graph theory and adjacency matrices. By prompting the user to input the number of cities and an adjacency matrix representing the distances between them, the program calculates the shortest paths from a selected starting city to all other cities. The report details the terminal-based user interface, the process of selecting cities and entering data, and the computation of minimum distances and corresponding routes. This work exemplifies the practical application of data structures and programming concepts in solving real-world problems related to urban network optimization.