adorwacce

一种改进的Boyer-Moore的字符串查找算法，并封装到类-an improved Boyer- Moore string search algorithms, and type of packaging

使用VC编写的二叉树程序，简单明了，方便使用-Written in binary tree using the VC program, simple and clear, easy to use

这是一个运用多种排序法对数据进行排序的程序,排序时间复杂性小,空间复杂性小,排序速度快.压缩包包括源程序文件,再vc中运行.-This is a use of a variety of data sequencing procedures for ordering, scheduling time complexity of small, space complexity of small, fast order. Compressed including source files, then vc run.

邻接表，邻接矩阵的创建以及对它的一些操作等-Adjacency list, adjacency matrix, as well as the creation of some of its operations

本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.

1采用了tcp通信。 2实现自由选择主辅库。 backup:数据库监视备份软件(backup.exe,backup.ini,backup.log,sendclient.log)-One uses tcp communication. 2 Des realize freedom to choose the main library. backup: backup software, database monitoring (backup.exe, backup.ini, backup.log, sendclient.log)

我自己用VC++开发的数值算法程序――二次罚函数罚，对于处理带约束的问题效果很好-my own use VC numerical algorithm development process-- second penalty function fines, and dealing with the problem of constrained good results

Generating next numbers in SQLServer should not be a problem. But problems arise when a customer asks for different types of next numbers that you cannot generate directly from SQL Server. This brief article describes how you would tackle this problem in different scenarios.

图的邻接矩阵存储结构 图的优先深度遍历-Graph adjacency matrix storage structure of the priority depth traversal