Bipartite Graph Example

This diagram visualizes a bipartite graph where the maximum flow algorithm works better than a greedy choice. The numbers on the edges represent the capacities of the edges.