You are given n nodes labelled 0 … n-1 and a list of undirected edges . Return the number of connected components in the graph. Input format Input is [n, edges] , e.g. [5,[[0,1],[1,2],[3,4]]] .