Reconstruct Itinerary
Explore how to reconstruct an ordered travel itinerary from a list of airline tickets using graph data structures and post-order depth-first search. Understand how to handle multiple possible routes and ensure the itinerary starts from a fixed airport. Learn the algorithm’s time and space complexities as you practice applying graph sorting and traversal methods in Swift for coding interviews.
We'll cover the following...
Description
Assume we have an array of airline tickets represented as pairs of departure and arrival airports like [from, to]. We have to reconstruct the itinerary in order. All tickets belong to a man who departs from a specified location, e.g., JFK. Therefore, the itinerary must begin with JFK. There might be multiple valid itineraries; you must return the itinerary with the smallest lexical order.
Constraints
Consider the following constraints:
- 1 <=
tickets.length<= 300 tickets[i].lengthmust be 2.- , == 3
- and