Share
Explore BrainMass

Dijkstra?s Shortest Path Algorithm

Consider the following network.

a) With the indicated link costs, use Dijkstra?s shortest path algorithm to compute the shortest path from E to all network nodes. Show how the algorithm works by computing a table.

b) Eliminate node A, and redo the problem starting from node B.

Please refer to the attachment to view the diagram.

Attachments

Solution Preview

The Dijkstra?s algorithm begins with the source node E. The value of all other nodes are infinity. Then it takes all ...

$2.19