Question: TOPOLOGICAL SORT Consider the following graph (a) Suppose we run the topological sort algorithm on this graph. List three different possible valid outputs. (b) Suppose
TOPOLOGICAL SORT

Consider the following graph (a) Suppose we run the topological sort algorithm on this graph. List three different possible valid outputs. (b) Suppose we want to modify this graph so that running topological sort is impossible -so that there is no valid output when we try running the algorithm. We are allowed to change the graph by either adding or removing exactly one edge. What edge would you add or remove? Briefly explain why your change causes the graph to no longer have a valid topological ordering
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
