In this paper we want to introduce a different approach for finding the maximum flow of a maximal- flow problem involving less number of iterations and augmentations than Edmonds- Karp algorithm. A numerical example is shown for demonstrating the proposed method and worked out the maximal-flow problem as a Breadth First Search (BFS).