nx_triangulation_graph.nx
buildroot/runtime/nx_triangulation_graph.nx
about
nx_triangulation_graph.nx -- battery 5: graph algorithms.
Triangulates nx_graph_bfs_count, nx_graph_is_connected,
nx_graph_degree, nx_graph_edge_count on a few well-known small
graphs (path, cycle, star, complete). Cross-witnesses use
graph-theory identities:
- For ANY connected graph with n vertices and starting vertex v:
bfs_count(v) == n
- For ANY graph: sum(degree(v)) == 2 * edge_count
- Cycle Cn: every vertex has degree 2 (a deterministic property)
- Path Pn: 2 endpoints have degree 1, internal vertices have degree 2
dependencies 4 imports · 0 importers
imports: nx_syscalls.nxnx_runtime.nxnx_tier.nxnx_graph.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
| 25 | func nx_tri_check(label: *u8, aut: nx_int, w1: nx_int, w2: nx_int, |
| 42 | func nx_set_edge(adj: *nx_int, n: nx_int, u: nx_int, v: nx_int) called by 1: main |
| 47 | func main() -> nx_exit |