, source, and destination, return true if there is a valid path from source to destination, or false otherwise_._

Examples

Example 1:

graph LR;
	0 --> 1 --> 2 --> 0

Input: n = 3, edges =[[0,1],[1,2],[2,0]], source = 0, destination = 2
Output: true
Explanation: There is one path from vertex 0 to vertex 2:
- 0 → 1 → 2

Example 2:

graph LR;
	2 <-- 0 --> 1
	3 --> 5 --> 4 --> 3

Input: n = 6, edges =[[0,1],[0,2],[3,5],[5,4],[4,3]], source = 0, destination = 5
Output: false
Explanation: There is no path from vertex 0 to vertex 5.

Similar Problem

This problem is similar to Find if Path Exists in Graph, just that there the graph is bi-directional, and here it is directed or uni-directional.

Solutions

Method 1 - BFS

BFS can be used to check if one node is reachable from other :

Add V1 to a queue of nodes to be visited
While there are

Related Tags