Due to a cascading series of errors, some routers are advertising negative costs along links. The errors are so bad that some path between a source S and a destination D has a loop of total negative cost. Nevertheless, the routing algorithm is able compute a minimal-cost routes between S and D. What is the route cost, and how was did the routing algorithm find it?