用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001069s ]
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.072099s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001277s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001214s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000959s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003000s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000839s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003604s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015092s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001147s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 318944 [ RunTime:0.016126s ]
