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

1. weakly connected

2. strongly connected

3. tightly connected