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