Use Following Directed Graph B 4 F 2 B 1 C 3 D 4 C 6 B 3 D 7 D 6 E 2 E D 5 F D 2 E 3 Dijks Q37098484

Use the following directed graph.

  A: to B is 4  & to F is2

  B: to A is 1 & C is 3 & to D is4

  C: to A is 6 & to B is 3 & to D is7

  D: to A is 6 & to E is 2

  E: to D is 5

  F: to D is 2 & to E is 3

a) Do Dijkstra’s shortest path algorithm starting with Cending with E.Trace the algorithm using the sameformat as I use. Replace ?’s and give the tableper step.

   

Initially:

Tree   has: C

Fringe (F*) has: A6, B3 andD7           

DistTo of these are initialized to be the edge weightsfrom C.

        DistTo   CandidateEdge  

T*   C  0         start

F*     A6         fromC                     

F*     B3         fromC               

F*     D7         fromC   

       Einf                                                     

       Finf                                               

Step1:

Pick  B

OR

 

OR