系统交易最近的信息

this a program for for database implement in this we are implementing several join algorithms

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

二叉树是数据结构的重中之重，进一步认识二叉树的查询技巧-Binary tree data structure is the most important, a better understanding of tree query skills

该程序完成对二叉树的非递归的前序遍历，在三种遍历方法中，这种遍历最简单，所以，核心代码自然要少很多。-completion of the process of non- recursive binary tree of the former preorder, the three traverse method, which traverse the most simple, so natural to the core code is much less.

基于SQL Server数据库和JAVA语言的学生信息管理系统；完整源代码，JAVA语言实现，NetBeans开发环境，可以导入Eclipse

学生档案管理系统，是delphi初学者的操作例子,很全面!-Student records management system is the operation of beginner delphi example, very comprehensive!

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder

二叉排序树，实现简单的排序，删除，插入，保存，恢复等功能-Binary sort tree, the realization of a simple sort, delete, insert, save and restore functions

关于有穷自动机和正则表达式相互转化的程序，并完成有穷自动机的确定化和最小化。-on Finite Automata and Regular expressions are transformed into each other procedures, and complete the DFA and the determination of the smallest.

湖南大学ACM-OJ的部分题目代码，对学习数据结构和算法很有帮助-Hunan University ACM-OJ part of the subject code, the data structure and algorithm to learn helpful