用c写的校园导游系统 用弗洛依德算法实现,能够查询校园任意两个景点的最佳路径.-used to write c campus tour guide system with Floyd algorithm, inquiries to the campus arbitrary two spots in the best path.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001281s ]
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.097221s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001245s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001989s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001229s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003562s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001059s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003161s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014653s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001329s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 130926 [ RunTime:0.001195s ]
