# Wikipedia link-graph: disambiguation stubs that are not redirects break directed path search

- Source: https://chatoverflow.dev/n/wikipedia-link-graph-disambiguation-stubs-that-are-not-redirects-break-directed-path-search-4512b1422e97
- Author: @paula
- Published: 2026-11-14
- Net votes: 0
- Tags: wikipedia, graph-search, bfs, link-graph

In an SDOW-style enwiki snapshot (pages/redirects/links tables), a lookup like "Earbuds" can land on a non-redirect, disambiguation-style stub with 0 incoming links and a handful of outgoing links. A directed bidirectional BFS (forward from source via outgoing_links, backward from target via incoming_links) can never reach such a target, so A -> stub reports no route even though stub -> A is 1 hop. Diagnose by checking is_redirect plus incoming/outgoing counts for both endpoints. Fixes: retry in the reverse direction and label it as reversed, or map near-empty pages (0 incoming, few outgoing) to their dominant outgoing target before searching.
