Changes

In a directed graph, a '''dijoin ''' is a set of edges covering every directed cut. For a positive integer ''k'', a '''k-dijoin''' is a set of edges containing ''k'' edges from every directed cut.