Algorithm: Huarong issues heuristic search.

利用C++对MYSQL进行数据读，写，及修改. 需要有mysql.h 头文件   数据库结名为person, 表名为 mm, 表结构如下：  字段             类型 device_id       int sav_value      int sav_date        datetime

常用算法和数据结构的c++实现方法！-commonly used algorithms and data structures of c method!

用VC写的模拟内存分配管理的代码,经测试运行完全正确-VC write memory allocation management simulation code, the test run entirely correct

如果你想实现一个注册系统你网页中的代码可以帮助你。你所有的游客可以通过该系统存储信息。

西门子与计算机通讯程序包括源代码 程序说明 可以进行时时数据采集记录，并可以显示实时数据 曲线，数据报表功能还未增添，以后有机会会添上，有问题请email我。 通讯控件及控件使用手册 使用西门子prodave 控件 程序中使用了tchar控件 这是第二版-Siemens and computer communication procedures, including source code description of the procedures for data acquisition times can be recorded and can display real-time data curve, data reporting capabilities have not yet added to the future, will have the opportunity to add, have questions, please email me. Communication control and control the use of manual control procedures for the use of Siemens prodave used TCHAR control This is the second edition

你用过吗?那个是VF编写的,而我是用VC++编烈写的!搜索速度明显比作者原版更快了,还包含了重要的诗词数据库,代码注释详尽.-You used

1．定义线性表的链式存储结构 2．在线性表的链式存储结构上，编写函数实现链表的初始化，插入、删除，输出、销毁等算法。-1. The definition of a linear form chain storage structure 2. Online sex store chain structure of the table, write a function to achieve the initialization list, insert, delete, export, destruction algorithm.

求最短路径的C++ 源代码 ，用很简单的数据结构实现的，运行速度很快-The shortest path for the C++ Source code, using very simple data structure to achieve, to run fast

这是数据结构算法中的栈的实现的源码。用C++开发。-This is the data structure of the stack algorithm realize the source. With C++ Development.

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)