Given an undirected graph, task is to find the minimum number of weakly connected nodes after converting this graph into directed one.
Weakly Connected Nodes : Nodes which are having 0 indegree(number of incoming edges).
Prerequisite : BFS traversal
Input : 4 4 0 1 1 2 2 3 3 0 Output : 0 disconnected components Input : 6 5 1 2 2 3 4 5 4 6 5 6 Output : 1 disconnected components
Approach : We find a node which helps in traversing maximum nodes in a single walk. To cover all possible paths, DFS graph traversal technique is used for this.
Do the above steps to traverse the graph. Now, iterate through graph again and check which nodes are having 0 indegree.
2 weakly connected nodes
- Maximum number of edges among all connected components of an undirected graph
- Print levels with odd number of nodes and even number of nodes
- Strongly Connected Components
- Number of Unicolored Paths between two nodes
- Number of sink nodes in a graph
- Count the number of non-reachable nodes
- Calculate number of nodes in all subtrees | Using DFS
- Largest connected component on a grid
- Connected Components in an undirected graph
- Level with maximum number of nodes using DFS in a N-ary tree
- Count the number of nodes at given level in a tree using BFS.
- Check if a graph is strongly connected | Set 1 (Kosaraju using DFS)
- All vertex pairs connected with exactly k edges in a graph
- Cycles of length n in an undirected and connected graph
- Maximize number of nodes which are not part of any edge in a Graph
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.