finds the smallest leaf node at a time, and outputs its adjacent node (the leaf node has only one adjacent node) to delete the leaf node. The loop does this to the graph until there is only one node left. In the end, the total number of N-1 is output.

Filename	Size	Update
1117_Code\linkStack.cpp	1060	2016-03-15
1117_Code\linkStack.h	570	2016-04-27
1117_Code\main.cpp	2247	2016-04-27
1117_Code\priorityQueue.cpp	1946	2016-04-21
1117_Code\priorityQueue.h	502	2016-04-19
1117_Code\stack.h	294	2016-03-15
1117_Code\test.cpp	6258	2016-04-27
1117_Code	0	2016-04-27

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