Javascript implementation to find the minimum labelled node to be removed such that there is no cycle in the undirected graph
var MAX = 100005 ; var totBackEdges ; var countAdj = Array ( MAX ) . fill ( 0 ) ; var small = Array ( MAX ) . fill ( 0 ) ;