Bipartite Graph Example

This diagram represents a bipartite graph where the maximum flow algorithm would work better than the greedy choice. All edges have a weight of 1.