超市选址，用数据结构，求最小生成树问题。自设计算法为超市寻找一个最短路径。-Supermarket site, the data structure, and minimum spanning tree problem. Since the design of algorithms for the supermarket to find a shortest path.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001630s ]
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.114336s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000916s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001087s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000984s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.002984s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000833s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003656s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014371s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001049s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 135824 [ RunTime:0.014825s ]
