On any given plan (not less than 20 vertices, edges not less than 30, the type of plan can be a directed graph, undirected graph, the network, not the network), can enter the vertex and edge (or arc) of the information, and stored in the corresponding storage structure (adjacency matrix, adjacency table, cross linked, adjacent to multiple tables, in which two types optional), created their own plan to complete the following: Undirected graph on each vertex of degree requirements, or request a directed graph each vertex-degree and out-degree (5 points) Complete the insertion of vertices and edges (or arcs) of the function (5 points) Complete deletion of vertices and edges (or arcs) of the function (5 points) The conversion of two storage structures (5 points), if one of the storage structure for the cross-linked or adjacent multi-table is an increase of 5 points. Depth-first traversal output graph breadth-first traversal sequences or sequence (5 points) Graph of the depth-fi

aaa.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．