code wiki / _hdl_build / nx_geo_route_gate.nx
nx_geo_route_gate.nx
buildroot/runtime/_hdl_build/nx_geo_route_gate.nx
about
nx_geo_route_gate.nx -- GATE for GEO-008 routing. A baked 5-node weighted graph where the OPTIMAL
path is NOT the direct edge (proves Dijkstra finds the true shortest, not a greedy direct hop):
undirected edges: 0-1=4, 0-2=1, 2-1=2, 1-3=1, 2-3=5, 3-4=3
from 0: dist[2]=1, dist[1]=3 (0-2-1, beating direct 0-1=4), dist[3]=4 (0-2-1-3), dist[4]=7
path 0->3 = [0,2,1,3]; isochrone(budget 4) = {0,2,1,3} (node 4 at 7 excluded); node 5 unreachable
Evidence -> knowledge/status/geo_route.log (GEOROUTEGATE authored=organ ... verdict=GREEN).
license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_geo_route.nxnx_syscalls.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| 12 | const GR_LOG: *u8 = "knowledge/status/geo_route.log" |
functions
| 14 | func gr_w(fd: i64, s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(fd, s, n); return 0 } |
| 15 | func gr_wn(fd: i64, v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(fd,"-" as *u8,1)}; let t: *u8 = sys_mmap(28); var k: i64=0; if m==0 {t[0]=48;k=1}; while m>0 {t[k]=(48+(m%10)) as u8; m=m/10; k=k+1}; var i: i64=0; while i<k {bb[i]=t[k-1-i]; i=i+1}; sys_write(fd, bb, k); return 0 } |
| 17 | func gr_edge(adj: *i64, n: i64, a: i64, b: i64, w: i64) -> i64 { adj[a * n + b] = w; adj[b * n + a] = w; return 0 } called by 1: main |
| 19 | func gr_emit(fd: i64, d1: i64, d3: i64, d4: i64, p3: i64, plen: i64, phead: i64, ptail: i64, iso: i64, unreach: i64, ok: i64) -> i64 |
| 33 | func main() -> i64 |