用delphi开发的一个数据表

拓扑排序c版(数据结构)1.邻接表的实现 2.无环情况-topological sorting c version (data structures) 1. The adjacent table to achieve two. No part of

同一个数据库开发的系统，里面有源代码和发布版本-with a database development systems, which Active code and releases

Delphi编程┃Delphi数据库编程-Delphi programming highlights Delphi Database Programming

常用的C++数据结构算法,包括队列、堆栈、链表...等.以模板类型式实现-C common data structure algorithms, including queue, stack, etc. List .... To achieve template-type

应用背景在Java数据库连接使用 ；  MySQL；NetBeans，注：这里的学生已经创造了在MySQL数据库MySQL root用户名关键技术MySQL connector.jar文件可从网站：wvw.mysql.comNetBeans IDE  ； ；7.5MySQL 5.51

一个合并排序算法。是按照《算法导论》书中的讲解来写的。-A plan to merge sorting algorithm. In accordance with the

班主任考核管理系统-class teacher evaluation system

数据库监视备份软件te:应用程序例子(te.exe)-Bowl beat pacing视tong-de-sac glass figurines 软 te: Beckmannia email using the most序bird

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

C++方面有深度的算法例子，提供完整源代码-C++ Aspects algorithm-depth examples, provide a complete source code