图邻接矩阵 邻接表的建立c++_数据结构课程设计（国外英文资料）.doc

图邻接矩阵 邻接表的建立c++_数据结构课程设计（国外英文资料） One. Requirements analysis 1. The operation environment Hardware: computer 486/64M Operating system: WIN9x/WIN2000 / WIN/WIN ME Related software: vistualc + + The function implemented by the program: (1) the adjacency list is established and displayed. (2) depth-first traversal, displaying the traversal results. (3) the topological sort of the graph, showing the sort results. (4) the shortest path of a certain vertex to all other vertices. The input of the program, including the input data format and description (1) enter the number of vertices, and each vertex information (data format is plastic) (2) enter edges and weights (data formats are plastic) The output of the program, the form of program output (1) the adjacency list of the output diagram, the depth first traversal results, and the topological sort results. (2) enter a shortest path to a certain vertex to all other vertices. 5. Test data Design instructions The idea of algorithmic design Establish the diagram class and establish the relevant 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 Third, engine result and experience The actual completion of the situation Main program reference material data structure - c + + edition. The performance analysis of the program But continuous built figure Problems in the process and their solutions. The compilation is not wrong, but the result is a problem. Solution: although the programs compilation passes, there is no problem with th