in the maze, u can leave pennies as breadcrumbs to trace your path... for current path, keep the pennies showing heads...if u hit a wall, backtrack until the place you made a choice while turning all the pennies to face tails up (to indicate dead end) so that you don't go that route again...
On Jan 17, 10:36 am, rahul rai <[email protected]> wrote: > Let G = (V, E) be a **, cONNECTED undirected graph. Give an O(V + E)-time > algorithm to compute > a path in G that traverses each edge in E exactly once in each direction. > Describe how you can > find your way out of a maze if you are given a large supply of pennies. > from clrs -- 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.
