车队管理

关于算法优化的例子，简单的例子：灰度变换，嵌入式处理用得到，一种优化思想，方法-Algorithm optimization on the example of a simple example: gray-scale transformation, embedded processing used to be, an optimization ideas, methods,

ADO用Treeview显示数据库-ADO database shows with Treeview

使用ODBC封装的CDatabase和CRecordset类- Uses CDatabase and CRecordset kind which ODBC seals

数据结构学习中常用的程序．用c语言编写．vc＋＋６．０运行通过-data structure commonly used to study the procedures. C language used. Vc++6.0 running through

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

从数据库中读取数据进行图形显示, 需要MSChart OCX。-Read data from the database for graphical display, the need for MSChart OCX.

七大基本排序算法，已通过测试快速排序冒泡排序堆排序希尔排序归并排序选择排序插入排序

高校党员管理系统,是acess数据库,功能不太全,只供参考-manage system

十字链表(数据结构作业)- Cross chain table (construction of data work)