A residual graph is a transformed version of a flow network that reflects the remaining capacity for flow between nodes, allowing for the identification of augmenting paths to optimize flow. It is crucial in algorithms like the Ford-Fulkerson method for computing the maximum flow in a network, as it helps track potential adjustments to the current flow configuration.