You are given a directed graph with 27 nodes representing trade routes and 17 edges connecting them. Each edge has a non-negative weight representing the toll or tariff for that route. Given 945 crates of goods that need to be transported from a source node (the capital) to a destination node (the port city), find the minimum total toll or tariff that must be paid to transport all the crates from the source to the destination.
Analyze constraints and compute optimal solutions step-by-step.
No dry run loaded.
🚀 Practice this problem
Run code, get AI hints & track streak