# Gabow Scaling For Shortest Paths: Study Guide
Gabow Scaling For Shortest Paths shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Solve the instance bit by bit, scaling edge weights and reusing potentials so each scale is a cheaper shortest-path problem.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(m n^{1/2} log(n W)) class bounds depending on the inner solver.
## Common mistake
Forgetting to update potentials between scales, which reintroduces large reduced costs.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at official website.