Connectivity Definition An undirected graph is connected, if there is a path between any pair of vertices A connected component is a subgraph that is internally connected but has no edges to the remaining vertices #trees ==#connected components 2/32021 Xiaojuan Cai 28Connectivity #trees == #connected components 2/3/2021 Xiaojuan Cai 28