Lomonosov’s turnip is a very powerful Monte Carlo algorithm for estimating Network reliability. It was invented by M.V. Lomonosov in 1986 and first described in . This algorithm is applicable to finding the probability of network terminal (or all-node) connectivity probability for the case of arbitrary values of edge (or node) failure probabilities. An outstanding feature of this algorithm is that it enables obtaining estimates with high accuracy for very small network failure probabilities known as “rare event situation”. The name “turnip” comes from a diagram reminding a turnip which describes so-called evolution process which is central to the main idea of the algorithm.