nx_triangulation_sort_string_graph.nx
buildroot/runtime/nx_triangulation_sort_string_graph.nx
about
nx_triangulation_sort_string_graph.nx -- battery 4.
Covers sorting (3-way: bubble vs insertion vs mergesort vs quicksort),
string matching (3-way: KMP vs Boyer-Moore vs Rabin-Karp), and
graph algorithms (BFS count + is_connected consistency).
TRUE triangulation: each AUT is verified against 2 INDEPENDENT
implementations of the same problem, so disagreement reveals a real
implementation defect (which one is wrong is determined by majority
vote across the 3 paths).
dependencies 9 imports · 0 importers
imports: nx_syscalls.nxnx_runtime.nxnx_tier.nxnx_classical_unpatented.nxnx_mergesort.nxnx_quicksort.nxnx_kmp_search.nxnx_boyer_moore.nxnx_rabin_karp.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
| none |
functions
| 28 | func nx_tri_check(label: *u8, aut: nx_int, w1: nx_int, w2: nx_int, |
| 43 | func nx_fill_test_array(arr: *nx_int) called by 1: main |
| 48 | func main() -> nx_exit |