大叶大学课程.pptVIP

Graph TheoryChapter 5 Networks 大葉大學 資訊工程系黃鈴玲 Outline 5.1 An Introduction to Networks 5.2 The Max-Flow Min-Cut Theorem 5.3 A Max-Flow Min-Cut Algorithm 5.5 Connectivity and Edge-Connectivity 5.6 Menger’s Theorem 5.1 An Introduction to  Networks Definition: A network N is a digraph D with two distinguished vertices s and t, called the source and sink, respectively, and a nonnegative integer-valued function c on E(D), called the capacity function of N. The function c takes on nonnegative integers and ?. The digraph D is called the underlying digraph of N. If a = (u, v) is an arc of D, then c(a) = c(u, v) is called the capacity of a. Definition: For a vertex x in a digraph D, the out-neighborhood and in-neighborhood of x are defined by N+(x) = { y ?V(D) | (x, y) ? E(D) } andN-(x) = { y ? V(D) | (y, x) ? E(D) } , respectively. Definition: A flow in N is an integer-valued function f on E(D) such that 0? f(a) ? c(a) for every a ? E(D) and The net flow out of a vertex x is defined as  While the net flow into x is Definition: For an arc a = (x, y) of N, the value f(a) = f(x, y) is called the flow in or along arc a, and may be thought of as the amount of material that is transported under the flow f along the arc (x, y). Definition: The value f(N) of the flow f in N is the net flow out of the source s that is, Definition: Let X, Y ? V(D),  (X,Y) = {(x, y) ? E(D) | x ? X, y ? Y }. A cut in N is a set of arcs of the type (P, ) in D, where P ? V(D), containing s but not t and where = V(D) - P. Thm 5.1 Let N be a network and f a flow in N. If (P, )is a cut of N, then the value of the flow in N is given by Which is the net flow out of source s. If x? P – {s}, then it follows from equation (5.2) that the net flow out of the vertex x is given by Hence, if we sum the net flow out of a vertex x over all vertices x of P (including s), we obtain Now and s