Given a Directed Graph and two vertices in it, check whether there is a path from the first given vertex to second.

**Example:**

Consider the following Graph:Input :(u, v) = (1, 3)Output:YesExplanation:There is a path from 1 to 3, 1 -> 2 -> 3Input :(u, v) = (3, 6)Output:NoExplanation:There is no path from 3 to 6

**Approach:** Either Breadth First Search (BFS) or Depth First Search (DFS) can be used to find path between two vertices. Take the first vertex as source in BFS (or DFS), follow the standard BFS (or DFS). If the second vertex is found in our traversal, then return true else return false.

**Algorithm:**

- The implementation below is using BFS.
- Create a queue and a visited array initially filled with 0, of size V where V is number of vertices.
- Insert the starting node in the queue, i.e. push u in the queue and mark u as visited.
- Run a loop until the queue is not empty.
- Dequeue the front element of the queue. Iterate all its adjacent elements. If any of the adjacent element is the destination return true. Push all the adjacent and unvisted vertices in the queue and mark them as visited.
- Return false as the destination is not reached in BFS.

**Implementation:** C++, Java and Python codes that use BFS for finding reachability of the second vertex from the first vertex.

## C++

`// C++ program to check if there is exist a path between two vertices ` `// of a graph. ` `#include<iostream> ` `#include <list> ` `using` `namespace` `std; ` ` ` `// This class represents a directed graph using adjacency list ` `// representation ` `class` `Graph ` `{ ` ` ` `int` `V; ` `// No. of vertices ` ` ` `list<` `int` `> *adj; ` `// Pointer to an array containing adjacency lists ` `public` `: ` ` ` `Graph(` `int` `V); ` `// Constructor ` ` ` `void` `addEdge(` `int` `v, ` `int` `w); ` `// function to add an edge to graph ` ` ` `bool` `isReachable(` `int` `s, ` `int` `d); ` `}; ` ` ` `Graph::Graph(` `int` `V) ` `{ ` ` ` `this` `->V = V; ` ` ` `adj = ` `new` `list<` `int` `>[V]; ` `} ` ` ` `void` `Graph::addEdge(` `int` `v, ` `int` `w) ` `{ ` ` ` `adj[v].push_back(w); ` `// Add w to v’s list. ` `} ` ` ` `// A BFS based function to check whether d is reachable from s. ` `bool` `Graph::isReachable(` `int` `s, ` `int` `d) ` `{ ` ` ` `// Base case ` ` ` `if` `(s == d) ` ` ` `return` `true` `; ` ` ` ` ` `// Mark all the vertices as not visited ` ` ` `bool` `*visited = ` `new` `bool` `[V]; ` ` ` `for` `(` `int` `i = 0; i < V; i++) ` ` ` `visited[i] = ` `false` `; ` ` ` ` ` `// Create a queue for BFS ` ` ` `list<` `int` `> queue; ` ` ` ` ` `// Mark the current node as visited and enqueue it ` ` ` `visited[s] = ` `true` `; ` ` ` `queue.push_back(s); ` ` ` ` ` `// it will be used to get all adjacent vertices of a vertex ` ` ` `list<` `int` `>::iterator i; ` ` ` ` ` `while` `(!queue.empty()) ` ` ` `{ ` ` ` `// Dequeue a vertex from queue and print it ` ` ` `s = queue.front(); ` ` ` `queue.pop_front(); ` ` ` ` ` `// Get all adjacent vertices of the dequeued vertex s ` ` ` `// If a adjacent has not been visited, then mark it visited ` ` ` `// and enqueue it ` ` ` `for` `(i = adj[s].begin(); i != adj[s].end(); ++i) ` ` ` `{ ` ` ` `// If this adjacent node is the destination node, then ` ` ` `// return true ` ` ` `if` `(*i == d) ` ` ` `return` `true` `; ` ` ` ` ` `// Else, continue to do BFS ` ` ` `if` `(!visited[*i]) ` ` ` `{ ` ` ` `visited[*i] = ` `true` `; ` ` ` `queue.push_back(*i); ` ` ` `} ` ` ` `} ` ` ` `} ` ` ` ` ` `// If BFS is complete without visiting d ` ` ` `return` `false` `; ` `} ` ` ` `// Driver program to test methods of graph class ` `int` `main() ` `{ ` ` ` `// Create a graph given in the above diagram ` ` ` `Graph g(4); ` ` ` `g.addEdge(0, 1); ` ` ` `g.addEdge(0, 2); ` ` ` `g.addEdge(1, 2); ` ` ` `g.addEdge(2, 0); ` ` ` `g.addEdge(2, 3); ` ` ` `g.addEdge(3, 3); ` ` ` ` ` `int` `u = 1, v = 3; ` ` ` `if` `(g.isReachable(u, v)) ` ` ` `cout<< ` `"\n There is a path from "` `<< u << ` `" to "` `<< v; ` ` ` `else` ` ` `cout<< ` `"\n There is no path from "` `<< u << ` `" to "` `<< v; ` ` ` ` ` `u = 3, v = 1; ` ` ` `if` `(g.isReachable(u, v)) ` ` ` `cout<< ` `"\n There is a path from "` `<< u << ` `" to "` `<< v; ` ` ` `else` ` ` `cout<< ` `"\n There is no path from "` `<< u << ` `" to "` `<< v; ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to check if there is exist a path between two vertices ` `// of a graph. ` `import` `java.io.*; ` `import` `java.util.*; ` `import` `java.util.LinkedList; ` ` ` `// This class represents a directed graph using adjacency list ` `// representation ` `class` `Graph ` `{ ` ` ` `private` `int` `V; ` `// No. of vertices ` ` ` `private` `LinkedList<Integer> adj[]; ` `//Adjacency List ` ` ` ` ` `//Constructor ` ` ` `Graph(` `int` `v) ` ` ` `{ ` ` ` `V = v; ` ` ` `adj = ` `new` `LinkedList[v]; ` ` ` `for` `(` `int` `i=` `0` `; i<v; ++i) ` ` ` `adj[i] = ` `new` `LinkedList(); ` ` ` `} ` ` ` ` ` `//Function to add an edge into the graph ` ` ` `void` `addEdge(` `int` `v,` `int` `w) { adj[v].add(w); } ` ` ` ` ` `//prints BFS traversal from a given source s ` ` ` `Boolean isReachable(` `int` `s, ` `int` `d) ` ` ` `{ ` ` ` `LinkedList<Integer>temp; ` ` ` ` ` `// Mark all the vertices as not visited(By default set ` ` ` `// as false) ` ` ` `boolean` `visited[] = ` `new` `boolean` `[V]; ` ` ` ` ` `// Create a queue for BFS ` ` ` `LinkedList<Integer> queue = ` `new` `LinkedList<Integer>(); ` ` ` ` ` `// Mark the current node as visited and enqueue it ` ` ` `visited[s]=` `true` `; ` ` ` `queue.add(s); ` ` ` ` ` `// 'i' will be used to get all adjacent vertices of a vertex ` ` ` `Iterator<Integer> i; ` ` ` `while` `(queue.size()!=` `0` `) ` ` ` `{ ` ` ` `// Dequeue a vertex from queue and print it ` ` ` `s = queue.poll(); ` ` ` ` ` `int` `n; ` ` ` `i = adj[s].listIterator(); ` ` ` ` ` `// Get all adjacent vertices of the dequeued vertex s ` ` ` `// If a adjacent has not been visited, then mark it ` ` ` `// visited and enqueue it ` ` ` `while` `(i.hasNext()) ` ` ` `{ ` ` ` `n = i.next(); ` ` ` ` ` `// If this adjacent node is the destination node, ` ` ` `// then return true ` ` ` `if` `(n==d) ` ` ` `return` `true` `; ` ` ` ` ` `// Else, continue to do BFS ` ` ` `if` `(!visited[n]) ` ` ` `{ ` ` ` `visited[n] = ` `true` `; ` ` ` `queue.add(n); ` ` ` `} ` ` ` `} ` ` ` `} ` ` ` ` ` `// If BFS is complete without visited d ` ` ` `return` `false` `; ` ` ` `} ` ` ` ` ` `// Driver method ` ` ` `public` `static` `void` `main(String args[]) ` ` ` `{ ` ` ` `// Create a graph given in the above diagram ` ` ` `Graph g = ` `new` `Graph(` `4` `); ` ` ` `g.addEdge(` `0` `, ` `1` `); ` ` ` `g.addEdge(` `0` `, ` `2` `); ` ` ` `g.addEdge(` `1` `, ` `2` `); ` ` ` `g.addEdge(` `2` `, ` `0` `); ` ` ` `g.addEdge(` `2` `, ` `3` `); ` ` ` `g.addEdge(` `3` `, ` `3` `); ` ` ` ` ` `int` `u = ` `1` `; ` ` ` `int` `v = ` `3` `; ` ` ` `if` `(g.isReachable(u, v)) ` ` ` `System.out.println(` `"There is a path from "` `+ u +` `" to "` `+ v); ` ` ` `else` ` ` `System.out.println(` `"There is no path from "` `+ u +` `" to "` `+ v);; ` ` ` ` ` `u = ` `3` `; ` ` ` `v = ` `1` `; ` ` ` `if` `(g.isReachable(u, v)) ` ` ` `System.out.println(` `"There is a path from "` `+ u +` `" to "` `+ v); ` ` ` `else` ` ` `System.out.println(` `"There is no path from "` `+ u +` `" to "` `+ v);; ` ` ` `} ` `} ` `// This code is contributed by Aakash Hasija ` |

