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
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Maximum sum of values of nodes among all connected components of an undirected graph
- Kth largest node among all directly connected nodes to the given node in an undirected graph
- Number of connected components in a 2-D matrix of strings
- Convert undirected connected graph to strongly connected directed graph
- Number of ways to select a node from each connected component
- Check if the length of all connected components is a Fibonacci number
- Program to count Number of connected components in an undirected graph
- Maximum number of edges among all connected components of an undirected graph
- Print levels with odd number of nodes and even number of nodes
- Minimum number of Water to Land conversion to make two islands connected in a Grid
- Count the number of non-reachable nodes
- Count the nodes whose sum with X is a Fibonacci number
- Calculate number of nodes in all subtrees | Using DFS
- Number of Unicolored Paths between two nodes
- Number of sink nodes 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 firstname.lastname@example.org. 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.