图邻接矩阵 邻接表的建立c++_数据结构课程设计（Graph adjacency matrix, adjacency table establishment, c++_ data structure curriculum design）.docVIP

图邻接矩阵 邻接表的建立c++_数据结构课程设计（Graph adjacency matrix, adjacency table establishment, c++_ data structure curriculum design） I. requirements analysis 1. running environment Hardware: computer 486/64M or more Operating system: WIN9x above, /WIN2000/WIN, XP/WIN, ME Related software: vistualC++ 2. functions implemented by the program: (1) establish and display the adjacency list of the graph. (2) depth first traversal, showing traversal results. (3) topological sorting of the graph shows the result of the sorting. (4) give the shortest path of a certain vertex to all other vertices. 3. program input, including the input data format and description (1) enter the top point, and each vertex information (data format for plastic) (2) input edge number and weight (data format is reshaping) 4. program output, the form of program output (1) adjacency list, depth first traversal result, topological sorting result of output graph. (2) the shortest path from any given vertex to all other vertices. 5. test data Two. Design instructions 1, the idea of algorithm design Build graph classes and build member functions. Finally, it is implemented in the main function. See the source code for the implementation of specific member functions. 2, the main data structure design notes Establishment of adjacency matrix and adjacency list. The depth first traversal of the graph, the topological ordering, and the shortest path between vertices. 3, the programs main template template, class, Type, class, Graph 4, the main function of the program Graph, link (), DFTraverse (), TopologicalOrder (), TopologicalOrder (), GetVertexPos (), ShortestPath Three, the results and experience 1, the actual completion of the note The main program reference material data structure - C++ version.. 2, program performance analysis Continuous construction drawing 3, the problems and solutions in the process. Compilation is not error, but the result is a problem. Solution: Although the compilation of the program can only