vc++.net的幼儿园管理系统，功能不多，但非常好用，与大家交流，谢谢指导。...

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

完成界面功能，与数据库连接，完成查询 插入 删除 登陆等功能-Completion of the interface functions, and database connection, complete the inquiry landing insert delete function

使用Windows Forms for GUI和DataSet进行数据访问的学生信息系统-VB.NET版-VS2010年

利用闭散列方法中的线形探查建立散列表。用c实现的。-closed hash method using the linear exploration establish hashtable. C used to achieve.

关于算法优化的例子，简单的例子：灰度变换，嵌入式处理用得到，一种优化思想，方法-Algorithm optimization on the example of a simple example: gray-scale transformation, embedded processing used to be, an optimization ideas, methods,

用c＋＋写的用于ic设计中布图布线的工具源码，采用btree结构，包含文档-using c++ to write for ic design layout source routing tools used btree structure, including documentation

这是一个改进了自顶向下的归并排序，它改进的地方主要有：采用小子文件截止的机制，当序列长度小于32时，采用直接插入排序；对归并的内循环作了优化，判断的次数更少。-This is an improvement from a top-down sort of merger, it improved the main : the deadline for the paper boy mechanism, the length of the sequence is less than 32, the use of direct insertion sorting; Merging with the right circle made optimization, the number of less judgment.

【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash

设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。-Design a project, from AOE network, and data entered into the computer, using the procedure for analysis.

最短路径的具体实现，使用了dikstra算法-Concrete realization of the shortest path, using the algorithm dikstra