Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the relevant results. Functional requirements: the basic information input graph, and the establishment of graph storage structure (with the appropriate prompt), the output traversal sequences, then the topological sort and test the plan is to have directed acyclic graph, and the output sequence topology

1.cpp

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