Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Find if Path Exists in Graph

Given an undirected graph with n vertices (0..n-1) and a list of edges, print true if there is a path from source to destination, otherwise false.

Constraints

1 <= n <= 2 * 10^5 0 <= m <= 2 * 10^5

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.