The bakery and customers are vertices and all of them are connected (there is no pair of vertices that are not connected with an edge. The weight of edges is the time that you need to take to travel between vertices. The edges are two-way (your graph is undirected). Please solve this problem using the DP technique. Show five steps of DP.
Dynamic Programming - Finding the Best Delivery Route Problem:
Assume that you work for a pizza bakery as a delivery boy/girl. You are responsible for delivering pizzas prepared based on online orders. You collect orders once an hour, then start delivering. You would like to determine the route where you deliver all pizzas in minimum time.
You can illustrate this problem as follows:
The bakery and customers are vertices and all of them are connected (there is no pair of vertices that are not connected with an edge. The weight of edges is the time that you need to take to travel between vertices. The edges are two-way (your graph is undirected).
Please solve this problem using the DP technique. Show five steps of DP.
Step by step
Solved in 2 steps
