http://blog.csdn.net/acumon/我的博采园 　　——关注算法设计、AS、C++、国家大事和身边小事zh-CNThu, 24 Aug 2006 00:14:44 GMT60踏雪赤兔http://blog.csdn.net/acumon/archive/2006/08/24/1109913.aspxThu, 24 Aug 2006 00:15:00 GMThttp://blog.csdn.net/acumon/archive/2006/08/24/1109913.aspxhttp://blog.csdn.net/acumon/comments/1109913.aspxhttp://blog.csdn.net/acumon/archive/2006/08/24/1109913.aspx#Feedback0http://blog.csdn.net/acumon/comments/commentRss/1109913.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1109913这是自写的并查集标程。树状合并、带路径压缩的并查集可以以最大O(logN),平均O(1)的复杂度完成合并与测试操作。<img src ="http://blog.csdn.net/acumon/aggbug/1109913.aspx" width = "1" height = "1" />踏雪赤兔http://blog.csdn.net/acumon/archive/2006/08/23/1109788.aspxWed, 23 Aug 2006 23:17:00 GMThttp://blog.csdn.net/acumon/archive/2006/08/23/1109788.aspxhttp://blog.csdn.net/acumon/comments/1109788.aspxhttp://blog.csdn.net/acumon/archive/2006/08/23/1109788.aspx#Feedback-2http://blog.csdn.net/acumon/comments/commentRss/1109788.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1109788本标程介绍了一些经典的图论算法，C++描述。<img src ="http://blog.csdn.net/acumon/aggbug/1109788.aspx" width = "1" height = "1" />踏雪赤兔http://blog.csdn.net/acumon/archive/2006/08/23/1109736.aspxWed, 23 Aug 2006 22:43:00 GMThttp://blog.csdn.net/acumon/archive/2006/08/23/1109736.aspxhttp://blog.csdn.net/acumon/comments/1109736.aspxhttp://blog.csdn.net/acumon/archive/2006/08/23/1109736.aspx#Feedback0http://blog.csdn.net/acumon/comments/commentRss/1109736.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1109736本例程演示了STL heap的一个最重要的应用——实现优先队列。并将其方法封装到一个PQ类中 <img src ="http://blog.csdn.net/acumon/aggbug/1109736.aspx" width = "1" height = "1" />