Closing one road: find which place becomes disconnected
Identify a bridge edge in a small network and determine which locations remain reachable after that edge is removed.
The video could not load. Check your connection and try again, or download it directly.
Download video
Open Chinese transcript
- A、B、C三村两两有路,构成三角形;D只通过道路C到D连接网络。
- 先看D的连接表,它只有C到D这一条边,没有第二条替代路线。
- 封闭C到D后,D没有任何出口,所以D与其余村失去联系。
- A、B、C之间的三条道路仍保留,任意两村仍可直接到达。
- 逐点做可达检查,只有D失败;这条唯一连接边控制了D的连通。
- 挑战换成E、F、G成三角形,G再连H。请划掉G到H并检查谁失联,小宝贝到你了。
Sources for this explanation
Logical thinking
Delete road C-D, then trace the locations reachable from each vertex in the remaining graph.
Worked example
Villages A, B and C form a triangle, and D is connected to the network only by road C-D. After C-D is closed, which village is cut off?
D is cut off, while A, B and C remain connected. D loses its only road, but the three edges of the triangle remain.
Try one question
W had only edge Z-W.