code wiki / (root) / nx_triangulation_sort_string_graph.nx

nx_triangulation_sort_string_graph.nx

buildroot/runtime/nx_triangulation_sort_string_graph.nx

5194 B126 linesdepth 5pulls 11 transitivereach 0 importersview sourcekind tooltopic triangulation
docsdependenciesstructsconstsfunctions

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

nx_syscalls.nx nx_runtime.nx nx_tier.nx nx_classical_unpatented.nx nx_mergesort.nx nx_quicksort.nx nx_kmp_search.nx nx_boyer_moore.nx nx_rabin_karp.nx nx_triangulation_sort_string_g

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

main sys_mmap println sys_write strlen sys_mmap ↻ nx_fill_test_array nx_bubble_sort nx_insertion_sort nx_mergesort sys_mmap ↻ nx_mergesort_recur nx_mergesort_recur ↻ nx_mergesort_merge nx_quicksort nx_quicksort_recur nx_quicksort_partition nx_quicksort_recur ↻ nx_tri_check print sys_write ↻ strlen ↻ print_i64 sys_mmap ↻ itoa sys_mmap ↻ sys_write ↻ println ↻ nx_kmp_search sys_mmap ↻ nx_kmp_build_failure nx_boyer_moore_search sys_mmap ↻ nx_boyer_moore_build_table nx_rabin_karp print ↻ print_i64 ↻

structs

none

consts

none

functions

28func nx_tri_check(label: *u8, aut: nx_int, w1: nx_int, w2: nx_int,
called by 1: main calls 3: printprint_i64println
43func nx_fill_test_array(arr: *nx_int)
called by 1: main
48func main() -> nx_exit