Shortest Cycle in a Graph

Understand how to identify the shortest cycle in a bidirectional graph by analyzing connections between vertices. Explore graph traversal techniques and implement a solution that returns the minimal cycle length or -1 if none exists.