这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制....

本程序演示了如何使用编辑器在运行期设置表格的一些常用参数 需要使用到Ehlib控件,最好使用3.6版本,旧版本也适用! 使用前请双击本目录下的DB.UDL连接数据库,连接完成后即可选择数据表进行演示! 在表格上按右键,即可出现功能菜单,点击进入! 程序应该适用于各版本的DELPHI,但由于条件有限未做测试!-This procedure demonstrates how to use the editor in the run-time set up tables need to use some common parameters to Ehlib control, it is best to use 3.6 version, also applies to older versions! Before use double-click the catalog under DB.UDL connect to database, connectivity be able to choose after the completion of data table demo! Right-click in the table can function menu appears, click to enter! procedure should be applicable to all versions of DELPHI, but due to limited testing done!

彩电故障信息共享系统 本程序使用Visual C++６.0编程制作信息共享系统,实现信息管理共享的自动化。由此实现了信息的增加、删除、修改、查看等功能，并且进而实现信息的安全管理，使信息的管理更加人性化，规范化。从而提高故障排除效率，提高信息利用率，有助于进一步提高了生产效率。-TV fault information sharing system of the present procedures using Visual C 6.0 programming produced information sharing system, Sharing information management automation. This realization of the information to add, delete, modify, check, and other functions, and thereby achieve information security management, information management more humane and standardized. Improve troubleshooting efficiency, improve utilization of information and help further enhance the efficiency of production.

把数据库中已经存在的数据通过网络发送出去，实现数据共享-Send the existed data in the database via network and share the data

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in

程序展示了C++程序的现代设计模式。设计模式是重用设计解决方案的方法

图形演示数据结构的树与图遍历算法,vc环境下的windows编程-graphic demonstration of the tree data structure with plans traversal algorithm, vc environment of windows programming

用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing

1． 问题描述设计一个国际象棋的马踏遍棋盘的演示程序。2． 基本要求将马随机放在国际象棋8*8棋盘的某个方格中，马按走棋规则进行移动。编制非递归程序，求出马的行走路线，将数字1，2，3，4，…，64依次填入一个8*8方阵。-1. Problem description design of a chess board Ma travels in the demonstration program. 2. Ma basic requirements on random chess 8* 8 chessboard in a box, according to Ma go mobile chess rules. Preparation of non- recursive procedure, and seeking stepped routes, the number 1,2,3,4 ..., 64 were filled an 8* 8 matrix.

利用VB通过串口控制单片机读写24C02源代码程序-The use of VB to read and write through the 24C02 single-chip serial port control program source code

这是在邻接表的基础上实现的多段图的向前算法-This the adjacency list on the basis of the multi-map algorithm forward ... ... ...