已知一个网络对应的邻接矩阵，求该网络上的最大流。属于数据结构中的问题。-a network known counterparts in the adjacent matrix, the network for the maximum flow. Data structures belonging to the problem.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002420s ]
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.087221s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002358s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001908s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002205s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003633s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002255s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003299s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014439s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002288s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 141612 [ RunTime:0.001205s ]
