1. Engineering
  2. Computer Science
  3. a strongly connected component of a graph is inescapable if...

Question: a strongly connected component of a graph is inescapable if...

Question details

A strongly connected component of a graph is inescapable if there are no edges from it to any other
component.
Prove that the first component found by Tarjan's algorithm is inescapable.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution