Quiz

An undirected graph has the edges A-B, B-C, C-A, C-D, D-E, E-F and F-D. Which edge is a bridge?

Hint

An edge on a cycle always has a way round it.

C-D

D-E

None: every vertex has at least two edges

A-B