id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
235	Push-relabel max flow (Preflow) for undirected graphs	Balazs Dezso	Alpar Juttner	"The current Preflow algorithm works well on undirected graphs, however a specialized version for undirected graphs could more efficient than the current solution. The flow map could be EdgeMap in this case and the edges do not need to be iterated twice (outgoing and incoming arcs). I think the overall improvement could be a small factor both in time and storage complexity.
"	enhancement	new	minor		core	hg main		preflow specialization undirected