搜索资源列表
1089_bingchaji
- POJ1089 并查集可以解决 并查集加路径压缩-POJ1089 and check and check collection set can be solved adding the path compression
3625_kruskal
- 图论基础算法 解决最小生成树问题 克鲁斯卡尔算法加并查集优化-Graph theory based algorithm to solve the problem Kruskal minimum spanning tree algorithm for optimal set of plus and check
Union_set
- 自己实现的并查集这一数据结构，能够较为高效的实现数据合并查询等操作-Their own set of implementation and inspection of the data structure, data can be more efficient queries and other operations combined
stack_queue_ufs
- 自己C++写的单链表栈、单链表队列、并查集-C++ to write their own list of single-stack, single-linked list queue, and check collection
Union
- 算法中的并查集这一类型，介绍了集中简单的并查集类型。 -Algorithm and check the set of this type, describes a simple and focused search set type.
Kruscal
- 快排并查集Kruscal算法+源码 txt 快排并查集Kruscal算法+源码 txt-Row and fast algorithm+ source code search set Kruscal txt row and check the set Kruscal fast algorithm+ source code txt
shujiegou
- 树结构在程序设计中的运用，包括并查集，线段树，树状数组等。-Tree structure used in the program design, including the collection and investigation, segment tree, the tree array, and so on.
bcj
- 使用C++描述的并查集算法资料，非常详细，研究算法的可以学习。-C++ algorithm
Data-Structure
- AC自动机、并查集、左偏树、二维点、后缀数组源码，可作为ACM模板使用-Aho-Corasick Automaton, Disjoint Set, Leftist Tree, Point, Suffix Array Data Structures
UFset
- 并查集的小例子（作业），希望有帮助.数据结构内容，可以运行。-union and find set，its my homework..
kruskal
- 最优化代码的并查集优化的kruskal代码-it is about kruskal,but it is very simple and easy to use!
2cs
- 二叉堆、并查集和树状数组算法，编程学习者的必备知识，可以供noip、noi、acm选手学习-Binary heap, and check the set and tree array algorithms, programming learners the necessary knowledge for noip, noi to acm players learning
Union
- 在一些有N个元素的集合应用问题中，我们通常是在开始时让每个元素构成一个单元素的集合，然后按一定顺序将属于同一组的元素所在的集合合并，其间要反复查找一个元素在哪个集合中。这一类问题近几年来反复出现在信息学的国际国内赛题中，其特点是看似并不复杂，但数据量极大，若用正常的数据结构来描述的话，往往在空间上过大，计算机无法承受；即使在空间上勉强通过，运行的时间复杂度也极高，根本就不可能在比赛规定的运行时间（1～3秒）内计算出试题需要的结果，只能采用一种全新的抽象的特殊数据结构——并查集来描述。-N ele
Hand-in-Hand
- /*题意：判断两幅图是否同构 图中即判断图中环和链的个数是否相同 环和链是否一一相对应 利用并查集 一个集合中若人数num[]和拉手对手p[]相等 则为环，num[]==p[]+1则为链*/-/* The meaning of problems: to determine whether the two images with a composition that judge whether each of the corresponding figure rings and chains
kruakal
- 用并查集和最小堆算法实现KRUSKAL算法-Use and check the set and minimum heap algorithm achieve KRUSKAL algorithms
monkeys
- 10th POI monkeys 问题的解答，使用了并查集，效率比较高-The answers to the monkeys of the 10th POI.
disjointset
- 并查集；启发式合并：让深度较小的树成为深度较大的树的子树-And search sets Heuristic Combinations: allow small depth tree become greater depth tree sub-tree
agri_net
- USACO中的agri-net题，用C++编写，运用了并查集和最小生成树的概念-agri-net of USACO, with C++ prepared ，the concept of minimum spanning tree and search-set involved
dengjia
- 等价类和并查集的使用技巧和详细代码，有注释。-Set of equivalence classes and the use of techniques and investigation and detailed code, annotated.
searchset
- 数据结构预算法并查集实现并查功能，代码简短，ACM题集-search set