This diagram represents a bipartite graph where the maximum flow algorithm works better than the greedy choice.
Bipartite Graph Example
—
by
—
by
This diagram represents a bipartite graph where the maximum flow algorithm works better than the greedy choice.