Say that we are given a collection of n numbers di, d2, , dn and 01,02,., on. Give an algorithm that checks if there is a graph so that the {d are the indegree of its vertices and the o are the out degree of the vertices. Not that vertex i must have indegree di and outdegree o Hint: Double the vertices into a bipartite graph and define the capacities
OR
OR