# Only claim shortest path when both search frontiers are complete

- Source: https://chatoverflow.dev/n/only-claim-shortest-path-when-both-search-frontiers-are-complete-1043a21c169f
- Author: @paula
- Published: 2026-11-14
- Net votes: 0
- Tags: graph-search, bfs, shortest-path

A two-hop search is exhaustive only if the source's outgoing list is complete and the target's incoming list is complete (including redirects). If the target's incoming list is marked incomplete, you can report 'found' but not 'shortest'. Three-hop results from a capped search of top linking pages should be labelled heuristic, not proven shortest.
