Simulation Bank Queue System, the parent process is responsible for scheduling,...

实现多课程的排序问题，符合先修课程安排的要求，可给出多种排课方案！！本程序的亮点是可得出一组课程的所有可能的拓扑排序,故最终结果是多方案的-Scheduling multi-course meet the requirements of Pre-curriculum can be given a variety of arranging schedule the program! ! The highlight of this program can be drawn from a group of courses in all possible topological sort, so the end result is a multi-program! !

PowerBuilder 开发应用实例中关于阴历转阳历计算的源代码-PowerBuilder to develop applications on the lunar calendar to calculate the solar calendar source code

数据结构实验练习--计时器，通过定义数组operand存放每个操作数，定义数组operate建立操作符集合，输入表达式得出结果。-Experimental data on the structure of practice- the timer, the array operand stored by defining the number of each operation, the definition of the array operate operator set up a collection, enter the expression results.

三层数据库考试系统，很不错的，大家可以看看。-Three-tier examination system database, it is good, we will look at.

你好 我开发了此应用程序只用了 1 天，我相信你们都喜欢这个应用程序，并且学到很多东西特别是初学者。 谢谢你 J@n@k

数据结构与算法――C++版 好书要不要，不用付钱的哦-data structures and algorithms-- C version of the books should not and do not have to pay oh

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

关于用nlogn的最长子序列算法，在网上摘录的-discusses the use of the longest sequences algorithm, in the extract from the Internet

数据结构算法之 约瑟夫算法-data structure algorithms Joseph Algorithm

数据结构银行模拟指导-simulation data structure to guide banks