Bipartite Graph – Step 1

This diagram represents the bipartite graph after the first step of the maximum flow algorithm, where node 0 is matched with node 2.