Let (G, s, t, c) be a flow network, G V,E).A directed edge e (u, v) is called always fullif f(e) c( for all maximum flows f: it is called sometimes full if f()for some but not all maximum flows; it is called never fulliff(e)