Hello there. Obviously input is a simple graph (neither directed, nor bipartite) and it wants maximum matching of this graph. how someone told about BFS? I think it is harder than what it seems to be.
btw, anyone can tell me briefly about Flower Tree and blossoms? I haven't heard about it in any Data-Structure book. :) Thanks anyone. aidin[at]bamdad[dot]org