此为Delphi树控件的一个数据库运用

免费的Delphi控件，可以替代BDE，直接访问.dbf数据库-Free Delphi ActiveX component,replace BDE and direct access .dbf database

poj3233的题目及解题代码 poj3233的题目及解题代码-poj3233 the subject and the subject of problem-solving and problem-solving poj3233 code code code poj3233 the subject and problem-solving

labyrinth: you need to find the doable way to go to the destinaton.And then print out the path.-labyrinth: You need to find the doable way to go to the destinaton.And then print out the path.

用JSP链接到数据库使用起来非常简单，CUT然后PASTE，原代码中我给出了详细的注释。-Using JSP link to the database is very simple to use, then PASTE CUT, the original code I presented a detailed notes.

数据结构和算法：包含各种算法，还有一个演示系统-data structures and algorithms : algorithms contained, a demonstration system

#include #include struct BiTNode           //定义二叉树结构体 {   float data;   struct BiTNode *lchild;   struct BiTNode *rchild; }; //二叉树创建函数 struct BiTNode *CreateTree(float *preorder,float *inorder,int lenth) {     float *p,*q;      

本源码实现了对数据库的最基本的操作，插入，修改，添加删除等基本操作，旨在对读者掌握最基本的数据库操作-The realization of the source of the most basic database operations, insert, modify, add, delete and other basic operations, aimed at the readers grasp the most basic database operations

自适应噪声对消源程序，LMS算法自适应滤波器仿真-adaptive noise cancellation source, LMS adaptive filter algorithm simulation

图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such as the shortest path to map the way! VC interface!

一个解码的类，常用在条形码的解码中，是老外写的比较实用-a decoder category, commonly used in bar code decoding, the foreigner is more practical writing