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

• A. Weakly connected
• B. Strongly Connected
• C. Tightly Connected
• D. Linearly Connected