nx_wiki_walkability.nx

nx_wiki_walkability.nx -- IMS arc: MEASURED walkability scorecard over the REAL published wiki link graph (READ-ONLY baseline, no assertions). PURPOSE: produce the honest navigation baseline the operator asked for -- NUMBERS from the link graph, not claims. Over the live corpus it computes: 1. N pages, total internal page-links, avg/min/max OUT-degree + IN-degree. 2. ORPHANS (in==0, excluding root) + DEAD-ENDS (out==0), with slugs. 3. RECIPROCAL page pairs (A->B AND B->A) vs ONE-WAY pairs. 4. Reachability from start: reachable count, max clicks-to-reach (BFS depth), and STRANDED pages (unreachable from start). READ-ONLY BY CONSTRUCTION: reads ONE framed corpus snapshot via sys_read_file (the exact A1 transport) and computes in memory. Writes NOTHING to the corpus -- the only output is the scorecard to stdout + a status log. COMPOSES (DRY -- zero new corpus/link/slug substrate invented): nx_ims_monitor nx_ims_collect_targets (the ONE unified outbound [[wikilink]]+href extractor), nx_ims_slug_eq (the ONE slug resolver), nx_ims_resolve_root, and the NxWikiDocStore it composes -- so this scorecard's notion of "a link/edge" is byte-identical to the orphan/dead-link monitor and the graph builder. nx_syscalls sys_read_file (read-only) + sys_mmap scratch. The adjacency is built ONCE into a dense N*N edge bitmatrix (self-edges dropped -- a page linking itself is not navigation), then every metric is a pure read of that matrix. N is small (corpus cap), so N*N is trivial. Hygiene: M1 out-params; M3 every while hard-capped; M5 bounded indexing; M6 real semantics; M7 named constants; M8 verdicts. ("loop"/"match" reserved.) license_tier: ORIGINAL