Use the algorithm given in the text to find a topological sorting for the “subset” relation on .
To find the topological sorting for the subset “subset” relation on the given set.
The given subset relation on the power set .
The following is the algorithm given using which the topological sorting is to be found out for the given relation-
The relation is partial order on the sets. So now using the algorithm on the set
Pick any element in .
So now let us follow the above algorithm for the given power set
The set has the minimal element , so removing it,
The set will be . Now the remaining minimal elements will be .
So till now the topological sorting order will be , , .
Also, for the second set of minimal elements as .
Further pick the next level of elements , , .
So till now the topological order sorting is .
Now continuing in the same way, the next level of ordering
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started