Taking into consideration the directed graph below, in the context of Strongly Connected Components (SSCs), choose the most appropriate alternative:
a) This graph has an even number of SCCs and not all the components' numbers of nodes are prime numbers.
b) The largest SCC (with the greatest number of nodes) is precisely the first SCC found by Kosaraju-Sharir's algorithm.
c) More than half of the SCCs in the graph have 3 nodes.
d) This graph has 5 SCCs, the smallest of which is formed by 'k' alone.
e) None of the above.
Original idea by: João Marcos
No comments:
Post a Comment