# Maximum edge removal from tree to make even forest

Given an undirected tree which has even number of vertices, we need to remove the maximum number of edges from this tree such that each connected component of the resultant forest has an even number of vertices.

Examples:

In above shown tree, we can remove at max 2 edges 0-2 and 0-4 shown in red such that each connected component will have even number of vertices.

As we need connected components that have even number of vertices so when we get one component we can remove the edge that connects it to the remaining tree and we will be left with a tree with even number of vertices which will be the same problem but of smaller size, we have to repeat this algorithm until the remaining tree cannot be decomposed further in the above manner.

We will traverse the tree using DFS which will return the number of vertices in the component of which the current node is the root. If a node gets an even number of vertices from one of its children then the edge from that node to its child will be removed and result will be increased by one and if the returned number is odd then we will add it to the number of vertices that the component will have if the current node is the root of it.

1) Do DFS from any starting node as tree is connected. 2) Initialize count of nodes in subtree rooted under current node as 0. 3) Do following recursively for every subtree of current node. a) If size of current subtree is even, increment result by 1 as we can disconnect the subtree. b) Else add count of nodes in current subtree to current count.

Please see below code for better understanding,

`/* Program to get maximum number of edges which ` ` ` `can be removed such that each connected component ` ` ` `of this tree will have an even number of vertices */` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Utility method to do DFS of the graph and count edge ` `// deletion for even forest ` `int` `dfs(vector<` `int` `> g[], ` `int` `u, ` `bool` `visit[], ` `int` `& res) ` `{ ` ` ` `visit[u] = ` `true` `; ` ` ` `int` `currComponentNode = 0; ` ` ` ` ` `// iterate over all neighbor of node u ` ` ` `for` `(` `int` `i = 0; i < g[u].size(); i++) ` ` ` `{ ` ` ` `int` `v = g[u][i]; ` ` ` `if` `(!visit[v]) ` ` ` `{ ` ` ` `// Count the number of nodes in a subtree ` ` ` `int` `subtreeNodeCount = dfs(g, v, visit, res); ` ` ` ` ` `// if returned node count is even, disconnect ` ` ` `// the subtree and increase result by one. ` ` ` `if` `(subtreeNodeCount % 2 == 0) ` ` ` `res++; ` ` ` ` ` `// else add subtree nodes in current component ` ` ` `else` ` ` `currComponentNode += subtreeNodeCount; ` ` ` `} ` ` ` `} ` ` ` ` ` `// number of nodes in current component and one for ` ` ` `// current node ` ` ` `return` `(currComponentNode + 1); ` `} ` ` ` `/* method returns max edge that we can remove, after which ` ` ` `each connected component will have even number of ` ` ` `vertices */` `int` `maxEdgeRemovalToMakeForestEven(vector<` `int` `> g[], ` `int` `N) ` `{ ` ` ` `// Create a visited array for DFS and make all nodes ` ` ` `// unvisited in starting ` ` ` `bool` `visit[N + 1]; ` ` ` `for` `(` `int` `i = 0; i <= N; i++) ` ` ` `visit[i] = ` `false` `; ` ` ` ` ` `int` `res = 0; ` `// Passed as reference ` ` ` ` ` `// calling the dfs from node-0 ` ` ` `dfs(g, 0, visit, res); ` ` ` ` ` `return` `res; ` `} ` ` ` `// Utility function to add an undirected edge (u,v) ` `void` `addEdge(vector<` `int` `> g[], ` `int` `u, ` `int` `v) ` `{ ` ` ` `g[u].push_back(v); ` ` ` `g[v].push_back(u); ` `} ` ` ` `// Driver code to test above methods ` `int` `main() ` `{ ` ` ` `int` `edges[][2] = {{0, 2}, {0, 1}, {0, 4}, ` ` ` `{2, 3}, {4, 5}, {5, 6}, ` ` ` `{5, 7}}; ` ` ` `int` `N = ` `sizeof` `(edges)/` `sizeof` `(edges[0]); ` ` ` `vector<` `int` `> g[N + 1]; ` ` ` `for` `(` `int` `i = 0; i < N; i++) ` ` ` `addEdge(g, edges[i][0], edges[i][1]); ` ` ` ` ` `cout << maxEdgeRemovalToMakeForestEven(g, N); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

2

Time Complexity : O(n) where n is number of nodes in tree.

This article is contributed by **Utkarsh Trivedi**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

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

## Recommended Posts:

- Maximum Possible Edge Disjoint Spanning Tree From a Complete Graph
- Convert a tree to forest of even nodes
- Minimum edge reversals to make a root
- Tree, Back, Edge and Cross Edges in DFS of Graph
- Check if removing an edge can divide a Binary Tree in two halves
- Count number of trees in a forest
- Minimum Operations to make value of all vertices of the tree Zero
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Make a tree with n vertices , d diameter and at most vertex degree k
- Maximum spiral sum in Binary Tree
- Node having maximum sum of immediate children and itself in n-ary tree
- Maximum Path Sum in a Binary Tree
- Maximum width of a binary tree
- Maximum sum from a tree with adjacent levels not allowed
- Sum of nodes at maximum depth of a Binary Tree | Set 2