Solution: Shortest Cycle in a Graph

Explore how to find the shortest cycle in a bidirectional graph by applying Breadth-First Search (BFS). Learn to construct adjacency lists, track visited nodes, detect cycles, and calculate their minimum length efficiently using C#. This lesson helps you implement a graph algorithm critical for coding interview success.

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:

...