物流管理系统

简单介绍了一种数据结构的构建及其使用情况,-introduces a simple data structure of the building and its use,

此程序将从给定的字符串中删除模式 (子串)。 这是最简单和容易理解的 c + + 编写的代码。 这是最准确和最佳性能要使用的程序。

这是数据结构中约瑟夫环问题！-This is the data structure Josephus problem!

摘要 　? 　? 　　 　　设计时的自动化加快了编码，并保证所有过程都用相同的命名规范和结构来生成。为了在大型 SQL 项目中尽量提高编码的效率，作者编写了一系列的设计时（design-time）存储过程，用它们来生成运行时（run-time）存储过程，并一直在工程中使用。最近，作者更新了其存储过程以便使用 SQL Server 2000 的特性，其中包括用户定义函数。本文所及内容涵盖创建并执行这些动态 T-SQL 脚本以使普通的数据库存储过程编码自动化。- Time the abstract design automation sped up the code, and guarantee all processes all use the same naming standard and the structure produce. In order to enhances the encoded efficiency as far as possible in the large-scale SQL project, the author has compiled when a series of designs (design-time) saves the process, produces when the movement with them (run-time) saves the process, and always uses in the project. Recently, the author renewed its memory process in order to use SQL the Server 2,000 characteristics, including user definition function. This article institute and the content cover founds and carries out these dynamic T-SQL script to cause the ordinary database memory process code automation.

VC编写的读取数据文件的源码-VC compilation reads the fetching according to the document source code

c#数据库连接及热图渲染矩阵计算，利用oracle数库连接读入数据，插入数据，利用线性差值及argis二次开发 插入热点，并将结果插入结果矩阵中

#include #include struct BiTNode           //定义二叉树结构体 {   float data;   struct BiTNode *lchild;   struct BiTNode *rchild; }; //二叉树创建函数 struct BiTNode *CreateTree(float *preorder,float *inorder,int lenth) {     float *p,*q;      

堆栈的应用及操作 利用堆栈实现对任意进制的数的转换；-stack

图的建立和图的广度深度优先遍历（有向图和无向图）-Map creation and map the breadth of depth-first traversal (with the map and undirected graph)

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in