Title:
Without-the-adjlink-to-map
Download
Description: Input from the keyboard without the number of vertices to the graph G v and the number of edges e. Establishment of a v vertices, e edges undirected graph consisting of G, with adjacency matrix. V vertex value from keyboard input, the element type of character. e edges of the information is also entered from the keyboard. Call graph, respectively, the depth first search, breadth-first search graph traversal and output the corresponding sequence.
To Search:
File list (Check if you may need any files):
Without the adjlink to map.doc
