Ford Fulkerson (Maximum flow, minimum cut) using DFS, adjacency list implementation in Python

Question

I am coding in Python and I am a beginner. I am stuck with Ford-Fulkerson DFS adjacency list code. Somehow, I am not able to get the flow variable assigned correctly. It would b