学校管理系统

算法设计于分析中的多段图问题，用VC编写应用动态规划的算法设计方法，利用最优性原理以及所获得的递推关系式求取最优决策序列，通过多段图的定义，找到由源点s到汇点t的最小成本路径，进而可以灵活解决可以用多段图描述的许多实际问题.-algorithm design in the analysis of many of the map, prepared with VC dynamic programming algorithm design, the optimum principle as well as the recursive relation to strike the optimal sequence of decision-making through more of the map defined by the source to find s t point to the Department of the minimum cost paths and further a flexible solution could spend more of the map describes the many practical problems.

应用背景粗糙集应用R工作室编码。 ；粗糙集不可分辨，利用程序计算阳性面积等。关键技术本工作室是一个软件，在网络上是免费提供的。源代码可以在Studio容易实现

如何备份和还原 MYSQL 数据基地 PROGRAMATICALY 与 VB 6.0 使用 MYSQL 转储程序来备份和还原到 MYSQL.exe。

描述图的头文件，不过是用C描述的，移植到了VC当中-description of the plan is the first document, but is described in the C and transplant them to the VC

Delphi SQL数据库浏览器。可以连接数据库并对表中的数据进行查询修改。

C#与.net4.0数据库开发书源程序第一章

求和最大的子序列，采用动态规划算法，经典算法-sequences using dynamic programming algorithm, the algorithm classic

数据结构最小生成树-minimum spanning tree data structure

数据结构习题集答案，经多次修改而成，比答案册还要清楚简单。-data structure answer to the questions set by several revisions, but clearly the answer List simple.

在0和1情况下进行背包问题解决，涉及多个物体的重量和价值，求得最大价值量以及分配方案。-At 0 and 1 backpack case for problem-solving, involving more than the weight of objects and values, as well as to achieve maximum value distribution program.