Q. |
A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. |
A. | weakly connected |
B. | strongly connected |
C. | tightly connected |
D. | linearly connected |
Answer» B. strongly connected |
Login to Continue
It will take less than 2 minutes