*chevron_right*

*filter_none*

## Python

`# program to check if there is exist a path between two vertices ` `# of a graph ` ` ` `from` `collections ` `import` `defaultdict ` ` ` `#This class represents a directed graph using adjacency list representation ` `class` `Graph: ` ` ` ` ` `def` `__init__(` `self` `,vertices): ` ` ` `self` `.V` `=` `vertices ` `#No. of vertices ` ` ` `self` `.graph ` `=` `defaultdict(` `list` `) ` `# default dictionary to store graph ` ` ` ` ` `# function to add an edge to graph ` ` ` `def` `addEdge(` `self` `,u,v): ` ` ` `self` `.graph[u].append(v) ` ` ` ` ` `# Use BFS to check path between s and d ` ` ` `def` `isReachable(` `self` `, s, d): ` ` ` `# Mark all the vertices as not visited ` ` ` `visited ` `=` `[` `False` `]` `*` `(` `self` `.V) ` ` ` ` ` `# Create a queue for BFS ` ` ` `queue` `=` `[] ` ` ` ` ` `# Mark the source node as visited and enqueue it ` ` ` `queue.append(s) ` ` ` `visited[s] ` `=` `True` ` ` ` ` `while` `queue: ` ` ` ` ` `#Dequeue a vertex from queue ` ` ` `n ` `=` `queue.pop(` `0` `) ` ` ` ` ` `# If this adjacent node is the destination node, ` ` ` `# then return true ` ` ` `if` `n ` `=` `=` `d: ` ` ` `return` `True` ` ` ` ` `# Else, continue to do BFS ` ` ` `for` `i ` `in` `self` `.graph[n]: ` ` ` `if` `visited[i] ` `=` `=` `False` `: ` ` ` `queue.append(i) ` ` ` `visited[i] ` `=` `True` ` ` `# If BFS is complete without visited d ` ` ` `return` `False` ` ` `# Create a graph given in the above diagram ` `g ` `=` `Graph(` `4` `) ` `g.addEdge(` `0` `, ` `1` `) ` `g.addEdge(` `0` `, ` `2` `) ` `g.addEdge(` `1` `, ` `2` `) ` `g.addEdge(` `2` `, ` `0` `) ` `g.addEdge(` `2` `, ` `3` `) ` `g.addEdge(` `3` `, ` `3` `) ` ` ` `u ` `=` `1` `; v ` `=` `3` ` ` `if` `g.isReachable(u, v): ` ` ` `print` `(` `"There is a path from %d to %d"` `%` `(u,v)) ` `else` `: ` ` ` `print` `(` `"There is no path from %d to %d"` `%` `(u,v)) ` ` ` `u ` `=` `3` `; v ` `=` `1` `if` `g.isReachable(u, v) : ` ` ` `print` `(` `"There is a path from %d to %d"` `%` `(u,v)) ` `else` `: ` ` ` `print` `(` `"There is no path from %d to %d"` `%` `(u,v)) ` ` ` `#This code is contributed by Neelam Yadav ` |

