用struts hibernate 开发的论坛源码! 开发平台:eclipese 3.1.2 web服务器: tomcat 5 数据库: mysql...

数据结构：有关树所有操作- Construction of data: The related tree all operates

数据结构的java实现-data structure to achieve the java

创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non- recursive traversal sequence

每个员工收到的工资，薪金，与数量的列表。一个完整的系统，他们计算一个员工的工资，打印工资单。你可以配置你的列表中。

还可以啦!!有问题请讲-can! ! There are problems, please

berkeley db 数据库中的动态链接库文件，具体使用可以参看4.2.20版本中的相关介绍-berkeley db database

经典的数据结构算法-classical algorithm data structure

数据结构：顺序栈-data structure : Stack order

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

任意的表达式求解！ 包括函数。-arbitrary formula to solve! Including function.