Answer:
A) Weighted graph is attached
B) Shortest routes are;
1. A → C → B → D → A
2. A → D → B → C → A
Step-by-step explanation:
A) We are told their home is in City A. So that's where any journey will begin from.
Furthermore we are told that;
City A to City B = 296 miles
City A to City C = 206 miles
City A to City D = 79 miles
City B to City C = 497 miles
City B to City D = 241 miles
City C to City D = 281 miles.
I have attached an image of the weighted graph showing the distances on the appropriate edges.
B) We want to find the shortest route using Brute force method. The brute force method is by solving a particular problem by checking all the possible cases/routes to get the desired result we are looking for.
In this case, the desired result is the shortest route for the family to complete their vacation. So, i have attached a diagram showing the different routes via brute force method.
From the brute force method, the shortest length route is 1023 miles and this routes are from Cities;
1. A → C → B → D → A
2. A → D → B → C → A
