一个效率还可以的配对堆
Fibonacci Heap太难写了
配对堆可以有效替代Fibonacci Heap
附带了用它实现的Dijkstra
复杂度O(nlogn+e)
-An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001759s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.075160s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001018s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001153s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000953s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003052s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000846s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003689s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.026004s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001760s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 206177 [ RunTime:0.020194s ]
