Asian Journal of Current Research

A SWIFT APPROACH TO OBTAIN THE MAXIMUM FLOW IN A NETWORK FLOW PROBLEM

PROTIMA DASH *

Department of GED, Daffodil International University, Bangladesh

*Author to whom correspondence should be addressed.

---

Abstract

This paper presents a swift approach for solving maximum flow problem along with numerical illustration. Comparative study among the solutions obtained by the proposed method and the other existing methods has also been carried out. Here observed that this proposed method provides the maximum flow very swiftly.

Keywords: Maximum flow, maximum flow problem, augmenting path, residual network, residual capacity

---

---