Cities A, B, ... , Z are connected in a loop by 26 two way roads: A to B, B to C, .... Z to A. Each road can be destroyed with probability p independently of the others.
Find the probability that, after the rain, there are two cities that are not reachable from each other.
I do not need help solving this problem. I think I may have solved it in fact. My question is with whether or not I am interpreting it correctly as English is not my native language.
Does this mean that if one of the roads are destroyed then two cities are not reachable from each other? Does reachable from each other mean both cities must be able to travel to the other? That is, we cannot have just one way.
Thanks for help.