Consider the network fragment shown. S has only two attached

neighbors, B and Y$.$ B has a minimum$-$cost path to destination D $($not

shown$)$ of $8$ while Y has a minimum$-$cost path to D of $3.$ The complete

paths from B and Y to D are not shown. All link costs in the network

have strictly positive integer values