Consider the graph shown in the figure below:
Which of the following is a valid strong component?
A directed graph is strongly connected if there is a path between all pairs of vertices.
So given graph has a b c as a strong component.
A digraph is unilaterally connected if for every pair of points there is a path from one to the other (but not necessarily the other way around).
The tests are there but it ain't free. Cost is...