Read the specifications and utilize the additional files. Here is a summary of t

Read the specifications and utilize the additional files. Here is a summary of the specifications. Always rely on the specifications and additional documents.
Summary: Create a VS 2022 Solution/Project name: CS320P03LastName. Use a x64 Debug Configuration.
Zip up your entire project, test files, and word document describing what works and what doesn’t work. Analysis IS Needed as stated in the project. Get started on this early. This has several abstraction layers and many modules and many tests will be needed. Isolate parts and test them. Do not try to write all the code at once. The header file, graph.h, has an implelmentation of an adjacency matrix. Note the vertices are numbered 0, 1, …, n-1. Also provided is a member function to read the file with the format of data for a graph as specified. The declaration for read is: void read(ifstream& infile). You need to get the file name as indicated in specification and have it opened and “connected” to a ifstream object and passed as a parameter to read. The read member function also builds an adjacency list representation of the graph because of the format of the input data. Because the dynamic programming algorithm is based upon the adjacency matrix represention, the adjacency list is converted to an adjacency matrix. There is also a map object that keeps track of the label of each node. Internally the nodes are numbered 0, 1, … n-1. However, there can be a string name used (such as “Chicago”) for a given node/vertex. The node string label must be used in presenting the min-tour/min-circuit.