Reference no: EM132157055
Use Dijkstra's Algorithm to find the least cost path between node A and every other node in the edge-weighted undirected graph
wG = , V ={A, B, C, D, E, F, G>, wE ={((A,B),4)), ((A, C),5), ((A, D),3), ((B,C),2), ((B,F),3), ((B,G),4), ((C,D),6), ((C,E),4), ((C,F),4), ((D,E),3), ((E, F),2), ((F,G), 5)}.
Then create the Forwarding Table at node A.