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.

C++源程序.txt
Cpp1.cpp
Cpp1.exe
图形数据结构.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．