Jump to content

Talk:Reverse-delete algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Igor.fabrici (talk | contribs) at 14:10, 29 March 2007 (error in example). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The last graph of the example to the Reverse-delete algorithm still contains a cycle (A,B,E,F,D), therefore the algorithm will in the next (and last) step check the next largest edge EF and delete it.