of the three arrays at each intermediate stagegives the following outputin which"oois used to represent the infinity symbol ""computing shortest paths from | + | oo oo oo oo tight |no no no no no pred |none none none none none vertex has minimal estimateand so is tight neighbour has estimate decreased from oo to taking shortcut via neighbour has estimate decreased from oo to taking shortcut via | + | oo oo tight |yes no no no no pred |none none none vertex has minimal estimateand so is tight neighbour is already tight neighbour has estimate decreased from oo to taking shortcut via neighbour has estimate decreased from to taking shortcut via neighbour has estimate decreased from oo to taking shortcut via | + | tight |yes yes no no no pred |none vertex has minimal estimateand so is tight neighbour is already tight neighbour has estimate unchanged neighbour has estimate decreased from to taking shortcut via | + | tight |yes yes yes no no pred |none