Say that an n-vertex directed acyclic graph ~G is compact if there is some way of numbering the vertices of~G with the integers from 0 to n−1 such that~G contains the edge (i, j) if and only if i < j, for all i, j in [0,n−1]. Give an O(n2)-time algorithm for detecting if ~G is compact.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.