Consider the following network. With the indicated link costs, use Dijkstra’s sh

Question

Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to the one shown below.

See image: http://oi53.tinypic.com/ej75hx.jpg

Also,

Using Dijkstra's algorithm, and showing your work using a table similar to the one shown, do the following:

a) Compute the shortest path from y to all network nodes.
b) Compute the shortest path from t to all network nodes

Explanation / Answer

i have the same question for an assignment tomorrow...do you happen to go to lsbu...anyway work it out because s is not a value in our exercise...im trying following that tutorial:

http://www.algolist.com/Dijkstra's_algorithm

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---