http://blog.csdn.net/fuliangliang/category/179741.aspxzh-CNSat, 23 Feb 2008 11:45:00 GMT60fulianghttp://blog.csdn.net/fuliangliang/archive/2006/05/30/762951.aspxTue, 30 May 2006 11:10:00 GMThttp://blog.csdn.net/fuliangliang/archive/2006/05/30/762951.aspxhttp://blog.csdn.net/fuliangliang/comments/762951.aspxhttp://blog.csdn.net/fuliangliang/archive/2006/05/30/762951.aspx#Feedback0http://blog.csdn.net/fuliangliang/comments/commentRss/762951.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=762951并查集为解决等价类问题提供了一个高效快速的数据结构,在许多涉及到等价类的算法中,他都扮演着 改进算法中使用的数据机构的角色,他对提高算法的效率是可见一斑,例如在带有限期的作业问题中,在求最小生成树Kruskal算法都可以使用并查集高效的实现.<img src ="http://blog.csdn.net/fuliangliang/aggbug/762951.aspx" width = "1" height = "1" />fulianghttp://blog.csdn.net/fuliangliang/archive/2006/05/30/762849.aspxTue, 30 May 2006 10:19:00 GMThttp://blog.csdn.net/fuliangliang/archive/2006/05/30/762849.aspxhttp://blog.csdn.net/fuliangliang/comments/762849.aspxhttp://blog.csdn.net/fuliangliang/archive/2006/05/30/762849.aspx#Feedback0http://blog.csdn.net/fuliangliang/comments/commentRss/762849.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=762849堆排序的时间复杂性为nlog(n),空间复杂度为o(1),为比较排序的下界,因此具有非常好的性能,使用堆,也很容易实现堆排序.<img src ="http://blog.csdn.net/fuliangliang/aggbug/762849.aspx" width = "1" height = "1" />fulianghttp://blog.csdn.net/fuliangliang/archive/2006/05/28/759449.aspxSun, 28 May 2006 23:12:00 GMThttp://blog.csdn.net/fuliangliang/archive/2006/05/28/759449.aspxhttp://blog.csdn.net/fuliangliang/comments/759449.aspxhttp://blog.csdn.net/fuliangliang/archive/2006/05/28/759449.aspx#Feedback0http://blog.csdn.net/fuliangliang/comments/commentRss/759449.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=759449作为最小堆应用,实现了另一个实用的类----优先队列.优先队列有着广泛的应用,在操作系统中,许多消息队列、等待队列等,使用了优先队列，在算法中，我们常用优先队列来实现广度搜索、贪心算法等。<img src ="http://blog.csdn.net/fuliangliang/aggbug/759449.aspx" width = "1" height = "1" />fulianghttp://blog.csdn.net/fuliangliang/archive/2006/05/28/758334.aspxSun, 28 May 2006 11:12:00 GMThttp://blog.csdn.net/fuliangliang/archive/2006/05/28/758334.aspxhttp://blog.csdn.net/fuliangliang/comments/758334.aspxhttp://blog.csdn.net/fuliangliang/archive/2006/05/28/758334.aspx#Feedback0http://blog.csdn.net/fuliangliang/comments/commentRss/758334.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=758334最小(大)堆是比较常用的数据结构,是实现优先队列和堆排序的基础,也可以实现例如霍夫曼编码,贪心算法等,具有很好的时间复杂性.<img src ="http://blog.csdn.net/fuliangliang/aggbug/758334.aspx" width = "1" height = "1" />fulianghttp://blog.csdn.net/fuliangliang/archive/2006/05/28/758323.aspxSun, 28 May 2006 11:01:00 GMThttp://blog.csdn.net/fuliangliang/archive/2006/05/28/758323.aspxhttp://blog.csdn.net/fuliangliang/comments/758323.aspxhttp://blog.csdn.net/fuliangliang/archive/2006/05/28/758323.aspx#Feedback0http://blog.csdn.net/fuliangliang/comments/commentRss/758323.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=758323最小(大)堆是比较常用的数据结构,是实现优先队列和堆排序的基础,也可以实现例如霍夫曼编码,贪心算法等,具有很好的时间复杂性.<img src ="http://blog.csdn.net/fuliangliang/aggbug/758323.aspx" width = "1" height = "1" />