Print routes from tickets
<p>Today I encountered a question which I am not able to solve.<br></p>

<p>A frequent traveler collects all his travel tickets. 
A ticket has only 2 attributes, Start Journey Location name and Destination Name. Example from Delhi to NY. 
At the end of the year, the traveler gets all his tickets together and tries to map his journey across the year. Print his probable travel route in a readable format. He does not remember his start location.  he can visit a location multiple times, and can also go back and forth a place several times.</p>

<p>Initially i thought that it could simply be solved by making a graph(ticket-A to B means a directed edge A->B) and using a simple Depth first traversal from a node with indegree 0(??). but then I realized that its not the correct way to get solution as it could print a random unconnected route.<br>
Please suggest a correct way to proceed.</p>