Is there a way to split graph into subgraphs which are not connected with each other?
For example, the graph with vertices A,B,C,D,E and edges A-B ,C-D, D-E(please note lack of B-C edge) could be divided into two "isolated" graphs:
(A-B)
(C-D-E)