资源列表
Minimum-spanning-tree
- 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价-The distance between the network to set a region of n cities, Prim' s algorithm or Kruskal' s algorithm to create a minimum spanning tree, and the calculation of the cost of the minimum s
hotel-management
- 模拟旅馆管理系统中床位分配和回收的功能，设计能为单个旅客分配床位，在其离店便回收床位.-Simulate the allocation and recovery of the beds in the hotel management system designed for the single traveler allocated beds, recovery beds in the Check.
Nqueen
- 给出了用三种方法实现的N皇后，包括循环、递归、位运算等，方便初学者进行研究学习。-Three ways to achieve the N-Queens, including loops, recursion, bit operation, easy for beginners to study learning.
maze_couples_ferry
- 数据结构中关于队列、堆栈、搜索的迷宫问题，couples问题和轮渡问题-Data structure on the queue, stack, search maze Couples problem and ferry problem
DaffodilsNumber
- 用C语言计算出21位的水仙花数（3分钟内）。-21 of daffodils (3 minutes) is calculated using C language.
BinaryTree
- 本程序用VC编写。实现了多种方法建立二叉树、遍历二叉树以及不同版本中序遍历的比较。-This procedure compiles with VC. Achieve a variety of ways to create a binary tree, binary tree traversal, as well as different versions of traversal comparison.
Choose-Monkey-King
- 选猴王（C语言）设置是150只，每5只去掉1只，可自行修改。-The election Monkey King (C language) setting is 150, a 5 removed, can be modified.
shuju
- 数据结构 实现后继表达式的运算 简单的0-9之内加减乘除运算-Data structure to achieve the simple operation of the subsequent expression within 0-9 arithmetic operations
KNN
- 数据挖掘经典算法 （C语言实现版）KNN最近邻算法-Classical data mining algorithms KNN nearest neighbor algorithm
Car-park
- 开发环境是VC6.0，是在C++的语言环境里，通过模拟停车场进出车的过程，来了解数据结构里堆栈的使用。-The development environment is VC6.0, in the C++ language environment, by simulating the process of parking cars, to understand the use of the stack data structure.
polynomial-operation
- 在C++下，实现多项式的加减乘除算法。其中用到数据结构的理论。主要是线性表的应用-In C++, to achieve add, subtract, multiply and divide algorithm of polynomial. The theory used in data structure. The main applications of linear table
icp-good
- icp 正式算法 结合了两种不同的算法 亲测可用-the icp algorithm combines two different algorithms pro-test available