This paper examines the Ford-Fulkerson algorithm for determining the maximum flow between two nodes. Manual solving methods are approached, with the help of specialized Maple software and through the Pascal programming language.