Bridge in a graph
= Bridge in a graph
{wiki=Bridge_(graph_theory)}
A bridge is an edge whose deletion increases the number of components of a graph. Equivalently, it belongs to no cycle; within its original component, deleting it makes the <connected graph> disconnected.