Description: Output a directed acyclic graph (DAG) topological sort. Through calculating the degree of each vertex deleting zero vertices into degrees, at the same time the vertex point to point into the degree of minus one. Repeat this action until all points have been output.
To Search:
File list (Check if you may need any files):
拓扑排序\Debug\拓扑排序.exe
........\.....\拓扑排序.ilk
........\.....\拓扑排序.pdb
........\拓扑排序\Debug\CL.read.1.tlog
........\........\.....\CL.write.1.tlog
........\........\.....\link.read.1.tlog
........\........\.....\link.write.1.tlog
........\........\.....\mt.read.1.tlog
........\........\.....\mt.write.1.tlog
........\........\.....\Topological_Sort.obj
........\........\.....\vc100.idb
........\........\.....\vc100.pdb
........\........\.....\拓扑排序.exe.intermediate.manifest
........\........\.....\拓扑排序.lastbuildstate
........\........\.....\拓扑排序.log
........\........\Topological_Sort.cpp
........\........\拓扑排序.vcxproj
........\........\拓扑排序.vcxproj.filters
........\........\拓扑排序.vcxproj.user
........\拓扑排序.sln
........\拓扑排序.suo
........\........\Debug
........\Debug
........\拓扑排序
拓扑排序
Download