Using c language data structure used to establish the adjacency table thought the storage structure, free of the graph depth-first traversal and breadth-first traversal. User-specified vertex as a starting point, the output of each traverse were the culmination of access under the sequence. The vertex set of not more than 30, with a number that each vertex (if a graph has N vertices, then their numbers were 1,2, ..., N). By entering the graph all edges entering a graph, each edge two vertices numbers right, vertices can be numbered on the side of attachment to restrict input sequence (for example, from small to large).

实验五 程序1\Debug\graphap.obj
............\.....\main.obj
............\.....\traver.exe
............\.....\traver.ilk
............\.....\traver.opt
............\.....\traver.pch
............\.....\traver.pdb
............\.....\vc60.idb
............\.....\vc60.pdb
............\graph.h
............\graphap.cpp
............\main.cpp
............\traver.dsp
............\traver.dsw
............\traver.ncb
............\traver.opt
............\traver.plg
............\Debug
实验五 程序1

• 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．