A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
Answer: B . Strongly Connected
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….