I am trying to find the minimum cut corresponding to the maximum flow that is given in the following network (the numbers in italic represent flow; the boldfaced numbers represent capacity).
I tried to use the procedure as described in the first answer here: https://stackoverflow.com/questions/4482986/how-can-i-find-the-minimum-cut-on-a-graph-using-a-maximum-flow-algorithm
So I marked the nodes that 'can be reached' still, and then drew a line through the edges that are in between a node that can be reached, and one that cannot be reached. According to this logic, I think nodes s, c, d, and e should be part of the the set $B$ of the $(B,P)$ cut, and $P$ should be $P=\{a, b, p, f\}$. However, the answer key says that node $a$ is part of the set $B$ and not of $P$. What am I doing wrong? Thanks in advance.
