随笔分类 - 网络流

Dinic 算法钩沉

摘要：最初是从《挑战程序设计竞赛》上了解到 Dinic 算法的。其中对于 Dinic 算法中的关键词——分层图（layered network，也称『层次图』）的引入的解释如下：因为最短增广路（shortest augmenting path，SAP）的长度在增广过程中始终不会变短，所以无需每次都通过阅读全文

posted @ 2017-07-10 14:35 Pat 阅读(292) 评论(0) 推荐(0)

Notions of Flow Networks and Flows

摘要：这篇随笔是对算法导论（Introduction to Algorithms, 3rd. Ed.）第26章 Maximum Flow的摘录。 1. A flow network $G = (V, E )$ is a directed graph in which each edge $(u, v) \ 阅读全文

posted @ 2015-10-10 13:56 Pat 阅读(362) 评论(0) 推荐(0)

Pat

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。

随笔分类 - 网络流

公告

Pat

「以解决问题为乐」 真的喜欢么？真的喜欢就去做吧。 Lost Boy Calling 。。。。 ... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code. This is an obscurity that catches the unwary. 原来我什么都不懂。

随笔分类 - 网络流

公告

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。