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