Applied edits to network flow handout

2023-01-08 09:10:54 -08:00
parent 9cec9430b8
commit 3ca7393759
8 changed files with 35 additions and 70 deletions
--- a/Algorithms/parts/06
+++ b/Algorithms/parts/06
@ -1,6 +1,6 @@
-\section{Crosses (Bonus Problem)}
+\section{Crosses}

-You are given an $n \times n$ grid. Some of its squares are white, and some are gray. Your goal is to place $n$ crosses on white cells so that each row and each column contains exactly one cross.
+You are given an $n \times n$ grid. Some of its squares are white, some are gray. Your goal is to place $n$ crosses on white cells so that each row and each column contains exactly one cross.

 \vspace{2ex}