Leetcode Problem 332. Reconstruct Itinerary

332. Reconstruct Itinerary

Leetcode Solutions

Build a graph where each vertex represents an airport and edges represent flights between airports.
Sort the adjacency list of each vertex in ascending lexical order to satisfy the smallest lexical order requirement.
Start from 'JFK' and perform a DFS traversal of the graph.
During the DFS, once you reach a vertex with no further unvisited outgoing edges, add it to the final itinerary.
Since the graph is guaranteed to have at least one valid itinerary, the process will cover all edges exactly once.
The itinerary is constructed in reverse order, so reverse it at the end to get the correct order.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen