Consider the following statements about strongly connected components (SCC):
- The
graph G', a component of a graph G, is obtained by contracting the
strongly connected components of G. We can say that the graph G' is
necessarily acyclic.
- The strongly connected components of a graph G and its transpose G' are the same.
- It
is possible to use the DFS algorithm to find the strongly connected
components of a graph. More specifically, two DFS executions must be
performed, and the first one is used to find the order of seeds for the
second execution.
The true statements are:
- I, II and III
- II and III
- II
- III
- None of the above.
Original idea by: André Nóbrega
No comments:
Post a Comment