New update is available. Click here to update.

Minimum Degree

Posted: 3 Apr, 2021
Difficulty: Moderate

PROBLEM STATEMENT

Try Problem

You have an undirected graph with N nodes and M edges. The degree of the connected trio in the graph is the number of edges connected to the nodes of the trio where one node belongs to the node in the trio, while the other node doesn’t belong to the trio. Your task is to print the minimum degree of the connected trio.

Note:

A connected trio means a set of three nodes, where all three are interconnected.
Input Format:
The first line of the input contains ‘T’ denoting the number of test cases.

The first line of each test case contains ‘N’ and ‘M’ denoting the number of nodes and number of edges.

Each of the next M lines contains two space-separated integers u and v, denoting node u and node v are connected by an edge.
Output Format:
For each test case, return an integer denoting the minimum degree of the connected trio.
Print the output for each test case in a separate line.

Note:

You don't need to print anything, it has already been taken care of. Just implement the given function.
Constraints:
1 <= T <= 3
2 <= N <= 100
0 <= M <= min(500, N*(N-1)/2)
0 <= u[i], v[i] <= N-1

where, ‘N’ and ‘M’ denoting the number of nodes and number of edges and u[i], v[i] are nodes to be connected by an edge.

Time Limit: 1 sec.