Description: Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.
- [graph] - The main achievement of the plan steps:
- [graph_] - //Directed graph: directed graph, undire
- [Primalgorithm] - Prim algorithm for minimum spanning tree
- [Graph] - Map-building (including the adjacency ma
- [color] - Yellow proportion of the total image
- [ClientFTP] - To achieve a very simple file transfer,
File list (Check if you may need any files):
tu3.cpp
Download