This a comparison of the two topological sorting algorithm, one needs to determine the ring structure algorithm is too complex, but another idea Interested students can modify it to read, if successful, please contact me, and the other is the standard answer.

拓扑排序
........\Debug
........\.....\tuposort.exe
........\.....\tuposort.ilk
........\.....\tuposort.obj
........\.....\tuposort.pch
........\.....\tuposort.pdb
........\.....\vc60.idb
........\.....\vc60.pdb
........\.....\拓扑排序.exe
........\.....\拓扑排序.ilk
........\.....\拓扑排序.pch
........\.....\拓扑排序.pdb
........\tuposort 拓扑排序1（需判断环 不适用）.cpp
........\tuposort.cpp
........\tuposort.dsp
........\tuposort.dsw
........\tuposort.ncb
........\tuposort.opt
........\tuposort.plg
........\拓扑排序.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．