Network Flows, Algorithms, Modeling, Data Science, Artificial Intelligence.
is known as the bipartite matching problem. A bipartite graph is a graph G=(N₁ ∪ N₂, E) such that every edge connects a node in N₁ with N₂. N₁ in our problem are the workers, and N₂ is the job we are trying to match workers to. We begin our solution by first adding two special nodes, called source