Reverse Delete Algorithm For Minimum Spanning Tree
Reverse Delete Algorithm For Minimum Spanning Tree
Reverse Delete Algorithm For Minimum Spanning Tree
In Reverse Delete algorithm, we sort all edges in decreasing order of their weights. After sorting, we
one by one pick edges in decreasing order. We include current picked edge if excluding current
edge causes disconnection in current graph. The main idea is delete edge if its deletion does not
lead to disconnection of graph.
The Algorithm
Illustration:
Let us understand with the following example:
https://www.geeksforgeeks.org/reverse-delete-algorithm-minimum-spanning-tree/ 1/3
6/22/2019 Reverse Delete Algorithm for Minimum Spanning Tree - GeeksforGeeks
If we delete highest weight edge of weight 14, graph doesn’t become disconnected, so we remove it.
Edges in MST
(3, 4)
(0, 7)
(2, 3)
(2, 5)
(0, 1)
(5, 6)
https://www.geeksforgeeks.org/reverse-delete-algorithm-minimum-spanning-tree/ 2/3
6/22/2019 Reverse Delete Algorithm for Minimum Spanning Tree - GeeksforGeeks
(2, 8)
(6, 7)
Note : In case of same weight edges, we can pick any edge of the same weight edges.
https://www.geeksforgeeks.org/reverse-delete-algorithm-minimum-spanning-tree/ 3/3