Data Structure (DS) MCQ: A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

Correct Answer: strongly connected

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure (DS) MCQs All Engineering topics Mock test hub

WhatsApp+91 99922 70404Data Structure (DS) MCQ: A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. | Extra Education