20182332 "Data Structures and object-oriented programming," nine test report
Course: "Programming and Data Structures"
Class: 1823
Name: Sheng Guorong
Student ID: 20182332
experiments Teacher: Johnny
experiment Date: December 3, 2019
Compulsory / Elective: Compulsory
1. Experiment:
Comprehensive Practical completion FIG.
(1) Initialization: The screen prompts (e.g.: input an undirected graph, the input 2 as a directed graph) Initialize a directed graph (available adjacency matrix, can also be used adjacent table) to map and, FIG. defines its own (the number of vertices, the number of edges, it is recommended to FIG drawn on rough paper, and then enter the number of vertices and edges) (2 points)
traversing (2) of FIG: complete a directed graph and undirected graph traversal (depth and breadth first traversal) (4 points)
(3) have completed the sort topography, and outputs the output sequence or topological sort exists FIGS ring (3 points)
(4) to complete the minimum spanning tree graph ( Kruscal Prim's algorithm or algorithms may be), and output (3 min)
(5) has completed to solve (Dijkstra) to a single-source shortest path diagram (3 points)
2. Experimental procedure and results:
3. Experimental problems encountered in the process and settlement process
- Null pointer:
Analysis: incorrect data
Correction: stepping through the data for errors.
Impressions
Look not understand. . Understood not in place