Given the following circuit diagram and the cost for each circuit. What is the l

ID: 3777877 • Letter: G

Question

Given the following circuit diagram and the cost for each circuit.

What is the least cost path for communications between point A and Z?

What path has the minimum amount of hops?

- D - - - - E - - - - F -

- - -

A - - - - - - G - - - - - - - - Z

- -

H - - - - - - - - I - -

Link Cost

A - D - 2

D - E - 3

E - F - 6

F - Z - 3

A - G - 8

E - G - 1

G - Z - 4

A - H - 6

H - I - 4

I - Z - 2

the shortest path between two hops can be found using the modified Dijkstra's algorithm.

the shortest path between a to z is

A-D-E-G-Z is 10 which is lesser than any other path.

the path with the minimum number of hops is A-G-Z having only one hop in between

Please comment if the answer is not sufficient and want algorithm.

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.