摘要:
First problem to learn Max Flow. Ford-Fulkerson is a group of algorithms - Dinic is one of it.It is an iterative process: we use BFS to check augament 阅读全文
posted @ 2016-02-17 12:23
Tonix
阅读(372)
评论(0)
推荐(0)
Tony's LogAlgorithms, Distributed System, Machine Learning |