I am given a directed acyclic graph $G = (V,E)$, which can be assumed to be topologically ordered (if needed). The edges in G have two types of costs - a nominal cost $w(e)$ and a spiked cost $p(e)$. The goal is to find a path from a node $s$ to a node $t$ that minimizes the following cost: $$\su...