You are given an undirected diagram comprising of n vertices and n edges. It is ensured that the given chart is associated (I. e. it is feasible to arrive at any vertex from some other vertex) and there are no self-circles and various edges in the chart. Your assignment is to work out the number of straightforward ways of length somewhere around 1 in the given diagram. Note that ways that vary exclusively by their
Correct answer will be upvoted else Multiple Downvoted. Computer science.
You are given an undirected diagram comprising of n vertices and n edges. It is ensured that the given chart is associated (I. e. it is feasible to arrive at any vertex from some other vertex) and there are no self-circles and various edges in the chart.
Your assignment is to work out the number of straightforward ways of length somewhere around 1 in the given diagram. Note that ways that vary exclusively by their course are viewed as something very similar (I. e. you need to compute the number of undirected ways). For instance, ways [1,2,3] and [3,2,1] are viewed as something very similar.
You need to answer t free experiments.
Review that a way in the diagram is a grouping of vertices v1,v2,… ,vk with the end goal that each pair of contiguous (sequential) vertices in this succession is associated by an edge. The length of the way is the number of edges in it. A basic way is such a way that all vertices in it are unmistakable.
Input
The principal line of the input contains one integer t (1≤t≤2⋅104) — the number of experiments. Then, at that point, t experiments follow.
The main line of the experiment contains one integer n (3≤n≤2⋅105) — the number of vertices (and the number of edges) in the chart.
The following n lines of the experiment depict edges: edge I is given as a couple of vertices ui, vi (1≤ui,vi≤n, ui≠vi), where ui and vi are vertices the I-th edge associates. For each pair of vertices (u,v), there is all things considered one edge among u and v. There are no edges from the vertex to itself. In this way, there are no self-circles and various edges in the chart. The chart is undirected, I. e. every one of its edges are bidirectional. The diagram is associated, I. e. it is feasible to arrive at any vertex from some other vertex by moving along the edges of the diagram.
It is ensured that the amount of n doesn't surpass 2⋅105 (∑n≤2⋅105).
Output
For each experiment, print one integer: the number of straightforward ways of length something like 1 in the given diagram. Note that ways that vary exclusively by their course are viewed as something very similar
Step by step
Solved in 4 steps with 1 images
