Realize undirected graph (or digraph) express storage and output of the graph breadth-first (or depth-first) traversal. The system has the following features: 1. Initialization. From the keyboard input graph Vertices and edges. 2. The corresponding output map of the store said. 3. Output graph breadth-first traversal sequence. 4. Output graph depth-first traversal sequence.

graph
.....\graph
.....\.....\Graph.cpp
.....\.....\Graph.h
.....\.....\LAB05.dsp
.....\.....\LAB05.dsw
.....\.....\LAB05.ncb
.....\.....\LAB05.opt
.....\.....\StdAfx.cpp
.....\.....\StdAfx.h
.....\.....\张娟05.cpp
.....\graph.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．