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

求乘积最大的子序列乘积,采用动态规划方法求解-product for the greatest sequences product using dynamic programming method for

三种排序方法的动态演示，可以同时开启多个线程，同时用不同的方法进行排序，直观的判断不同算法的排序效率。-three sequencing method of dynamic presentations, it also opened a number of threads, in addition to the use of different methods for sequencing, intuitive judgment different sorting algorithms efficiency.

使用powerbuilder开发的小型图书店系统。请查阅！-Use PowerBuilder to develop small-scale map Bookstore. Please check!

数据结构算法演示-demonstration algorithm data structure

用VC++6.0开发多表联接的数据库应用程序-VC 6.0 multi-table database connectivity application

本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source

根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current situation

先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树-First construct a map with the adjacency matrix is stored separately plym algorithm and then construct the minimum spanning tree algorithm克努斯卡尔

这是ID3决策树算法的一个示例实现

DELPHI物流管理系统设计与实现.附带有论文.-DELPHI Logistics Management System Design and Implementation. Incidental papers have.