Given a connected undirected graph with 1 <= n <= 100 nodes and n-1 <= m <= 100 edges, you need to tell the sum of sizes of all cycles in it. The best I could think of was bitmasks, but it doesn't work for n upto 100. Can someone please help me with this ?
↧