Minimum Time for Food Deliveries

Problem Statement

Minimum Time for Food Deliveries Problem Description A food delivery app is adding a feature that lets one delivery agent carry several orders on a single trip. The city's road network has connection_nodes junctions, numbered 0 to connection_nodes - 1 , and m roads. Road i joins junction connection_from[i] and junction connection_to[i] . It can be travelled in both directions , and travelling it in either direction takes connection_weight[i] minutes. There are k orders, and order i must be delivered at junction deliveries[i] . The agent starts at junction 0 carrying every order. The agent may travel along any roads, in any order, passing through any junction any number of times. An order is delivered the moment the agent reaches its junction. After all k orders have been delivered, the agent must return to junction 0 . Find the minimum total travel time for the whole trip: from leaving junction 0 , through all k deliveries, back to junction 0 . If some delivery junction cannot be reach