资源列表
xueke
- 初始化双向链表，基本操作都已实现.是学习数据结构的好帮手-selection system developed by students
polynomial
- 一个简单的一元多项式，刚开始学数据结构的同学们可能会用到-A simple one polynomial, the beginning students learn the data structure may be used
example11-13
- 建立每个学生信息的记录对学生信息按分数从高到低排序显示排序后的结果-Established a record of each student information on the student information from high to low Sort by score sort the result shows
JudgePointInRect
- 根据矩形左边中点、方向及长宽求矩形各点坐标；判断平面上一点是否在该平面上某一不规则矩形内-According to the midpoint of the rectangle on the left, direction and length and width of a rectangular coordinate points determine whether the plane a little irregular in the rectangular plane within a
LinkList
- 在VC++开发环境下实现单链表的建立、插入、删除、查找等操作。-In VC++ development environment to achieve the establishment of a single linked list, insert, delete, search operation.
Dijkstra
- 经典Dijkstra算法，用于最短路径求解，完整的（包括头文件，生成距阵），可直接运行的-Classical Dijkstra algorithm, for the shortest path problem, complete (including header files, build Inmerse Matrix), can be run directly
GIStransportation
- 利用公 交线路路 口作 为顶 点，简化 了传统算 法对复 杂 网络拓扑 图的计 算；同时，利 用乘客 出行 偏好 ．引入 线 网密度来评 价乘客的 出行 方便程度 ，并提 出了一种最短路 径快速搜 索算法．实验证明 ，与传 统算法相比 ，该算法明显提 高了路径搜 索效率． -Intersection as the peak use of bus lines, simplified the traditional algorithm is the calculation of comp
123
- 单链表的删除插入输入输出清空多值插入和删除。-delete of the lnode
sjjg
- 数据结构所有代码，帮助你学好基础。要学会c言，就要先学会数据结构-Data structure all of the code base to help you learn. To learn c words, we must first learn how data structures
chazhaobaogao
- 数据结构遍历树的实验，有源码，可以任意输入1组有序数据；对顺序查找、折半查找、分块查找的查找次数进行比较并输出比较结果。 -Traverse the tree data structure to the experiment and source code, you can import a group of arbitrarily ordered data on sequential search, binary search, block search to find the numb
paixubaogao
- 数据结构中的对各种内部排序算法进行比较得实验报告，包括源码。可以任意输入5组数据；对冒泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序的关键字比较和交换次数进行统计。 -Data structure of the various internal sorting algorithms comparison in the experimental reports, including the source. 5 groups can be any input data on t
Bankers
- 银行家算法是避免死锁的一种重要方法。 本实验的目的是，加深了解有关资源申请、避免死锁等概念，并体会和了解死锁和避免死锁的具体实施方法。-Banker' s algorithm is an important method to avoid deadlock. The purpose of this study is to better understand the application of resources to avoid deadlock and other concep