We have a graph $G = (V, E)$. Is it possible to have a cut (S, V-S) that cuts the graph G such that S is empty? That is, a cut that cuts nothing, like the image below shows. The reason that I am asking is that I am reading Introduction to Algorithms, 3rd edition. […]

Categories

## Graph cut that cuts nothing?

- Post author By Q+A Expert
- Post date March 29, 2020
- No Comments on Graph cut that cuts nothing?

- Tags 3rd edition. Here I am studying the proof of safe edges to add in a minimum spanning tree (theorem 23.1 if anyone is wondering). In this proo, a cut that cuts nothing, and let (u, E) be a connected, E)$. Is it possible to have a cut (S, edge (u, it is said that "Let T be a minimum spanning tree that includes A" - does this mean that A is a subset of T and thus may actually be equivale, Let $S, like the image below shows. The reason that I am asking is that I am reading Introduction to Algorithms, undirected graph with a real-valued weight function w defined on E. Let A be a subset of E that is included in some minimum spanning tree for, V - S) be any cut of G that respects A, V - S). Then, V-S) that cuts the graph G such that S is empty? That is, v) be a light edge crossing (S, v) is safe for A., We have a graph $G = (V