Description: There are n players of P 1, P 2, P 3, ..., P n participated in a single round robin, each of the players that is negative between the non-wins. Players are now required to obtain a sequence P 1, P 2, P 3, ..., P n, to meet P i wins P i+ 1 (i = 1, ..., n-1).
To Search:
File list (Check if you may need any files):
有向图的深度遍历
................\数据结构心得体会.doc
................\有向图的深度遍历.cpp
................\有向图的深度遍历.exe
................\课程设计报告.doc
Download