r = isStronglyConnected D
A digraph is said to be strongly connected if for each vertex u of D, any other vertex of D is reachable from u. An equivalent definition is that D is strongly connected if the distance matrix of D has only positive terms in the nondiagonal entries.




The object isStronglyConnected is a method function.