Question

Diikstras Generate a SPL Tree For Vertex B 9 4 1 12

Answer 1

1.The shortest path from B is B->E

So select B->E

2.Now from E shortest path is E-F Add E-F to the path ==> B->E->F

3.Now shortest from F is B,A.But F-B makes a Cycle

4.So reject F-B and select F-A Add F-A ==> B->E->F->A

5.From A only available path is A-D

SO select A-d Add A->D ==> B->E->F->A->D

6.From D the smallest path is D->G

SO final SPL is B->E->F->A->D->G since all vertex are covered