求最大流的Dinic和SAP算法的实现，各自有递归与非递归版本。在稀疏图上效果比较好。-Dinic for the maximum flow algorithm and the SAP implementation, each of which has recursive and non-recursive version. Effect on the sparse map is better.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001312s ]
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.097137s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001107s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001880s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001230s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003647s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001078s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003252s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014975s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001391s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 130923 [ RunTime:0.001400s ]
