In hungarian algorithm we've got to implement max match for a bipartite graph. What methods are quite enough to got AC? I impelemented recursive argumental chains and got TL#6. What about non-recursive chains?