@wei.qui On a second thought , if the petrol pumps have many petrol pumps connected to it , we cannot find the answer your way or the method suggested by me previously . Thus , the solution becomes one to find out the Eulerian Path (constraint based of course )
-- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
