id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
604	Faster MaxMatching implementation	Alpar Juttner	Balazs Dezso	"From Joran van Apeldoorn:

> On odd graphs it does not notice when a perfect matching (as in (n-1)/2 matched edges) is found and continues to do a BFS from the one unmatched vertex, off course without result.
> This makes the running time for slightly dense graphs a lot longer on odd graphs then on even graphs, to the extend that it can take easely a 100 times longer on odd graphs."	enhancement	closed	major	LEMON 1.4 release	core	hg main	done		joran.van.apeldoorn@…