This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001364s ]
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.072973s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000995s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001269s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000942s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003211s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000823s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003306s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014211s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001116s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 398331 [ RunTime:0.027703s ]
