Question about Kosaraju-Sharir Algorithm



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

The driver must be able to return to the restaurant after serving customers to receive his payment, without violating the street directions. After picking up the orders at the restaurant, and using the Kosaraju–Sharir algorithm, 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 C4, 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


Comments

  1. Good question! I took it. Removed mention of the Kosaraju-Sharir algorithm, because I thought irrelevant which algorithm people use to find R1's strongly connected component. I also changed one alternative so that we have an answer that is not E.

    ReplyDelete

Post a Comment

Popular posts from this blog

Question about Graph Theory - Ingrid Barbosa - 06/03/2026 - MO412

Question about DFS - Ingrid Barbosa - 13/03/2026 - MO412