用c做的图的数据结构的作业,建立有向图,深度广度搜索,分为递归和非递归方式.-C to do with the map data structure operations, the establishment has to map the depth of breadth of search, is divided into recursive and non-recursive way.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001323s ]
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.090669s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001239s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001872s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001248s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003613s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001054s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003262s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014364s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001294s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 154507 [ RunTime:0.001287s ]
