C # implementation to find the minimum labelled node to be removed such that there is no cycle in the undirected graph
using System ; using System . Collections ; using System . Collections . Generic ; class GFG { static int MAX = 100005 ; static int totBackEdges ; static int [ ] countAdj = new int [ MAX ] ; static int [ ] small = new int [ MAX ] ;