Question: 7. DAG: A student suggested to topologically sort a D AG G-(V,E) by first running BFS from a vertex s with an in-degree of 0,
7. DAG: A student suggested to topologically sort a D AG G-(V,E) by first running BFS from a vertex s with an in-degree of 0, and then listing the vertices in the order of their distance from s. Show a simple example where this algorithm will not work. You may assume G is indeed a DAG, so no wise-assery
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
