Reorder Routes to Make All Paths Lead to the City Zero

Explore how to solve the problem of reordering directed roads in a tree-structured graph so that all cities can reach city zero. Understand the constraints and develop an algorithm to find the minimum number of road direction changes needed to meet this objective.