title: Detecting cycles using BFS
body: <p>I know that this is a common question. But in many places I have read that cycle detection using BFS is not possible for directed graphs. One example is this link <a href="https://stackoverflow.com/questions/2869647/why-dfs-and-not-bfs-for-finding-cycle-in-graphs">Why DFS and not BFS for finding cycle in graphs</a></p>
  
  <p>I think that we can implement topological sort using BFS for a directed graph. If a topological order exists, then we can say graph is acyclic else it is cyclic. Is it not possible?</p>