But if we represent undirected edge (A, B) as (A->B) and (B->A) then after this problem can be reduced to searching Eulerian path
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
