edited by
3,962 views

1 Answer

Best answer
13 votes
13 votes

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.

selected by
Answer:

Related questions

76 votes
76 votes
12 answers
1
Kathleen asked Oct 4, 2014
34,464 views
The number of distinct simple graphs with up to three nodes is$15$$10$$7$$9$
39 votes
39 votes
8 answers
2
Kathleen asked Sep 15, 2014
17,683 views
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
2 votes
2 votes
2 answers
3
go_editor asked Jun 13, 2016
4,279 views
In C, what is the effect of a negative number in a field width specifier?the values are displayed right justifiedthe values are displayed centeredthe values are displayed...
7 votes
7 votes
4 answers
4
go_editor asked Jun 13, 2016
3,225 views
Repeated execution of simple computation may cause compounding ofround-off errorssyntax errorsrun-time errorslogic errors