毕业设计、、

图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship

VFP做的数据的查询与设计-do VFP data inquiries and Design

这是有关内存分配的一些讨论 以及 一些算法的实现-This the memory allocation of some discussion and some algorithm to achieve!

有关aql中存储过程的内容-store the contents of the course

图的遍历，在连通的无向图上访问全部节点的操作-Graph traversal, in the undirected graph connectivity to access all the nodes to operate

自底向上排序：思想: 将数组的个部分,两两有序数组进行合并 算法平均时间复杂度: O(nlogn) -Bottom-up sequencing: thinking: The array of parts 22 in an orderly array merge algorithm for the average time complexity: O (nlogn)

易经起名卦例的存取,用户可以方便存取原名和改后的名字信息-database development,use vc++ and mfc software develop,give all source,user can get and store his name and change name conveniently

我写的那算法只是原理，要实用必须实现一个大整数类（用c++，我的算法是C的)。欢迎和我联系讨论-I wrote that the only algorithm principle, to be practical realization of such a large integers (with c, I C algorithms). And I welcome the discussion link

数据结构的课程设计题目，各种排序方法，并计算花费时间- The construction of data curriculum designs the topic, each arrangement method, and the computation spends the time

DELPHI+ACCESS 客户关系管理-DELPHI+ ACCESS Customer Relationship Management