<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>DisjoinSet on 禹过留声</title><link>//blog.haojunyu.com/tags/disjoinset/</link><description>Recent content in DisjoinSet on 禹过留声</description><generator>Hugo -- gohugo.io</generator><managingEditor>haojunyu2012@gmail.com (hjy)</managingEditor><webMaster>haojunyu2012@gmail.com (hjy)</webMaster><lastBuildDate>Tue, 30 Jun 2015 17:54:04 +0800</lastBuildDate><atom:link href="//blog.haojunyu.com/tags/disjoinset/index.xml" rel="self" type="application/rss+xml"/><item><title>基本算法之并查集</title><link>//blog.haojunyu.com/coder/algorithm_disjoinset/</link><pubDate>Tue, 30 Jun 2015 17:54:04 +0800</pubDate><author>haojunyu2012@gmail.com (hjy)</author><guid>//blog.haojunyu.com/coder/algorithm_disjoinset/</guid><description>&lt;p>并查集是一种用途广泛的数据结构，能够快速地处理集合的合并和查询问题，并且实现起来非常方便，在很多场合中都有着非常巧妙的应用。本文首先介绍并查集的定义、原理及具体实现，然后结合hihocoder以及poj上的题目做一些具体实践。&lt;/p></description></item></channel></rss>