Celena Chan 15 053 Extra Credit Dijkstra's Algorithm

[ooohohohohohigu]

you have one weird way of holding a marker

[Funtasmia]

Erm, at vertex C what is the pathcost to E and to F (from C) ? Iam a little confused :/

[roooqi]

you should label last line # 7 as final shortest path from s to all vertices.

thanks

[roooqi]

you label [S A B D C E F T] as final solution of what ??? if you mean this is the shortest path from source S to T, then the shortest path will be S A D T of cost of 9.

best,