Delphi编程练习：在数据库中以文件流形式保存JPEG图片。

数据字典的说明,对数据库设计有极大的帮助-Data dictionary description of the database design a great help to

phpMySQLAutoBackup能自动备份mysql数据库，并将导出的数据库（数据与结构）压缩成gzip格式然后用email通知你。phpMySQLAutoBackup能够按设置每天/周定时备份，选择不同的表格来备份，当备份表格时,可以设置备份开始和结束的行数，以便让你能够有选择的备份一个巨大表格(数百万条数据)任一部分。 -phpMySQLAutoBackup can automatically backup mysql database, and export the database (data and structure) and then compressed into gzip format to inform you by email. phpMySQLAutoBackup able to set up a day/week timer backup, choose a different form to back up, when the back-up form, you can set the beginning and end of back-up the number of rows, so that you can choose to backup a large table (millions of data) any part of.

这些是数据结构结构的经典实现算法，是学习数据结构必须掌握的-shu ju jie gou jing dian suan fa shi xian

学籍管理系统软件，使教学人员及操作者进行学籍管理，方便操作者随时添加、查询、修改，使工作人员从繁琐的填表，查表工作中解放出来；使供需双方都获得满意的结果；促进报表、统计数字的规范化；提高工作效率；降低学籍管理维护费用，提高行政工作效率，改善服务质量，为学校领导决策提供支持，该软件的设计目标尽量达到人力与设备的节省,并且处理数据的速度提高。-Grade Management System software to enable the operator to conduct teaching staff and student status management, helping the operator at any time to add, query, modify, so that staff from the tedious filling, look-up table work, freed so that supply and demand both sides to obtain satisfactory results the promotion of reports, statistics, standardization improve work efficiency student status management to reduce maintenance costs, improve administrative efficiency and improve service quality, school leadership to support decision-making, the software is designed to reach as far as possible to save manpower and equipment, and processing data increase the speed.

使用VS.NET开发的数据结构红黑树可视化图形界面演示。可以进行节点的添加及删除。-use VS.NET development of the data structure RED-BLACK TREE visual graphical interface demo. The nodes can be added and deleted.

1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal sequence of vertices losers Figure out from the starting point V0 according to the breadth- first traversal sequence vertex 2, and plans to establish the topological sorting

刚刚用ACCESS做的-just do ACCESS

数据结构里面实现图：拓扑排序、最小生成树、关键路径、深搜、广搜、优先路径

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

运用apache的poi读取excel表格内容，将读取出来的数据插入db2数据库。-The poi using apache to read the contents of excel table, will read out the data into db2 database.