Question discussion

A directed graph has the edges 1 → 2, 2 → 3, 3 → 1, 3 → 4, 4 → 5, 5 → 4 and 5 → 6. How many strongly connected components does the graph ha…

2523Medium DSSSB TGT Computer Science 0 replies

A directed graph has the edges 1 → 2, 2 → 3, 3 → 1, 3 → 4, 4 → 5, 5 → 4 and 5 → 6. How many strongly connected components does the graph have?

  • A3
  • B2
  • C4
  • D6
Correct answer: A

Explanation

The vertices {1, 2, 3} form one cycle, {4, 5} form another and vertex 6 has no way back, so it is a component by itself, which gives 3 components.

Discussion 0

Nobody has replied yet. Start the discussion!