资源列表
yhj
- 实现操作系统中的经典问题银行家算法，主要的核心代码-The realization of the classic problem of the operating system banker' s algorithm, the main core of the code
trainSyst
- 这是一个简单的列车查询系统，含插入、删除，修改，按车次查询，按目的站、始发站查询，车费查询，路程查询等功能，用到了最短路径的算法。-This is a simple train of inquiry systems, including insert, delete, modify, inquiries by the trips, according to the purpose of station stops sending information, fare information, in
heap
- 数据结构，图结构和堆结构，图算法和堆算法的实现-Data structure, graph structure and the reactor structure, map algorithms and Heap Algorithm
queen
- 超牛的8皇后程序，整个程序只有短短的10行，而且是按标准格式，控制台上输出的格式也是符合美观条件的-8, Queen' s super-cow program, the whole process is only a short span of 10 lines, and is based on a standard format, the format of the console output is also in line with the conditions of appeara
Symbolic
- an example of processing symbolic expression
SingleList
- 简单的单链表实现，这是cpp文件的压缩包，用于学校实验报告用。-The realization of a simple single-list, this is the cpp file compression package, Experimental report for schools.
BTree
- 二叉树的简单实现,这是cpp文件,用于学校实验报告用-The realization of the simple binary tree, this is the cpp file, Experimental report for schools
ds[1].tar
- 数据结构中链的链表的应用，约瑟夫问题，皇后问题等十个数据结构常见问题的程序 -Data structure in the linked list chain applications, the issue of Joseph, 10 Queen' s data structure, etc. The program Frequently Asked Questions
huffmancode
- 这是我近来完成的一个用哈夫曼树进行二进制编码操作的数据结构作业。用户通过输入26个字母，程序会根据26个字母出现的频率自动构建哈夫曼树并输出这些字母的二进制编码。-This is my recently completed a binary tree with Huffman encoding operation of the data structure operations. User by entering the 26 letter, the program will be 26 let
Prim-Kruskal-Dijkstra
- 数据结构课程设计据结构课程设计范例\Prim-Kruskal-Dijkstra.rar-Data structure, according to the structure of curriculum design curriculum design examples \ Prim-Kruskal-Dijkstra.rar
daoyou
- 数据结构的课程设计,关于校园导游的设计,很不错-Data structure of the curriculum design, campus tour guides on the design, very good
Tree
- This a tree algorithm as a data_structure which includes clear-cut reference, so you can get the architecture of tree structure easily-This is a tree algorithm as a data_structure which includes clear-cut reference, so you can get the architectur