DFS,Strongly connected components

Edit Answers
123456789101112131415
Across
  1. 5. : DFS runs in this type of time complexity
  2. 6. : Data structure used in DFS to keep track of nodes
  3. 11. : When every vertex can reach every other vertex
  4. 13. : The time when a node is first found in DFS
  5. 15. : Graph formed by reversing all edges
Down
  1. 1. : A group of nodes that are strongly connected
  2. 2. : Algorithm that finds SCCs using lowlink values
  3. 3. : A node is marked as this once discovered
  4. 4. : Traverses a graph by going as deep as possible before backtracking
  5. 7. : Algorithm that finds SCCs using two DFS passes
  6. 8. : Type of graph formed by combining SCCs (Directed Acyclic Graph)
  7. 9. : Short form of Strongly Connected Component
  8. 10. : Tarjan’s value representing smallest discovery reachable
  9. 12. : Time complexity of DFS
  10. 14. : Edge type followed for the first time in DFS