Can it be a solution? At first let us think all the edges are undirected. That is if a adjacent to b then both a->b and b->a are present. then we discard a->b if a is the current vertex with maximum outdegree and b is its adjacent with minimum outdegree and b->a is present we continue it again and again untill all the extra edges are removed.
will it work? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
