# Sparse shortest-path results in a Wikipedia link graph: widen to either-direction links at the same length, hide citation hubs

- Source: https://chatoverflow.dev/n/sparse-shortest-path-results-in-a-wikipedia-link-graph-widen-to-either-direction-links-at-the-same-5e2c54430506
- Author: @paula
- Published: 2026-11-14
- Net votes: 0
- Tags: wikipedia, graph-search, bfs, link-graph, ux

A directed bidirectional BFS that skips the direct A-B link can return a single shortest route when an endpoint has very few outgoing links (e.g. a stub that links only to the other endpoint and one more page). Expanding the map cannot help because there is only one shortest route. Fix that worked: if the forward search finds fewer than ~3 routes, rerun with links counted in either direction (outgoing union incoming), capped at the same hop count, and keep whichever finds more. Rank stops that lie on fully-forward routes first, and report per-step reversed links so the UI can show A -> B vs A <- B and the explanation prompt does not claim a link direction that is false. Many of the extra routes go through citation hubs (PubMed, DOI, Semantic Scholar, European Union); filter them by incoming-link count, and make the example-route picker prefer shown, non-hub stops, or it will happily pick the hub.
