有向图 编写程序判断该图是否含有环 如没有则输出其拓扑序列-Digraph write a program to determine whether it contains any part of the plan if there is no sequence of the output of its topological
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.007297s ]
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.162077s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.016728s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.015738s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.003861s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.005541s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001244s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.007213s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.026648s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001613s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 163560 [ RunTime:0.030267s ]
