搜索资源列表
cons
- 设计用并查集来计算一个无向图的连通分支的算法。 对于给定的无向图G，用并查集计算无向图G 的连通分支。
poj1417
- 北大OJ 1417题的标程代码，并查集和深度优先搜索的经典实现
data_structures
- 一些重要的数据结构，有堆，平衡树treap， 并查集等。
bingchaji_kruskal
- 基于并查集的求最小生成树的Kruskal算法的实现-And set-based search for the Kruskal minimum spanning tree algorithm
src
- PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, colle
SourFile
- 高效率的并查集。 使用rank来优化。-Efficient and check collection. To optimize the use of rank.
UnionFind
- 并查集算法主要实现在若干个不相交集合中的两个操作：第一判断一个集合是否在另一个集合中，第二合并两个不相交的集合-A union-find algorithm is an algorithm that performs two useful operations on such a data structure:1. Find: Determine which set a particular element is in. 2. Union: Combine or merge two sets i
kruskal
- kruskal( 利用堆，并查集（即树的等价问题）实现) -kruskal (the use of heap, and check collection (that is, the issue of tree-equivalent) to achieve)
unionfindset
- 我自己写的并查集的标程（例程），方便适用，短小精悍，可作为模板直接在oj上直接刷题使用。同时亦可作为数学结构学习者学习使用。-I wrote it myself and set the standard search process (routine) to facilitate the application of dapper, can be used as a template directly in the title oj brush to use directly. At the s
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
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
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++
UFSet
- 实现了并查集的功能，参考了算法导论上的各种优化，采用路径压缩。速度比较理想-Achieved and check the functionality of the reference to the Introduction to the various optimization algorithms, using the path compression. Ideal rate
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
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.
1089_bingchaji
- POJ1089 并查集可以解决 并查集加路径压缩-POJ1089 and check and check collection set can be solved adding the path compression