MongoDB 连接

这是一道典型的动态规划题 提供了三种方法(用C++代码实现)-This a typical dynamic programming that provides three methods (using C code realization)

这是关于数据结构链表的源程序，用c++程序实现了每一个程序-this is a code of data structure

信息技术练习系统，适用开高中信息技术课的使用-Practice of information technology systems, the application of information technology to open high school classes use

vb6 访问access技术 适合初学者调试学习-VB6 visit debug access technique is suitable for beginners to learn

rPm数据库的安装包 很好的希望大家喜欢有帮助的-rpm database of installed packages good hope that we like to have help

是数据结构中的内部排序算法-data structure is an internal algorithm

c语言编码技术介绍-Technology

串的KMP算法，无回溯的模式匹配中最具代表性的是KMP算法。它是基于对模式本身的字符分布特征所进行的分析，生成模式的特征向量，显示了P= aab 匹配S= ababbaabaa 的优化的KMP算法过程。-Strings of KMP algorithm, no backtracking pattern matching is the most representative of the KMP algorithm. It is based on a model of their own characters by distribution analysis of eigenvectors generated model shows that P = aab match S = ababbaabaa the KMP algorithm optimization process.

一个简单的LISP算术表达式计算器。 简单LISP算术表达式定义如下： （1）一个0....9的整数 （2）（运算符 表达式 表达式） 例如，6，(+45),(+(+25)8)都是表达式，其值分别为6，9，15.-LISP a simple arithmetic expression calculator. LISP simple arithmetic expressions are defined as follows: (1) a 0 .... 9 integer (2) (expression operator expression) for example, 6, (+ 45), (+ (+ 25) 8 ) are expressions, and its value, respectively 6,9,15.

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.