Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.

• Directly connected
• Widely connected
• Literally connected
• Unliterally connected Correct