Description: According to data from the keyboard to create (Fig. storage structure can be the adjacency matrix or adjacency list), and the graph depth-first search and breadth-first search (the type of experiment: validation type) 1) Problem Description: In the main program to provide The following menu: 1 ... 2 ... diagrams of depth-first traversal breadth-first traversal Figure 3 ... 0 ... the end of Figure 2) experimental requirements: graph adjacency list can be stored or adjacency matrix define the following procedure: CreateGraph (): press from the keyboard The data set Figure DFSGrahp (): depth-first traversal Figure BFSGrahp (): breadth-first traversal graph
To Search:
File list (Check if you may need any files):
图的程序.c