This problem can be transformed into a maximum flow problem by constructing a network "N" = ("X"∪"Y"∪{"s","t"), "E"' }, where# "E"' contains the edges in "G" directed from "X" to "Y".
This problem can be transformed into a maximum flow problem by constructing a network "N" = ("X"∪"Y"∪{"s","t"}, "E"' }, where# "E"' contains the edges in "G" directed from "X" to "Y".