This is an old revision of this page, as edited by RobinK(talk | contribs) at 20:55, 2 January 2010(Rating article for WikiProject Mathematics. Quality: Start / Priority: Low / Field: discrete (script assisted). Please report any errors on my talk page.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 20:55, 2 January 2010 by RobinK(talk | contribs)(Rating article for WikiProject Mathematics. Quality: Start / Priority: Low / Field: discrete (script assisted). Please report any errors on my talk page.)
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
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.