资源列表
floyed
- 在VC6.0上通过的弗罗伊德算法，TXT中附有输入数据范例-In VC6.0 algorithm adopted by Freud, TXT in the input data with examples
tropsort
- 在VC6.0上通过的拓扑排序算法，TXT中附有输入所需的数据-Adopted in VC6.0 topological sorting algorithm, TXT in with the required data input
kruskal
- 在VC6.0上通过的克鲁斯卡尔算法，TXT中附有输入数据范例-Adopted in VC6.0 Kruskal algorithm, TXT in the input data with examples
dijskra
- 在VC6.0上通过的迪杰斯科拉算法，TXT文件中附有输入数据及结果-In VC6.0 algorithm adopted Dijie Scola, TXT file with input data and results
helanqi
- 用VC6.0通过的数据结构1800题中的荷兰旗问题-The data structure by using VC6.0 1800 issue of the flags of the Netherlands
duipaixu
- 用VC6.0通过的堆排序算法，直接运行即可。-By using VC6.0 heap sorting algorithm can be run directly.
coding-sol
- simple program for c++ learners which can be helpfull hashing code
solution
- another data structure source codes for revision in c-another data structure source codes for revision in c++
guideline-5_1
- some of the data structure solution to help yourself understand some concepts single linked list
solutions
- queues list data structure c++ some example code to use as tutorials
Resource
- Data strut tutorials to get yurself started by working and understanding the abouve codes
joseph
- 约瑟夫(Joseph)问题的一种描述是:编号为1,2,..., n 的n 个人按顺 时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作为报数上限值m， 从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将它的密码作为新的m值，再从下个人开始新一轮报数，如此反复，直到剩下最后一人则为获胜者。试设计一个程序求出出列顺序。-Joseph (Joseph) a descr iption of the problem is: numbered 1,2 ,.