{HEAD ~ The traditional OSPF recovery} is based on calculating new shortest paths from a node to {TAIL ~ all the destinations} in the changed topology 
{ HEAD ~ The traditional OSPF recovery } is based on calculating new shortest paths from a node to { TAIL ~ all the destinations } in the changed topology
HEAD HEAD HEAD HEAD HEAD HEAD HEAD HEAD OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH TAIL TAIL TAIL TAIL TAIL TAIL TAIL OTH OTH OTH OTH