给定n个结点的有向图的邻接矩阵，可判断该图是否为强连通的，单向连通的，或弱连通的。-For a given n-node directed graph adjacency matrix, can determine whether the plan strongly connected, and one-way connected, or weak connectivity.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001690s ]
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.091448s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001239s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001900s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001219s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003643s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001071s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003183s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015339s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001743s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 184595 [ RunTime:0.001325s ]
