dsa2 min read
Reconstruct Itinerary — Hierholzer's Eulerian Path
Find the itinerary using all flight tickets exactly once (Eulerian path). Uses Hierholzer's algorithm: DFS with post-order insertion into result — the only graph algorithm that uses post-order for path construction.
Read →