[Solved]Give Example Directed Graph Scc Algorithm Gives Wrong Sccs Second Depth First Search Perfo Q37245626

Give an example of a directed graph for which the SCC algorithm gives the wrong SCCs if the second depth-first search is performed on G instead of on GT. Assume the finishing-time stack is still used by the second df: Sweep A graph of 5-6 vertices shoud be sufficient to make this counter-example. Show transcribed image text Give an example of a directed graph for which the SCC algorithm gives the wrong SCCs if the second depth-first search is performed on G instead of on GT. Assume the finishing-time stack is still used by the second df: Sweep A graph of 5-6 vertices shoud be sufficient to make this counter-example.

Expert Answer

---

Answer to Give an example of a directed graph for which the SCC algorithm gives the wrong SCCs if the second depth-first search is… . . .