Source code, is a java implementation to compare with the clarity and the first...

一个用c++实现的最小生成树的源代码，希望对大家有所帮助哈-A used c++ Realize the minimum spanning tree of the source code, and they hope to help everyone Kazakhstan

SourceAFIS是一个指纹识别/匹配SDK（库），或者更一般地说是一个自动指纹识别系统（AFIS）。它本质上是比较两个指纹，并决定他们是否属于同一个人。它可以快速搜索注册指纹的大型数据库。它附带了一个易于使用的API（纯.NET和一个实验性的Java端口）以及各种各样的应用程序和工具。

空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.

数据结构自考试题及答案 希望能够帮助大家-Data structure questions and answers to help everyone

资源描述本代码比较适合初学者，刚接触过C++语言的童鞋，对代码不是怎么懂，可以参考学习。

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data node must be small (large) in the node data. Order traversal of binary tree that is the result of a sort.

c语言编写的哈夫曼程序,运行通过的!根据输入构建哈夫曼树.-prepared by Huffman, the running through! According to the importation of construction Huffman tree.

用C++制作家谱-C production records

好用的仓库管理系统-user-friendly Warehouse Management System

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.