Suppose we have a directed graph G and a weight matrix W such that W[i; j] is the time in seconds it takes to traverse arc (i; j). In addition, suppose that each time you go through an intermediate node there is a delay of 2 seconds… (Budget: $30-$250 USD, Jobs: Algorithm)
