<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>
	「[原创] union-find算法中的quick-find算法的复杂度」的评论	</title>
	<atom:link href="https://www.codelast.com/%E5%8E%9F%E5%88%9B-union-find%E7%AE%97%E6%B3%95%E4%B8%AD%E7%9A%84quick-find%E7%AE%97%E6%B3%95%E7%9A%84%E5%A4%8D%E6%9D%82%E5%BA%A6/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-union-find%e7%ae%97%e6%b3%95%e4%b8%ad%e7%9a%84quick-find%e7%ae%97%e6%b3%95%e7%9a%84%e5%a4%8d%e6%9d%82%e5%ba%a6/</link>
	<description>最优化之路</description>
	<lastBuildDate>Mon, 27 Apr 2020 18:05:42 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>
</channel>
</rss>
