用c语言实现标准的微粒群算法，功效更好，可以和matlab互凋

物资管理系统-VC 使用ADO实现-Material Management System-VC use ADO

1.通过鼠标拖拽和弹出对话框完成实体、属性、联系的绘制以及各参数设定 2.对绘制的实体、属性、联系提供合法性检查 3.对绘制的图形进行拖动、重设大小、删除 4.通过属性对话框对实体、属性、联系的各种参数进行重新设置 5.数据的串行化 6.将绘制完成的E-R图转换成数据库脚本-1. Through mouse drag and drop and pop-up dialog box to complete entities, attributes, links, as well as drawing parameter setting 2. Drawing entities, attributes, links provided to check the legality of 3. The graphics on the drawing drag, reset size, delete 4. through the Properties dialog box on the entities, attributes, linked to various parameters re-set 5. serialization of data 6. will be drawn to complete the ER diagram into a database script

java数据结构方面的，关于二叉树，很简单、实用-data structure, for the binary tree, a very simple, practical

这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm

使用ADO Reviewed版本1.1.0创建Access 2000数据库！

一个sql语法分析程序- A sql grammar analysis program

这段代码被针对医院管理通过与 oracle 采用 vb6.0 做为一个后端服务器。它保持像医生详细信息、 病人的细节、 登录和注销应用程序。

主要介绍了如何使用SQL语言编写高效简洁的数据库编程语句，提高数据库编程思想-Introduces how to use the SQL language simple and efficient database programming language, database programming to improve thinking

使用贪心算法实现PRIM最小生成树算法.经典的算法题目.-PRIM algorithm using the greedy algorithm for minimum spanning tree. Classic topics algorithm.

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.