最大流问题之Ford-Fulkerson算法

Ford-Fulkerson算法（亦即标号法？）的输入与步骤如下输入给定一个容量为c的图G=(V, E)，源点s与汇点（终点）步骤对图G中每一个边(u, v)的流量f(u, v)进行初始化为查询过程：寻找（DFS、深度优先搜索方式）图G中的一条路径p，其中每一条边(u, v) ∈p，都有fc(u, v) = c(u, v) - f(u, v) > 0（c(u, v) 代表当前边的容量，f(u, v) 代表当前边已有的流量，即c(u, v) - f(u, v)代表当前边可用的最大流量，即剩余流量调整过程：计算当前路径下每条边的最小剩余容量，cf(p) = min{fc(u, v) : (u, v) ∈p}，然后对于每条边进行如下操作f(u, v) = f(u, v) + cf(p) （前向狐f(v, u) = f(v, u) - cf(p) （后向狐往复上述2与3步骤，直至无法找到路径p为止... Read More

Solve the problem “proc_open(): unable to create pipe Too many open files” while using phar

I feel quite confident in altering phar.c - I shall do so as soon as my new laptop arrives, the old and faithful one having given up the ghost some days ago - but I think the problem lies rather in compiling (and distributing) the resulting phar.so module, which must match the existing PHP installation.For me on OpenSuSE for example the easiest option seems to be to download the php5-phar SRPM and... Read More

《Linux 网络编程》随记之第一章网络编程概述 & 第二章 TCP/IP 协议

http://blog.ihuxu.com/note-of-the-network-programming文章来源：胡小旭 => 《Linux网络编程》随记之第一章网络编程概述 & 第二章TCP/IP协议 Read More