int fastest(vector <string> &A);
Fastest() should return the fewest number of teleports that it takes to go from base 0 to base N-1. If you cannot get to base N-1 from base 0, return -1.
Question 2: Topological SortWhich of the following are valid topological sorts of the graph to the right?
Part 1: Suppose you are determining the maximum flow through this graph. Tell me
your first augmenting path using each of the following path determination algorithms:
The maximum flow through this graph is 51. You've asked your friend Skippy to tell you
what the minimum cut of this graph is. Below are four potential answers that Skippy
gives you. For each of these answers, tell me whether the answer is correct or not. If
incorrect, tell me why.