Find if Path Exists in Graph

Easy

There is a bi-directional graph with n vertices labeled 0..n-1, described by the list of undirected edges. Return true if there is a valid path from vertex 0 to vertex n-1, and false otherwise.

Example 1

Input:  n = 3, edges = [[0,1],[1,2],[2,0]]
Output: true

Example 2

Input:  n = 6, edges = [[0,1],[0,2],[3,5],[5,4],[4,3]]
Output: false

Constraints

• 1 <= n <= 2*10^5
• 0 <= edges.length <= 2*10^5