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