In the data structure of graphs, let an undirected graph g =: P(G), and for any e''? E', both of which have p(G-E'')=p(G), is called the edge cut set of G, or simply cut set. If E'={e}, e is called trimming or bridge.

Where P(G) represents the number of connected branches of graph g.