Leetcode 2608. Shortest Cycle in a Graph

Find the graph's girth: given an undirected simple graph, return the length (number of edges) of the shortest cycle or -1 if none exists. With n,m ≤ 1000, this is typically solved by repeated BFS/shortest-path searches on the unweighted graph to detect the minimal closed loop.