I don't get this (Reverse-delete algorithm). Can someone give me an example, please.

# Reverse-delete algorithm

Page 1 of 1## 2 Replies - 5810 Views - Last Post: 11 November 2008 - 08:10 AM

##
**Replies To:** Reverse-delete algorithm

### #2

## Re: Reverse-delete algorithm

Posted 09 November 2008 - 06:50 PM

I guess we will need more details to help you

A lot of algorithms may desserve that title and

[rules][/rules]

A lot of algorithms may desserve that title and

[rules][/rules]

### #3

## 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.

Is that what you where asking for?

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.

Is that what you where asking for?

Page 1 of 1