<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[vip_today的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/vip_today</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; vip_today]]></copyright><item><title><![CDATA[hdu 1272 小希的迷宫 简单的并查集]]></title><link>https://blog.youkuaiyun.com/vip_today/article/details/5947491</link><guid>https://blog.youkuaiyun.com/vip_today/article/details/5947491</guid><author>vip_today</author><pubDate>Sun, 17 Oct 2010 22:55:00 +0800</pubDate><description><![CDATA[<br />本题要求给定的无向图，判断所给图是不是连通的，并且图中不存在回路，用并查集判断是否存在回路，当某条边的两个节点有共同的父节点时说明图中存在回路，在判断图是不是连通只要判断所有的节点的父节点是否只有一个。<br />/*
	Author: ACb0y
	Date: 2010-10-17
	ProblemId: hdu 1272 小希的迷宫
	Type: union set
	Result: 3082681 2010-10-17 22:40:53 Accepted 1272 78MS 34]]></description><category></category></item></channel></rss>