mfc odbc数据库编程

这是一个关于 Hough 变换的文件。它是非常有趣的人，开始为图像处理批准。感谢你很 much.ok。

1、 用随机数生成的方式（要求用户输入随机数）产生一个迷宫：“1”表示墙，“0”表示路，最后的路径用“8”表示，若没有路径则打印报文，若有路径则打印出路径。 2、 通过堆栈及判断实现迷宫的自动寻找路径功能 -1, the random number generator of (requiring user input random number) produces a maze : "a" Wall said, "0" Lu said, the final path with "8" that if no path was reportedly Print text, if it were printed out trails path. 2, stack and judgment to achieve the labyrinth path function to automatically search

GnuCash是一个免费的会计软件，可以维护您的帐簿

example for security of meikuang

一个有关电力系统收费的管理软件-an electricity pricing system management software

描述：这个实验中需要实现的是拍卖系统的3个核心的类（Class Date, class Advertisement, and class Client） 目的： 1，使用C++的数据类型； 2，实现所有声明的函数； 3，使用预处理器实现包含。-Description：This assessment requires the creation of three of the core classes of the auction project. Class Date, class Advertisement, and class Client are three of the fundamental classes in the system. Outcomes: Students successfully completing this assignment would master the following outcomes. Use fundamental C++ data types Produce C++ class implementations given class declarations Use the preprocessor to perform file inclusion

Dijkstra算法，可以求解图论中两点之间的最短路径

《学籍管理系统》 “c# WinForm 数据库操作的简单范例 （SQL Server 2000）”-"expulsion management systems," "c# WinForm operation of the database simple paradigm (SQL Server 2000)"

Floyd 算法，创建有向图，无向图，有向网，无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.