What Is The Pseudo Code To Compute The Shortest Path In #1353

if(!T[w].Known) if(T[v].Dist + C(v,w) < T[w].Dist)  { Decrease(T[w].Dist to T[v].Dist +C(v,w)); T[w].path=v; } 

if(T[w].Known) if(T[v].Dist + C(v,w) < T[w].Dist)  { Increase (T[w].Dist to T[v].Dist +C(v,w)); T[w].path=v; } 

if(!T[w].Known) if(T[v].Dist + C(v,w) > T[w].Dist)  { Decrease(T[w].Dist to T[v].Dist +C(v,w); T[w].path=v; } 

if(T[w].Known) if(T[v].Dist + C(v,w) < T[w].Dist)  { Increase(T[w].Dist to T[v].Dist); T[w].path=v; }