搜索资源列表
set
- 详细介绍并查集的定义，算法实现，和应用，便于学习并查集的好资料-Set details and check the definition of algorithm, and applications, easy to learn and a good set of information search
disjointset
- 主要讲述了并查集的具体实现（树形）和应用，并配有例题-And focuses on the concrete realization of search sets (tree) and applications, and sample questions with
bingchaji
- 并查集 这个ppt列举了并查集的主要应用 详细解释了并查集的原理-this powerpoint let us know the find-union exactly
acmcontesttemplate
- Bfs，Dijstara，Floyd，Kruskal，Prim，并查集，网络流，Trie等acm竞赛模板-Bfs Dijstara Floyd Kruskal Prim and the set of network flow Trie search such acm contest template
ufind-wy.txt.tar
- 表示坐标的，并查集，最多可以处理4维坐标-none
3261
- zoj3261 Connections in Galaxy War 的源码，主要考察并查集，并要从后往前建图-source code of zoj3261 :Connections in Galaxy War ，mainly about union-find,and need to build graph from end to the beginning
friend_enemy
- 带路径压缩的并查集扩展形式,用于动态维护查询friend-enemy型等价类,维护和查询复杂度略大于O(1)-With path compression and expansion of the form of search set for the dynamic maintenance queries friend-enemy type of equivalence classes, maintain, and query complexity, slightly larger than O
Set
- 数据结构中集合与字典的类库程序。包含：跳表，散列，并查集等常用程序。-Collection of data structure libraries with the dictionary program. Include: jump tables, hash, and check collection and other popular programs.
poj1988(AC).cpp
- poj1988,并查集。为了挣一点分数上传，呵呵。-solution to poj1988.
2513
- poj上的第2513题，用字典书、并查集、欧拉回路实现，语言是C-poj the first 2513 title, the book with a dictionary, and check collection, Euler circuit implementation language is C++
bingchaji
- 等价类与并查集，觉得还不错，看了受益匪浅啊-Equivalence class and also check sets, that is not bad, saw benefit ah
UFSet
- 实现了并查集的功能，参考了算法导论上的各种优化，采用路径压缩。速度比较理想-Achieved and check the functionality of the reference to the Introduction to the various optimization algorithms, using the path compression. Ideal rate
YellowVigorousPineDisjointSets
- 我的ACM解题报告及源码，为POJ上的并查集基础专题，包括1182、1611、1703、1988、2236、2492、1308，另外还有我做题时搜集的有关资料，博文等-My ACM, for solving report and the source and check on the POJ based projects, including the collection, use and 1182 1703, 1988, 2236, 2492, 1308
UnionFindSet
- 关于并查集方面的一些代码，对于数据结构方面很有帮助-Set on and check some aspects of the code, useful for data structures
ACM-disjointset
- 这个是暑假ACM培训时老师的资料，介绍了并查集的功能和实现，以及路径压缩，还有相关的ACM训练题-It came form the teacher s training, summer ACM club.In the ppt,the data sets were introduced and the function of investigation and implementation, and the path compression,as well as issues related to
Fmsets
- 一个并查集的头文件，里面包含查找节点的根，折叠查找和直接查找节点的根，按秩合并还有按节点数合并-And investigation of a set of header files, which contains the root node to find, folding and direct search to find the root node, according to rank merger also consolidated by the number of nodes
bingchaji
- 并查集 输入任意两个人，可以查到他们是否是亲戚关系-input any people and you can know their relaton
2
- 并查集 并查集 并查集 并查集-bing cha jibing cha jibing cha ji
pku1182
- 北京大学ACM网站的1182题，是关于并查集的结题报告 并含有源码，-Peking 1182 ACM site title is set on and check the concluding reports and contains source code,
data-structure
- 并查集，并查集扩展，堆，矩形切割，线段树，线段树扩展，线段树应用，字段和，子阵和。-And check collection, and investigations set extensions, stack, rectangular cut, segment tree, expand the tree line, tree line applications, fields, and, sub-array and.