An example 10 a If b fails, a needs to update the link state for a->B a But the spanning tree computed based on the original topology does not reach all nodes. AAn example 10 A B  If B fails, A needs to update the link state for A->B.  But the spanning tree computed based on the original topology does not reach all nodes