What happens if Tarjan's DFS-based reverse topological sort is performed on a directed graph that has a cycle? Will it detect a cycle? The answer will depend on the specifics of the DFS. Use pure reason - as opposed to a search through the text to figure out at least two different answers to this question. What happens if a BFS-based topological sort is run on a directed graph that contains a cycle.