DATA-STRUCTURES-BASICS5 MIN READ
Choose the traversal by the promise
Match graph traversal strategy to shortest-hop, exhaustive, or priority-first goals.
The wrong path The dependency explorer returns a valid approval chain, but not the shortest one the manager asked for. A path can be valid and still violate the traversal promise. Traversal fit Queue, stack, or priority queue The structure that holds the frontier controls which node is explored next. Any path Return the first path found The result matches the product promise. The frontier data structure is the traversal policy. 01 Shortest 02 Cycle 03 Risk Decision 1 The graph is unweighted and the user asks for the fewest approval hops.
Read the full lesson
Sign up free — one personalized lesson every day, matched to your role and goals.
Already have an account? Sign in