the minimum cut problem between two distinguished nodes in a undirected planar network with limited capacities on both nodes and edges is discussed.
在一般网络中,节点和边都有容量的最小截、最大流问题很容易转化为仅边有容量的问题。
in essence, 3d ventilation network graph is a 「figurative」 ventilation network graph, and it surpasses the technical level of the conventional planar network graph.