Location:
Search - tree container
Search list
Description: The Tree Container Library (TCL), presented here, is a generic tree container library which, not only works much like the STL, but is also compatible with the STL algorithms.
Platform: |
Size: 39761 |
Author: qiao |
Hits:
Description: The Tree Container Library (TCL), presented here, is a generic tree container library which, not only works much like the STL, but is also compatible with the STL algorithms.
Platform: |
Size: 39936 |
Author: qiao |
Hits:
Description: C++ STL 中没有树形容器是最大的遗憾！
还好高手总是能及时出现，本源码就是
目前最强大的树型容器标准库!与大家
分享!-C++ STL no tree container is the biggest regret! Fortunately, you can always timely manner, the source is the current most powerful standard library container tree! To share with you!
Platform: |
Size: 1242112 |
Author: huangyinghui |
Hits:
Description: 用树的应用模拟铁路查询功能。掌握图的邻接表的定义及应用,能够熟练使用邻接表。加强对map容器的理解，能够熟练使用map容器，复习集合和字典的相关知识。理解最短路径问题，并使用Dijkstra算法解决最短路径问题。掌握线形表的使用，并理解优先队列解决问题的过程。利用栈解决需要逆向输出的问题。
-Application of simulation using the tree railway inquiry function. Master graph adjacency list of definitions and applications, able to skillfully use the adjacency list. Enhance the understanding of map containers, able to skillfully use the map container, collection and review of the relevant knowledge dictionary. Understanding of the shortest path problem, and use the Dijkstra shortest path algorithm to solve the problem. To master the use of linear form, and understand the priority queue problem-solving process. Use the stack to resolve the issue of the need to reverse the output.
Platform: |
Size: 2048 |
Author: sunfuquan |
Hits:
Description: 一个KD-tree的类STL模板库，版本为0.7.0-libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree.
Platform: |
Size: 111616 |
Author: 黄常标 |
Hits:
Description: 最优装载方案
成绩: 0 / 折扣: 0.8
试设计一个用队列式分支限界法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。
装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi 。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。
输入：第一行有2个正整数n和c。n是集装箱数，c是轮船的载重量
接下来的1行中有n个正整数，表示集装箱的重量
输出：最大载重量
例如：
输入：
5 10
7 2 6 5 4
输出：
10-Optimal loading program
Results: 0/discount: 0.8
Try to design a queue-type branch and bound by law search a subset of function space tree. The function of the parameters to determine the feasibility of including the node function and the upper bound of the necessary functions, such as function, this function will be loaded for the solution of the problem.
Loading problem described as follows: a group of n containers were loaded on ships to load ships for the c, of which the weight of the container i was wi. A program to find the optimal load, the ship filled with as much as possible, that is unrestricted in the loading volume of cases, as far as possible, re-fitted shipping container.
Input: the first line there are two positive integers n and c. n is the number of containers, c is the ship s deadweight
1 the next line in a positive integer n, that the weight of the container
Output: the maximum load
For example:
Input:
5 10
72,654
Output:
10
Platform: |
Size: 958464 |
Author: cj |
Hits:
Description: 医院结构的树的实现，其中用到的是map容器。递归计算了医院的某个部件含有的子部件的个数，遍历计算-Hospitals to achieve the structure of the tree, which is used in the container map. Recursive calculation of the hospital containing components of a number of sub-components, traversing the calculation
Platform: |
Size: 33792 |
Author: mrchen |
Hits:
Description: 子集树回溯法 试设计一个用回溯法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。
装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。-A subset of the trial design of a backtracking tree with backtracking search a subset of the space tree function. The function of the parameters include the node to determine the feasibility of function and the upper bound of the function and other necessary functions, and this function is used to load solution of the problem. Loading Problem described as follows: there is a group of n containers loaded onto ships to load ships for the c, in which the weight of the container i is wi. Find an optimal load programs, filled with ships as far as possible, that the volume loading unrestricted case, as far as possible re-loaded onto the container ship.
Platform: |
Size: 1024 |
Author: 力困衰怠竭 |
Hits:
Description: Find all java objects contained within a java container or Matlab GUI handle
If no output parameter is specified, then an interactive GUI window will be displayed with a tree-view of all container components, their properties and callbacks.
Platform: |
Size: 32768 |
Author: djimy |
Hits:
Description: 数据结构C.语言描述.应用标准摸板库STL第2版阐述了对象设计和编程原理；开发清晰的模板，针对每个STL容器提供了API；介绍了迭代器；详细讲述了红黑树、哈希表、堆和图表。-C. language to describe the data structure. Application of the standard template library STL version 2 describes the object design and programming principles development of a clear template, for each STL container provides the API introduced iterator detailed account of the red-black tree , hash tables, heap and charts.
Platform: |
Size: 21202944 |
Author: 品牌 |
Hits:
Description: This a Small Container Library, SCL.
If you are not sure what a container is, then ignore the word container in this
file and you ll probably understand everything.
This library provides hash tables, list, queue, stack, symbol, balanced binary
tree, and a vector as abstract data types. Multiple independent instances of
the same abstract type can be used, each with its own arbitrary contents.
SCL does not redefine the world with SCL_int, SCL_long, etc. The SCL functions
use arguments that are standard: long, int, size_t, etc. -This is a Small Container Library, SCL.
If you are not sure what a container is, then ignore the word container in this
file and you ll probably understand everything.
This library provides hash tables, list, queue, stack, symbol, balanced binary
tree, and a vector as abstract data types. Multiple independent instances of
the same abstract type can be used, each with its own arbitrary contents.
SCL does not redefine the world with SCL_int, SCL_long, etc. The SCL functions
use arguments that are standard: long, int, size_t, etc.
Platform: |
Size: 195584 |
Author: GV |
Hits:
Description: 标准关联容器是由红黑树实现的，因此非常重要。-Standard red-black tree from the container associated with implementation, and therefore very important.
Platform: |
Size: 494592 |
Author: aaron |
Hits:
Description: 贪心算法，本章首先引入最优化的概念，然后介绍一种直观的问题求解方法：贪婪算法。最后，应用该算法给出货箱装船问题、背包问题、拓扑排序问题、二分覆盖问题、最短路径问题、最小代价生成树等问题的求解方案。-Greedy algorithm, this chapter first introduces the concept of optimization, then introduces an intuitive problem-solving methods: greedy algorithms. Finally, the algorithm to the shipping container loading problem, knapsack problem, topological sorting problem, the second sub-cover problem, the shortest path problem, minimum cost spanning tree programs for solving problems.
Platform: |
Size: 34816 |
Author: 刘丫丫 |
Hits:
Description: 用b+树算法实现的map,set容器，查找速度超快-map,set container base on B+tree algorithm
。can search faster than the STL container base on RBtree algorithm
Platform: |
Size: 1284096 |
Author: 冯刚 |
Hits:
Description: 书和传统同类书籍的区别是除了介绍基本的数据结构容器如栈、队列、链表、树、二叉树、红黑树、AVL树和图之外，引进了多任务；还介绍了将任意数据结构容器变成支持多任务的方法-this Book and similar books is the difference between traditional Apart from the basic data structure container, such as stacks, queues, linked lists, trees, binary trees, red-black tree, AVL tree and figure, the introduction of multi-task also describes the arbitrary container into a data structure to support multi-tasking approach
Platform: |
Size: 5893120 |
Author: 李乐 |
Hits:
Description: 是用container写的tree，有sequence,multitree,等等，非常详尽。可以直接拿来用-Is written with the container tree, a sequence, multitree, etc., are very detailed. Can be directly used
Platform: |
Size: 969728 |
Author: dou |
Hits:
Description: map映照容器的元素数据由一个键值和一个映照数据组成的，他也是采用红黑树实现，插入元素的键值不允许重复，默认从小到大排-Map of the container element data from the shine upon a key value and a mapping data of composition, he is also using red and black tree realization, the elements of the key value not allowed to repeat, default, since the row
Platform: |
Size: 1024 |
Author: willion |
Hits:
Description: 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 closely. By packing multiple value pairs into each node of the tree the B+ tree reduces heap fragmentation and utilizes cache-line effects better than the standard red-black binary tree. The tree algorithms are based on the implementation in Cormen, Leiserson and Rivest s Introduction into Algorithms, Jan Jannink s paper and other algorithm resources. The classes contain extensive assertion and verification mechanisms to ensure the implementation s correctness by testing the tree invariants. To illustrate the B+ tree s structure a wxWidgets demo program is included in the source package.
Platform: |
Size: 1776640 |
Author: icegull |
Hits:
Description: 层次,wrappable(当容器宽度比长度变小的菜单),鼠标悬停和tab键驱动的菜单栏。最初创建代表选中项的路径在树形视图。
-Hierarchical, wrappable (when container width gets smaller than the menu length), mouse-hover and Tab-key driven menu bar. Originally created to represent a path to the selected item in a tree-view.
Platform: |
Size: 37888 |
Author: sadfas |
Hits:
Description: A container for items of data supplied by the simple tree model for Linux.
Platform: |
Size: 1024 |
Author: hongsaoku |
Hits: