If count is equal to the maximum then choose the node with minimum value
else if ( maximum == a ) ans = Math . min ( ans , node ) ; for ( let i = 0 ; i < graph [ node ] . length ; i ++ ) { if ( graph [ node ] [ i ] == parent ) continue ; dfs ( graph [ node ] [ i ] , node ) ; } }