2 Replies - 3916 Views - Last Post: 11 November 2008 - 08:10 AM Rate Topic: -----

#1 slimdime  Icon User is offline

  • New D.I.C Head

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

Reverse-delete algorithm

Post icon  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  Icon User is offline

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

Reputation: 8325
  • View blog
  • Posts: 31,857
  • 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]
Was This Post Helpful? 0
  • +
  • -

#3 lordms12  Icon User is offline

  • D.I.C Regular
  • member icon

Reputation: 30
  • View blog
  • 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?
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1