Description: Topological sorting is mainly to solve the problem of whether a project can be carried out smoothly, but sometimes we need to solve the shortest time problem needed for the completion of the project. If we get the shortest time for a flow chart, we need to analyze their topological relationships and find the most critical process, which is the shortest time.
To Search:
File list (Check if you may need any files):
7、关键路径问题
7、关键路径问题\Debug
7、关键路径问题\Debug\vc60.idb
7、关键路径问题\Debug\vc60.pdb
7、关键路径问题\Debug\关键路径问题.exe
7、关键路径问题\Debug\关键路径问题.ilk
7、关键路径问题\Debug\关键路径问题.obj
7、关键路径问题\Debug\关键路径问题.pch
7、关键路径问题\Debug\关键路径问题.pdb
7、关键路径问题\bian.txt
7、关键路径问题\vex.txt
7、关键路径问题\关键路径问题.cpp
7、关键路径问题\关键路径问题.dsp
7、关键路径问题\关键路径问题.dsw
7、关键路径问题\关键路径问题.ncb
7、关键路径问题\关键路径问题.opt
7、关键路径问题\关键路径问题.plg
Download