这是一个经典的数据结构算法．是最小路径的搜索算法，有些书上有介绍，但这次提供的是可以运行的程序．-This is a classic algorithm data structure. It is the smallest path search algorithms, there are some books, but this can be provided by a running program.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001293s ]
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.089941s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001284s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001903s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001243s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003696s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001051s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003203s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014430s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001307s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 142217 [ RunTime:0.001584s ]
