Description: Require the use of adjacency matrix as the storage structure of an undirected graph, adjacency table as the storage structure of directed graphs, complete undirected graph and the establishment of the graph, and create good depth and breadth-first graph traversal. Specific implementation requirements: 1. Through the keyboard input graph vertices and edges information, construct an undirected graph, respectively, the adjacency matrix and adjacency to a table. 2. Are two graphs on the establishment of good depth and breadth-first traversal, the output corresponding traversal sequence. 3. Statistics of two graphs the number of connected components.
To Search:
File list (Check if you may need any files):
612109301 赵慧\prog2\adj_list_dir_graph.h
..............\.....\adj_list_graph_vex_node.h
..............\.....\adj_matrix_undir_graph.h
..............\.....\Debug\main.obj
..............\.....\.....\prog2.exe
..............\.....\.....\prog2.ilk
..............\.....\.....\prog2.pch
..............\.....\.....\prog2.pdb
..............\.....\.....\vc60.idb
..............\.....\.....\vc60.pdb
..............\.....\lk_list.h
..............\.....\main.cpp
..............\.....\node.h
..............\.....\prog2.dsp
..............\.....\prog2.dsw
..............\.....\prog2.ncb
..............\.....\prog2.opt
..............\.....\prog2.plg
..............\.....\utility.h
..............\.....\Debug
..............\prog2
612109301 赵慧
Download