When a graph said to be weakly connected?

aij = 1 if (vi, vj) Exists          =0 otherwise

When a directed graph is not strongly connected but the underlying graph is connected, then the graph is said to be weakly connected.