After computing max flow, the residual graph reveals the min-cut. Run a BFS or DFS from the source on the residual graph. Let be the set of reachable nodes. Let be the remaining nodes. The edges from to form the min-cut.
These edges are saturated (flow equals capacity), so they have zero residual capacity. This gives you both the max flow value and the actual edges that form the bottleneck.