Bipartite Graph – Final Step

This diagram represents the bipartite graph after the final step of the maximum flow algorithm, where node 1 is matched with node 3.