Optimal Vessel Route Function | Dataford Interview Questions

Write a function to calculate the optimal route for a vessel given specific constraints.

Use a directed graph where graph[u] contains [v, fuel, time] edges. Return the feasible route minimizing total time, then total fuel, then lexicographically smallest path. Return None if no route satisfies both limits.

Signature: def calculate_optimal_route(graph, start, destination, max_fuel, max_time):

Return {"path": [...], "fuel": F, "time": T}.

Example: 0 -> 1 costs (4, 8) and 1 -> 3 costs (4, 5), so the result is {"path": [0, 1, 3], "fuel": 8, "time": 13} when permitted. A route exceeding either limit is invalid.

Constraints

1 <= len(graph) <= 100
Each edge is represented as [neighbor, fuel, time]
0 <= fuel and time for every edge
0 <= start, destination < len(graph)
0 <= max_fuel and max_time
The graph is directed
Return None when no feasible route exists

Function Signature

def calculate_optimal_route(graph, start, destination, max_fuel, max_time):

Your question is Optimal Vessel Route Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem