Minimum Degree of a Connected Trio in a Graph LeetCode solution in Python

1
class Solution:
2
    def minTrioDegree(self, n: int, edges: List[List[int]]) -> int:
3
        graph = [[False] * n for _ in range(n)]
4
        degree = [0] * n
5

6
        for u, v in edges:
7
            graph[u - 1][v - 1] = graph[v - 1][u - 1] = True
8
            degree[u - 1] += 1
9
            degree[v - 1] += 1
10

11
        ans = inf
12
        for i in range(n):
13
            for j in range(i + 1, n):
14
                if graph[i][j]:
15
                    for k in range(j + 1, n):
16
                        if graph[j][k] and graph[k][i]:
17
                            ans = min(ans, degree[i] + degree[j] + degree[k] - 6)
18
        return ans if ans < inf else -1