Fig. 1: Example of a failure/recovery process of the Copenhagen metro network.
From: Topological assessment of recoverability in public transport networks
Colors indicate strongly connected components. a original network. b partial failure of 20 links. c greedy recovery adds first the links that yield the largest increase in performance. d recovery successively connects smaller components to the largest connected component. e links connecting to end nodes are the last to be recovered. f the network is back in its original state at the end of the recovery process.
