Re: Reverse-delete algorithm

Posted 11 November 2008 - 08:10 AM

Reverse-delete algorithm is used to get minimum spanning tree of a graph.
Reverse-delete algorithm algorithm is a greedy algorithm, choosing the best at a given point not putting future in mind. It is the reverse of Kruskal's algorithm (another greedy algorithm to find a minimum spanning tree but it starts with an empty graph and adds edges) while the Reverse-Delete algorithm starts with the original graph and deletes edges from it.

Algorithm:
- Start with graph G, which contains edges E.
- Get high E weight and check if deleting it will disconnect the graph then delete if not.