经典迷宫问题求解

使用AJAX+PHP+MYSQL删除记录。

sqlite官方并没有提供加密的功能，但提供了加密的接口。资源中的sqlite添加了加密功能。本加密算法采用XXTEA。如果使用Delphi连接此数据库，建议使用itwriting提供的sqlite wrapper改装版；资源包含有源代码以及编译成功的dll（编译工具：VC++ 2010。）各位可以下载后自行根据源码重新编译。

格雷码的代码,能选择格雷码的个数,用VB写的,界面良好-Gray code code code Gray can choose the number, written in VB, good interface

南开大学  金属融化问题  辛运帏老师  C++实现  含测试样例

基于ADODC和ACCESS的客户管理程序，可实现客户信息的添加、删除、查询、修改等。-Based on customer management ADODC and ACCESS programs for customer information to add, delete, query, modify and so on.

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

基于十进制的四叉树的空间数据结构编码。 利用行数和列数求莫顿码 利用莫顿码求行数和列数-Decimal-based quadtree spatial data structure coding. To use the number of rows and columns seeking Morton Morton yards yards seeking to use the number of rows and columns

VB与sql数据库的完美结合实例1-sql database VB and the perfect example of a combination

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

基于密度的应用噪声空间聚类。DBSCAN是最常见的聚类算法之一。