Answer to Question #278956 in Engineering for Theo

Question

After the semester ends, you want to go to a road trip to Kent in Connecticut. You want to find a route with the shortest distance to arrive there. Depending on the route you may pass through five towns (A, B, C, D, E). Table below shows the mileage between two cities through the road that directly connects two towns without any intervening towns. The dash shows that there is no road directly connecting these two towns.

The roads are not one-way.

Mileage

Town

A

B

C

D

E

Kent (Destination)

West Haven (Origin)

20

30

25

-

-

-

A

5

-

35

-

-

B

10

27.5

20

-

C

-

25

-

D

5

30

E

40

Draw the network for this problem where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles.

Use the Dijkstra algorithm to find the shortest path.

Formulate and solve a spreadsheet model for this problem.

Answer 1

It's been a while since this question is posted here. Still, the answer hasn't been got. Consider converting this question to a fully qualified assignment, and we will try to assist. Please click the link below to proceed: Submit order