A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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:Strongly Connected
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: