Discussion Forum

  1. Home
  2. »
  3. Computer Science Mcqs
  4. »
  5. Data Structures Mcqs
  6. »
  7. Graphs Mcqs
  8. »
  9. A directed graph is ………………....
A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

Weakly connected

Strongly Connected

Tightly Connected

Linearly Connected

Answer: B . Strongly Connected
0Shares
0 0

If you think the posted answer is wrong or Confused About the Answer? Ask for Details Here

Know Explanation? Add it Here
we’ll review your comment and contact you soon….

Leave a Reply

Your email address will not be published. Required fields are marked *

0Shares
0
Scroll to Top