用迪杰斯特拉算法求解最短路径问题，这个算法是我自己编出来的 ，感觉有很多冗余之处，请大家一起改正-Using Dijkstra shortest path algorithm, this algorithm is out of my own, I feel a lot of redundancy, please everyone together to correct
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001187s ]
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.094725s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.006678s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.013876s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.004762s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.004265s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000918s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003736s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016800s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001152s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 184886 [ RunTime:0.019445s ]
