MathJax


Saturday, March 28, 2026

2026-333

A delivery driver is working in a neighborhood where the streets are one-way. He serves one restaurant (R1) and has received 6 delivery requests (C1 to C6) from different customers in that neighborhood. The graph below represents the routes, respecting the directions of the streets. 

The driver will try and satisfy as many requests as possible, but must return to the restaurant after serving customers to receive his payment, without violating the street directions. After picking up the orders at the restaurant, which of the following alternatives is correct? 

(A) All customers would receive their orders.

(B) Only customers C1 and C3 would receive their orders.

(C) Customers C5 and C6 would not receive their orders.

(D) Only customer C1 and C2 would receive their order.

(E) None of the alternatives.


Original idea by: Ingrid Barbosa

No comments:

Post a Comment

2026-335

Maria studies at UNICAMP and is taking a Graph Algorithms class.  Driven by curiosity, she applied what she learned in class to a network ge...