Description: First, program analysis 1. To the adjacent multi-table for the storage structure, to achieve connectivity and non-connected undirected graph with a depth-first breadth-first traversal. 2. Node-based map is not more than 30, each node with a number that. Map by entering the input side of a graph, and each side for a few right. 3. Problem Description: 4. To the first node as a starting point, respectively, under the output of each node traversal visit sequences and the corresponding spanning tree edge.
To Search:
File list (Check if you may need any files):
Download