- Dijkstra_new 数据结构中表达式求值算法问题
- RFIDstasic 制定符合我国RFID应用的标准有何意义
- VideoLoopback ICETEK
- PE_doc_29919 Commonly used uation measures including Recall
- TankWar坦克大战 坦克大战是用java开发的一款单机版游戏(Tank war is a stand
- Chapter 1 关于感应电机高性能磁场定向控制的一些仿真模型及部分仿真模型(Some simulation models and partial simulation models of high performance field oriented control for induction motors)
资源列表
traversing-graph
- 图的遍历，用两种经典算法实现对任意图的遍历-Graph traversal, two classical algorithm on any graph traversal
ward-management
- 病房管理系统，医院的病房管理系统，实现病人入院，出院，病房查找和人员查找等功能。-Ward management system, hospital ward management systems, patient admission, discharge, wards Find and personnel find.
flight-booked-system
- 数据结构大作业，航班订票系统设计，利用JAVA写的，有良好的设计界面，内附可运行程序，源代码和实验报告-Data structure operations, flight booking system design, the use of JAVA write good design interface, the included can run the program, source code and lab reports
poj-3743
- 计算几何之半平面交的模板，半平面交是计算几何的重要组成部分，编程比较复杂，一般都使用模板。-Calculate the geometry of the half-plane cross template, half-plane cross is the computational geometry important part of the programming is relatively complex, generally using a template.
DLX
- DLX用于高效率搜索，是一种覆盖问题模型的算法。DLX利用了双向链表，体现了数据结构的美。-DLX for high efficiency search is an overlay the problem model' s algorithm. DLX utilize a doubly linked list, reflecting the data structure of the United States.
splay
- 强大的数据结构--splay。splay是一种简洁易写的平衡树。splay在ACM竞赛中用重要的应用。-Powerful data structure- splay. splay is a simple and easy to write a balanced tree. splay ACM contest with important applications.
B-tree
- B树的维护、查询及图形仿真 设计与实现B-树存储结构，以及B-树构造、插入、删除、查找等操作，并以图形方式模拟这一动态过程。-The maintenance of the B-tree, inquiries and graphic simulation design and realization of a B-tree storage structure, as well as the B-tree structure, insert, delete, search operation, a
change
- 进制转化，包含二进制八进制十六进制等等代码的互相转化。-The hex conversion contains binary octal hexadecimal code transform into each other.
selectsearch
- 选择排序例程,使用vs2010开发平台开发-Select sort routines, using vs2010 development platform
bitree
- 二叉树的各种操作，插入、删除、统计深度、各层宽度、结点度为0、1、2的个数、先序、中序、后序遍历的递归以及非递归算法、层序遍历等操作-Binary tree operation, insert, delete, statistical depth layers width operation
tree_completely
- 二叉树的总结 -构造链式二叉树&查找二叉树中某节点&求深度（高度， 层数）前序，中序， 后序遍历（递归， 和非递归）&求出二叉树所有节点总数-Summary of binary tree- the constructed chain binary tree & Find a node in the binary tree & seek depth (height, number of layers) preorder, inorder, postorder traversal (
main
- 数据结构中查找的一些源代码包括排序二叉树平衡二叉树B树等-Data structure to find some source code including sorted binary tree balanced binary B-tree