The residual graph shows remaining capacity after you have assigned some flow. For each edge with flow and capacity , the residual graph has:
Forward edge with capacity (remaining capacity).
Backward edge with capacity (allows you to undo flow).
The backward edge is the core concept. It lets you reroute flow if you find a better path later. This is what makes flow algorithms work.