To help you get started, problems like the first one can usually be tackled by considering the parity of the intersections. A small example: Suppose you start away from an intersection which has an odd number of roads into it [for example, going to the end of a street where you can only turn left of right]. Well if you start your journey away from that intersection and go there, you have used one road; when you leave you use another road; when you return you use another; etc. What would happen if there were 3 such intersections?
I believe that in this I need to Eulerize the graph,which I already did (just I am not sure if I did it correctly). Now I am stuck there because I cannot find an Eulers path
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.