Graph – Find Number of non reachable vertices from a given vertex

Objective: Given undirected graph write an algorithm to count the number of non reachable vertices from a given vertex

Example:

Approach:

Use DFS

1. Do the DFS (Depth-First Search) from the given vertex A, Recursively do the DFS from all the adjacent vertices of given vertex A.
2. Use the visited array to keep track of visited vertices.
3. Once the DFS is completed, count the number of false in visited array. These are the vertices which did not get visit.

Run This Code

Code:

Output:

Number of non-reachable vertices from the vertex 0 are: 4
Number of non reachable vertices from the vertex 6 are: 5

Also Read:

- Implement Graph Using Map - Java Medium
- Graph – Detect Cycle in an Undirected Graph using DFS Medium
- Graph – Count all paths between source and destination Medium
- Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Hard
- Number of Islands Medium
- Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation Hard
- Disjoint Set Data Structure - Union Find Algorithm Hard
- Print All Paths in Dijkstra's Shortest Path Algorithm Hard