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

图邻接矩阵 邻接表的建立c++_数据结构课程设计（Graph adjacency matrix adjacency list of c + + _ data structure curriculum design） One. Demand analysis 1. Operating environment Hardware: computer 486/64M Operating system: WIN9x/WIN2000 / WIN/WIN ME Related software: vistualc + + 2. Functions implemented by the program: (1) the adjacency list is established and displayed. (2) depth-first traversal, displaying the results of traversal. (3) topological sort of the graph, showing the sorting results. (4) give the shortest path of a certain vertex to all other vertices. 3. Input of program, including input data format and description (1) input vertex number and vertex information (data format is plastic) (2) input edge number, and weight (data format is plastic) 4. The output of the program, the form of program output (1) the adjacency list of output graph, depth first traversal result, topological sort results. (2) enter the shortest path of a certain vertex to all other vertices. 5. Test data 2. Design description 1. The idea of algorithm design Create a graph class to establish the associated member function. Finally, it is implemented in the main function. The implementation of the specific member function is asked to see the source program. Major data structure design instructions The map adjacency matrix, the adjacency list is established. The depth of the graph is the shortest path between the sequence of the topological and the vertices. The main template of the program template class Type class Graph The main function of the program Graph, link (), DFTraverse (), TopologicalOrder (), TopologicalOrder (), GetVertexPos (), ShortestPath 3. Result and experience of the machine 1. The actual completion of the situation Main program reference material data structure - c + + edition. 2. Performance analysis of the program Continuous construction 3. Problems and solutions in the process. The compilation is not wrong, but the result is a problem. Solution: although the programs compilation i