# graph theory

Anonymous
timer Asked: Jul 4th, 2018

Question description

Consider a flow network (G, f, c, s, t) with the following specifications:

• V (G) := {(x, y) : x, y ∈ [−10, 10] ∩ Z}
• arcs between every two vertices with (Euclidean) distance exactly one
• c(e) := max{0, y2 ± x}, where x and y signify the values of x and y at
• the end of the arc and ± resolves to + for an arc between two ordered

pairs with the same y-coordinate and − for an arc between two ordered

pairs with the same x-coordinate.

• s is the origin
• t is (1, 1)
• Draw a picture showing the flow you obtain after applying the augmenting

path algorithm, as well as the corresponding cut.

(Top Tutor) Studypool Tutor
School: UCLA
Studypool has helped 1,244,100 students
flag Report DMCA

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors