Talk:Edmonds' algorithm

Computer science Mid‑importance

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 articles Mid This article has been rated as Mid-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

On the external link page it seems one has to define which node is the root (though this wouldn't guarantee the tree is the globally optimal), but here it doesn't. I think some clarification on this point is needed. 88.74.10.111 (talk) 15:54, 29 June 2008 (UTC)

This page is pretty much useless. I came here expecting a nice explanation of this algorithm. Alas, it was not to be found! ~ —Preceding unsigned comment added by 173.60.204.46 (talk) 02:37, 11 October 2010 (UTC)