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
View all MCQs in:   Data Structure (DS)


Help us improve!

We want to make our service better for you. Please take a moment to fill out our survey.

Take Survey