Dijkstra's (link-state) algorithm. Consider the network below: 2. l 0 2 4 a. Show the operation of Dikstra's algorithm for computing the least cost path from the node 'a' to all other nodes. Terms definition in the algorithm: D(v): cost of the least-cost path from node 'a to node 'v' as of the current iteration. (v): previous node along the current least-cost path from , a to "?. b. N: subset of nodes; v is in N' if the least-cost path from the source to v is definitely known. Your answer should be in the format as (I have filled two cells for you: N Db). p(b) D(C), p(c) Dd), pd) De, pe) 2, a c. What is the shortest path from 'a to e'? 2018/5/15 12:11