Prepared By:
Nirmal Kumar Sahu

---

---

Introduction

A flow network N consist of the following:
A connected directed graph G with non negative integer weights on edges.
where the weight of an edge e called the capacity c(e) of e.
Two distinguished vertices s and t of G, called source and sink.
such that s has no incoming edges and t has no outgoing edges.