Solution: Shortest Cycle in a Graph

Explore how to find the shortest cycle in an undirected graph using breadth-first search (BFS). Understand how BFS helps detect cycles early by tracking visited nodes and distances. This lesson guides you through implementing BFS to identify the smallest cycle or determine if none exists, enhancing your graph traversal and algorithm skills.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You are given a bidirectional graph with n vertices, labeled from 0 to n - 1. The graph is represented by a 2D integer array edges, where each element edges[i] = [u_i, v_i] represents an edge connecting vertex u_i and vertex v_i. Each vertex pair has at most one edge between them, and no vertex is connected to itself.

Your task is to find the length of the shortest cycle in the graph. A cycle is defined as a path that starts and ends at the same vertex, with each edge in the path appearing exactly once. If no cycle exists in the graph, return -1.

Constraints:

...