What is the pseudo code to compute the shortest path in Dijkstra's algorithm? if(T[w]-Known] if(T]v].Dist+C(v,w).Read less