*chevron_right*

*filter_none*

**Output:**

There is a path from 1 to 3 There is no path from 3 to 1

**Complexity Analysis:**

**Time Complexity:**O(V+E) where V is number of vertices in the graph and E is number of edges in the graph.**Space Compelxity:**O(V).

There can be atmost V elements in the queue. So the space needed is O(V).

**Trade-offs between BFS and DFS:** Breadth-First search can be useful to find the shortest path between nodes, and depth-first search may traverse one adjacent node very deeply before ever going into immediate neighbours.

*As an exercise, try an extended version of the problem where the complete path between two vertices is also needed.*

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Find if there is a path between two vertices in a directed graph | Set 2
- Find if there is a path between two vertices in an undirected graph
- Convert the undirected graph into directed graph such that there is no path of length greater than 1
- Longest Path in a Directed Acyclic Graph
- Shortest Path in Directed Acyclic Graph
- Longest Path in a Directed Acyclic Graph | Set 2
- Path with minimum XOR sum of edges in a directed graph
- Shortest path with exactly k edges in a directed and weighted graph | Set 2
- Shortest path in a directed graph by Dijkstra’s algorithm
- Shortest path with exactly k edges in a directed and weighted graph
- Find K vertices in the graph which are connected to at least one of remaining vertices
- Longest path in a directed Acyclic graph | Dynamic Programming
- Minimum Cost Path in a directed graph via given set of intermediate nodes
- Minimum Cost of Simple Path between two nodes in a Directed and Weighted Graph
- Find dependencies of each Vertex in a Directed Graph
- Maximize the number of uncolored vertices appearing along the path from root vertex and the colored vertices
- Find the number of paths of length K in a directed graph
- Find two disjoint good sets of vertices in a given graph
- Convert undirected connected graph to strongly connected directed graph
- Clone a Directed Acyclic Graph