Description: Construct a directed graph or undirected graph, choose a storage structure, respectively, the output of its depth-first and breadth-first results. To their own intention to draw a point of not less than eight, edge not less than six of the directed graph or undirected graph with adjacency matrix or adjacency list of the storage structure, type map information and the edge of vertex information, and then call the depth-first and breadth first search algorithm to see the results are correct.
To Search:
File list (Check if you may need any files):
Download