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
