• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE CS 2021 | Set 2 | Question 56

Consider the following directed graph: Which of the following is/are correct about the graph?

(A)

The graph does not have a topological order

(B)

A depth-first traversal starting at vertex S classifies three directed edges as back edges

(C)

The graph does not have a strongly connected component

(D)

For each pair of vertices u and v, there is a directed path from u to v

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments