Solution: Check If a Path Exists between Two Vertices

Statement

Given a 2D list, edges, representing a bidirectional graph of n nodes, where each vertex is labeled from $0$ to $n-1$. Each edge in the graph is represented as a pair, $[x_i, y_i]$, showing a bidirectional edge between $x_i$ and $y_i$ ...