*мост, cut-edge, cut-arc*

**Bridge** is an edge of a graph whose deletion increases the graph’s number of connected components.

Equivalently, an edge is a **bridge** if and only if it is not contained in any cycle.

*мост, cut-edge, cut-arc*

**Bridge** is an edge of a graph whose deletion increases the graph’s number of connected components.

Equivalently, an edge is a **bridge** if and only if it is not contained in any cycle.