Constructive reachability, cycles and shortest paths on generated finite graphs
- Publié
- Serveur de preprints
- Zenodo
- DOI
- 10.5281/zenodo.24341593
Complete constructive path witnesses, exact cycle-return equivalence and shortest-path minimality on generated finite graphs. Maria Smith derives both directions of reachability, reconstructs complete return paths, and proves discovery and shortestness for the original ordered undirected search using explicit queue invariants. Includes cuts, token balance, boundary-depth dimension, finite open-family closure and inverse-image continuity; full 512/1,024-candidate classifications; 408 empty-axiom audited definitions and theorems; pinned V3/V4 proofs and portable exhaustive reproduction. Correspondence: Maria.smith.sftoe@gmail.com. SFT community and invitation: https://discord.gg/QCNkzq6kZC.