7.75 Definition. The graph G = (V, E) is connected if o(V) = 1 or if every
pair of distinct vertices of G is joined by a path in G. A (connected) component
of G is an induced subgraph H = G[W] such that H is connected, but G[X] is
not connected for any subset X of V that strictly contains W.