Description: A: purpose of the experiment:
(1) master plans storage ideas and storage implementation.
(2) control chart depth, breadth-first traversal algorithm ideas and program implementation.
(3) The common application of algorithms to master plans and program ideas to achieve.
(4) understand a directed acyclic graph, shortest path algorithms such as
II: test content:
The following experiment content, 1 and 2 will do the content, 3 for the election to do the content.
1 digraph
(1) keyboard input data, the establishment of a directed graph of the adjacency list, and outputs the adjacency table.
(2) in a directed graph based on the adjacency table to calculate the vertex degree, and output.
(3) has the adjacency table and output it as the basis for a topological sort of sequence.
(4) in the main function in a simple menu design, debugging the algorithm, respectively. (2) undirected graph
(1) the establishment of an undirected graph adjacency list, and
To Search:
File list (Check if you may need any files):
数 据 结 构 图操作.doc
Download