# Reverse-delete algorithm

Page 1 of 1

## 2 Replies - 6502 Views - Last Post: 11 November 2008 - 08:10 AMRate Topic: //<![CDATA[ rating = new ipb.rating( 'topic_rate_', { url: 'https://www.dreamincode.net/forums/index.php?app=forums&module=ajax&section=topics&do=rateTopic&t=71137&amp;s=defb7355ba87af6b966e8f47182a36ac&md5check=' + ipb.vars['secure_hash'], cur_rating: 0, rated: 0, allow_rate: 0, multi_rate: 1, show_rate_text: true } ); //]]>

### #1 slimdime

• New D.I.C Head

Reputation: 0
• Posts: 22
• Joined: 15-March 08

# Reverse-delete algorithm

Posted 09 November 2008 - 06:07 PM

I don't get this (Reverse-delete algorithm). Can someone give me an example, please.
Is This A Good Question/Topic? 0

## Replies To: Reverse-delete algorithm

### #2 pbl

• There is nothing you can't do with a JTable

Reputation: 8378
• Posts: 31,956
• Joined: 06-March 08

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

### #3 lordms12

• D.I.C Regular

Reputation: 30
• Posts: 339
• Joined: 16-February 08

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