搜索资源列表
XML_reader
- 自己手动编写的XML分析程序。其中用到了STL的模版库。其中的算法很巧妙，并且没有用其他任何库函数，值得一看。-own manual prepared by the XML analytical procedures. STL which uses the template library. The algorithm is a clever, and not any other library functions overseas.
stl.LCS
- 参考算法导论写的LCS算法，仿照STL的泛型风格，适用于多种STL容器中的各种类型数据构成的序列的最大公共子序列（Longest Common Subsequence）问题求解。-reference Introduction to write the algorithm LCS algorithm, modeled on the STL Generic style. STL is applicable to many types of containers data constitute the
tic-tac-toe
- 一个简单的用二叉树实现的极大极小指算法人工智能井字棋游戏，使用C++的类，和STL模版库中的vector-A simple binary tree the minimax means algorithm artificial intelligence tic-tac-toe game of chess the class of C++, and STL template library in the vector
CRC32_Src
- 使用C++编写的CRC32校验算法，使用了STL库，windows API和汇编等几种方法实现，并能比较它们之间执行的时间。-The use of C++ Prepared CRC32 checksum algorithm, using the STL library, windows API, and the compilation of several methods, such as to achieve, and compare their execution time.
STL_examples
- 关于stl的算法实例 虽然这些例子不是很长，没有一个完整的功能，但是要是想理解的话，已经足够了-Stl algorithm on these examples, although examples are not very long, does not have a fully functional, but would like to understand if so, has sufficient
Apriori_STL
- 本算法的基本功能是用C＋＋语言实现了APRIORI算法，用户可以先选择要进行的操作。然后再输入支持度和置信度，就可得到挖掘的结果。-The basic function of this algorithm is a C++ language APRIORI algorithm achieved, the user can first select the operation to be carried out. And then enter the support and confidence
MyCrust100809
- BMyCrust take as input a 3D scatter points cloud and return a tight, manifold, triangulation. Remember that crust algorithm needs a cloud representing a volume, so open surface may give inaccurate results. For example : a plane can not be triang
Astar
- A*算法实现的八数码问题，使用STL的优先队列及康拓展开的hash函数实现-A* algorithm implementation of the 8 digital issues, using priority queue in STL, and Courier function as hash function to implement
thrust-v0.2RC2.tar
- Thrust Graph Library provides graph container, algorithm, and other concepts like a Boost Graph Library. This Library based on the thrust, which is a CUDA library of parallel algorithms with an interface resembling the C++ Standard Template Library (
stx-btree-0.8.6.tar
- The STX B+ Tree package is a set of C++ template classes implementing a B+ tree key/data container in main memory. The classes are designed as drop-in replacements of the STL containers set, map, multiset and multimap and follow their interfaces very
nibolan-calculator
- 使用wxWidgets和stl开发的一款简易计算器，算法为逆波兰表示法-WxWidgets and stl development of a simple calculator, algorithm for Reverse Polish Notation
B-Tree
- 纯粹算法，实现B减树，当然无法跟stl的代码比，但是可以从中看到B减树的实现过程。-Pure algorithm, the B tree, of course, can not be compared with stl code, but you can see the B tree implementation process.
Dijkstra
- Dijkstra算法采用c++STL实现， Dijkstra算法采用c++STL实现，-Dijkstra algorithm c++STL achieve, Dijkstra algorithm c++STL achieve, Dijkstra algorithm c++STL implementation,
CPPexam10
- 1. 使用 C++标准模板库（STL）中的双向队列类（deque）重新实现实验九中实验任务2。 2. 声明一个整型数组，使用 C++标准模板库（STL）中的查找算法 find()进行数据的查找，然后应用排序算法Sort()，并配合使用标准函数对象Greater<T>对数据进行升序和降序排序。 -1 Use C++ Standard Template Library (STL) in the two-way queue class (deque) reimplement exp
Graph_Theory_Code
- 使用C++ STL的图论编程的相关代码 包括几乎所有经典算法 如：最短路径算法，最大流算法，最小生成树等-Using the C++ STL programming graph theory relevant code Including almost all the classic algorithm Such as: the shortest path algorithm, the maximum flow algorithm, minimum spanning tree
Ful_Permutation_Constructor
- 通过四种算法产生全排列数据，这四种算法是：递归算法、STL算法、字典算法、SJT算法；同时附有算法说明。-The arrangement of data generated by the four algorithms, the four algorithms are: recursive algorithm, STL algorithm, SJT algorithm, dictionary algorithm at the same time with the algorithm descr
main
- C++ STL算法：STL算法元素计数、STL算法最小值和最大值、STL算法查找算法1、STL算法查找算法2、STL算法查找算法7-C++ STL<algorithm>
UESTC_STL
- 电子科技大学STL编程课期末作业。有以下数字：11,12,13,2,3,4,5,6,7,16,17,18.将以上数据依次压入容器deque中，选用一种排序算法排序后，连续弹出3个数据（pop_front）后，对剩余数据进行累加并输出；而后删除所有大于11的数，并输出。-Job University of Electronic Science STL programming classes in arrears. The following figures: 11,12,13,2,3,4,5,6,
stl
- stl部分题答案 有以下数字：11,12,13,2,3,4,5,6,7,16,17,18.将以上数据依次压入容器deque中，选用一种排序算法排序后，连续弹出3个数据（pop_front）后，对剩余数据进行累加并输出；而后删除所有大于11的数，并输出(stl the above data sequentially pressed into the deque container, use a sorting algorithm sorting, continuous pop-up 3 d
TextQuery
- 基于KMP算法，使用STL编写的txt文本查询器(a tool for searching words in txt files base on KMP algorithm)