Use the bipartite matching algorithm to achieve domain

Question

Use the bipartite matching algorithm to achieve domain consistency for all diff(x₁,...,x₅), where x₁ ∈ {1, 4}, x₂ ∈ {1, 3}, x₃ ∈ {3, 6}, x₄ ∈ {2, 3, 5}, x₅ ∈ {1, 2, 3, 4, 5, 6, 7}.

Do it once by identifying even alternating cycles and even alternating paths on the graph.

Then do it again by identifying strongly connected components on the associated directed grap.