本程序是一个宾馆程控电话系统，调试成功。对于初学vc的mfc变成有用，主要是与数据库的调用方面。...

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

这是一个有关于VC++6.0与数据库ACCESS相结合的小程序-This is a database on the VC++6.0 with a combination of small programs ACCESS

纯C写的48位软件模拟浮点运算,可移植 测试版，V0.0000.01 需进一步测试及优化-Written in pure C software simulation of 48 floating-point operations can be transplanted beta, V0.0000.01 need further testing and optimization

电信计费程序 电信计费程序-Telecom billing procedures for telecommunications billing procedures

后缀数组的一个C++实现，在字符串统计中有很大作用。-Suffix array of a C++ implementation, plays a significant role in statistics in the string.

LNMF是基于“局部”非负矩阵分解生成特征空间的算法，而NMF是基于非负矩阵分解。-Matrix is based on a "partial" non-negative matrix factorization generation features space algorithm, which is based on the NMF non-negative matrix factorization.

最接近点对问题，分治法实现，随机生成N个数寻找最短路径的两个点-closest point of the problem, realizing the partition method, random number generation N to find the shortest path to the two points

资源描述 有两种方法：一种没有学分排序，另一种考虑了学分排序，较推荐栈中排好序的方法，贪心更完全 测试数据文本： C1 程序设计基础 # 2 C2 离散数学 C1 3 C3 数据结构 C1,C2 4 C4 汇编语言 C1 3 C5 语言的设计和分析 C3,C4 2 C6 计算机原理 C11 3 C7 编译原理 C3,C5 4 C8 操作系统 C3,C6 4 C9 高等数学 # 7 C10 线性代数 C9 5 C11 普通物理 C9 2 C12 数值分析 C1,C9,C10 3

一个有关于VC6.0与ACCESS数据库结合的小程序-An ACCESS database on VC6.0 and the combination of small programs

求解最短路径的程序。根据迪杰斯特拉的算法思想写出的程序。运行环境VC++6.0-Procedures for solving the shortest path. Dijkstra" s algorithm based on ideas to write procedures. VC++6.0 environment