COMP 251 Final: FINAL Crib Sheet

• School: McGill University
• Department: Computer Science (Sci)
• Course: COMP 251
• Professor: Michel Lapointe

Document Summary

;; fout(s)=fin(t) ;; conservation constraint (v,w) v v w v (cid:224) s has no incoming edges; all flow form s is spread to all verts vsi from s; all vsi pass their flow to adj verts eventually all flow would be redirected to fin(t). F = fout (u) f (e) fin(u)=fout (s) f (e)=fout ( a) fin( a) e cut (a ,b) e cut ( b, a) u a u a. Least squares find the parameters m and c that minimize the sum of the squared errors is the error of that point at xi from the line: y=mx +c. To show that f (n,k)=2n 1 n (cid:224) f (n, k)= f (n 1,k 1)+ k=1 f (n 1,k ) n k=1 n k=1 n k=1 n. Since we can"t make f(n 1,0) and f(n 1,n) f (n 1,k 1) n and f (n 1, k) would become k=1 k=1 n 1 k=1 f (n 1,k)