Question

find the number of simple paths that contain an edge and only contain at most one edge which belongs to a cycle.

Answer 1

"The structure of the chart can easily be described by the simple graph and total of N vertices will be numbered as 1 through N and M edges 1 numbered through M.

each vertex of the graph is a part of the most one simple cycle. You can take some input with a single integer that will denote the test case. The first line of every test case will have N and M integers.

Then M will be followed up with each valid i. The i-th lines contain u and v integers that will be connected by i edge.

For each ii (1≤i≤M1≤i≤M), the i-th of these lines should contain a single integer — the number of paths for edge i.

"