Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth (ArXiv cs.DS Recent Papers, 2026)