(1) keyboard input data, the establishment of a directed graph adjacency list and outputs the adjacent table. (2) using the adjacent table storage implementation has to depth-first graph traversal. (3) try to write an algorithm to determine the adjacent table stored there if the vertex to vertex Vj Vi path (i <> j) the presence of the figure. There are (4) has been directed graph adjacency list representation, program judging vertex u to vertex v and whether there is a simple path, if you print a vertex on the path. (5) design a simple menu in the main function, namely debug the algorithm described above.

Debug
.....\vc60.idb
.....\vc60.pdb
.....\有向图.exe
.....\有向图.ilk
.....\有向图.obj
.....\有向图.pch
.....\有向图.pdb
有向图.cpp
有向图.dsp
有向图.dsw
有向图.ncb
有向图.opt
有向图.plg

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