Multiple Choice
The figure below shows the possible routes from city A to city J as well as the time (in minutes) required for a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities) . A traveler wishes to find the quickest option to travel from city A to city J. 
What is the time to travel between nodes F and J?
A) 120
B) 140
C) 160
D) 180
E) 200
Correct Answer:
Verified
Correct Answer:
Verified
Q1: For a minimum cost flow problem to
Q2: Each node in a minimum cost flow
Q4: The objective of a maximum flow problem
Q5: The figure below shows the nodes (A-I)
Q6: The figure below shows the possible routes
Q7: In a shortest path problem there are
Q8: The figure below shows the nodes (A-I)
Q9: Any minimum cost flow problem where each
Q10: Any node where the net amount of
Q11: A shortest path problem is required to