I get the residual graph by Ford-Fulkerson Algorithm:
I get that the minimum cut can be found by the residual graph, and when traversing this residual network from the source to all reachable nodes, these nodes define one part of the partition. Call this partition $S$, the rest of the nodes are called $T$. The size of the minimum cut is the sum of the weights of the edges in the original network which flow from a node in $S$ to a node in $T$.
So I think $S = \{S, C, E\}$, and $T = \{T, A, B, D, F\}$. But I found that what I found was not the minimum cut and two subsets I wanted. Why? Is my residual graph wrong?