Redundancy

Count how many separate paths connect two parts of the graph. Where several independent routes exist, losing one person or tie changes little. Where only one route exists, that single link is a failure point worth naming before it breaks.

Count how many separate paths connect two parts of the graph. Where several independent routes exist, losing one person or tie changes little. Where only one route exists, that single link is a failure point worth naming before it breaks.

Example

In the friend map, the two clusters were joined by exactly one tie: Priya. When she moved, nothing routed across. Inside the other cluster, three separate paths link Dana and Marcus, so Dana skipping a dinner costs nothing.