# 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.