[Experimental data structures and algorithms integrated information management system] scenic iterative development

Disclaimer: This article is a blogger original article. Reproduced please contact bloggers authorization. Bloggers public micro-channel number] [Department of Knowing and Doing the campus. https://blog.csdn.net/cxh_1231/article/details/89566339

• Description: This is the Wuhan University of Technology School of Computer data structures and algorithms integrated experimental curriculum Second project: scenic information management system iterative development code.
• Source Download: Click here to download (Operating Environment: VS2017)
• Focus on micro-channel public number [ knowing and campus sinks ] available for free download all the source code ( click to see resources ).
• >> Click here for a summary WUTer experimental computer science
• Paper come Zhongjue know this practice is essential.

 Experimental teaching materials:

Purpose:

1. Defining and storing master configuration diagram of FIG;
2. Master the methods and applications to create map map;
3. Two master FIG traversal methods and applications;
4. Master Dykstra (Dijkstra) algorithm and application;
5. Understand the concept of the minimum spanning tree;
6. Master Primm (Prim) algorithms and applications;
7. In C ++, data structures defined graph, combined with iterative development thinking to achieve "scenic information management system"; using a depth-first search algorithm "Attractions navigation" feature development; using the Dykstra algorithm "Search Shortest Path" feature development; Prim algorithm using minimum spanning tree "laying circuit plan" functional development.

Experimental requirements:

1. Create a map Attractions: Vex.txt read from the file attractions information, road information is read from Edge.txt file and create information based on the reading of scenic scenic spots chart;
2. Attractions Query: Enter the desired number of queries attractions, then the query information and attractions in the console output, and output information of the attractions in neighboring attractions;
3. Attractions navigation: prompt the user for starting spots number, and then start from the beginning attractions, scenic traverse all the sights, no duplicate records of all paths, and finally to query all paths displayed on the console;
4. Search shortest path: first prompts the user to enter the start and end numbers sights and attractions number, and then search all paths between two spots to find the shortest path from which the output of the shortest path and the shortest path length in the console;
5. Laying circuit programming: According to FIG scenic spots, a minimum spanning tree structure, the shortest design a set of laying lines, and the method can be passed through each spot are able to meet, and then outputs the road to be laid, and the laying of the circuit in the console circuitry length, the total length of the final output circuit laid.

Project Screenshot:

Experiment code:

Source Download: Click here to download (Operating Environment: VS2017)

The experiment more source files, a few more lines, you need to download your own review.

Screenshot operating results:

The following screenshots are from experiment reported shots!

Run the program, using screen capture software to run the results of the various parts of screenshots, as follows:

• Creating scenic spots run shot chart:

• Information inquiry attractions run shot:

• Attractions navigation run shot:

• Search shortest path run shot:

• Laying run shot circuit plan:

 End！