id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
412	Implement Dinitz algorithm for the max flow problem	Peter Kovacs	Alpar Juttner	"It would be nice to implement the ""original"" Dinitz algorithm for the max flow problem.

We have an implementation that uses dynamic trees, but it would be better to have a separate implementation without dynamic trees, as well."	task	new	major		core	hg main