一个octree algorithm 的实现CQuantizer.

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)

用C做的括号匹配程序,可以检测用户输入的括号是否匹配并给出提示-C matching brackets do procedures, the user can input the brackets and whether the match is suggested

离散事件模拟程序，以及自定义数据类型的队列实现-Discrete event simulation program, as well as custom data types of queues to achieve

its about finding the Triad Numbers-its about finding the Triad Numbers...

欢迎下载学习 它很容易理解 贝叶斯分类器，例如，易于理解和适用于模式识别

ORACLE课程设计（5个代码段）-ORACLE curriculum design (5 code)

设备管理系统，具有参考价值-equipment management system, with reference value

new database system using php

数据结构中常用的Gauss-Seidel 迭代算法-commonly used data structures, the Gauss- Seidel iterative algorithm

这是一个基于COM的数据库访问技术，采用 OLE_DB来封装，高速访问各种数据库接口， 比ADO ODBC_API速度更快，效率更高。强烈 推荐- This based on the COM database visit technology, uses OLE_DB to seal, high speed visits each kind of database interface, compared to ADO ODBC_API speed quicker, the efficiency is higher. Intensely recommends