Project Details

This project involves graph manipulation with vertices and edges. Divided into three parts, Part A calculates a Minimum Spanning Tree (MST) for efficient path construction. Parts B and C focus on approximating solutions to the Travelling Salesperson Problem (TSP) and finding optimal TSP routes, respectively. The program uses command-line options to specify modes MST, fast TSP, or optimal TSP. The project emphasizes proper command-line handling, input file formats, and graph representations. Then we output the correct distance and order for the given graph if there exists one.