Connectivity Definition A directed graph is connected, if there is a path from any vertices to another. a strong connected component is a maximal connected subgraph #trees ==#connected components W 2/32021Connectivity ? #trees == #connected components 2/3/2021 Xiaojuan Cai 43 u w x y z