Floyd算法，计算任意两点间的最短路径，并加入MFC和文件操作，比较实用。-Floyd algorithm to calculate arbitrary shortest path between two points, and to join MFC and file operations, more practical.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001922s ]
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.089378s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002316s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001920s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002121s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003570s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002069s ]
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.015036s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002467s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 106561 [ RunTime:0.001154s ]
