851DataStructure2009

这是一个简单的银行模拟系统 1、 客户的到达时间随机 2、 客户需要处理的业务随机（不同业务处理的平均长度不同，例如：取款时间较短，开户和销户时间较长） 3、 处理客户业务所需时间随机（在一定范围内） 4、 使用文本文件记录每个客户到达时间、业务处理时间、业务结束时间 5、 动态显示（刷新时间可调）目前每个窗口累计处理客户数量、等待人数，每个窗口的平均业务处理时间，不同业务类型业务的累计办理量。 (This is a simple bank simulation system 1 customer arrival time random 2, customers need to deal with the business of random (the average length of the different business processes, such as: the withdrawal shorter, longer to open an account and cancel the account) 3, the time required to deal with customer service random (within certain limits) 4, using a text file to record each customer arrival time, business processing time, the business end of time 5 dynamically display (refresh time is adjustable) each window is accumulated to handle the number of customers waiting for the number the average business processing time of each window, different type of business operations total for the amount.)

Dijlstra算法 对任意图，选择合适的数据结构表示图，在此基础上实现求解最短路径的Dijkstra算法(Dijlstra algorithm to arbitrary map, select the appropriate data structures that map, on this basis to achieve solution of the Dijkstra shortest path algorithm)

利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)

二叉树的链式存储、先序中序遍历和层次遍历。（构造一棵树并输入数据，编写三个函数，非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法（这里的非递归以中序为例）。在主程序中调用这三个函数进行树的遍历，观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。）(Chain store binary tree, preorder traversal and hierarchy traversal.)

中科大数据结构全部上机实验的实验程序以及报告，内容包括多项式，图，栈，SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)

迷宫生成器，可以根据需要自己建立各类型的迷宫，而且能求解出线路(Maze maze of various types of generators, according to the needs its own, but also to solve the lines)

简单LR语法分析程序自动生成器的实现，可用作数据结构课程设计(LR (0) grammar analysis)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

本资料为数据结构的相关试卷，可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)

这是一个堆排序的算法源程序，算法被单独写成一个函数，希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)