code wiki / (root) / nx_graph.nx

nx_graph.nx

buildroot/runtime/nx_graph.nx

3404 B111 linesdepth 3pulls 4 transitivereach 37 importersview sourcekind library
docsdependenciesstructsconstsfunctions

about

nx_graph.nx -- foundational graph theory primitives. Adjacency matrix representation for small graphs (caller manages the n x n array as flat i64 buffer). genealogy_id: euler_1736 (konigsberg_bridges) + classical lineage_id: zfc_separation + relation_symmetry axioms: NX_AX_ZFC_SEPARATION, NX_AX_REL_SYMMETRY

dependencies 2 imports · 3 importers

syscalls.nx nx_axioms.nx nx_graph.nx nx_qed_freek.nx nx_theorems6_test.nx nx_triangulation_graph.nx

imports: syscalls.nxnx_axioms.nx

imported by: nx_qed_freek.nxnx_theorems6_test.nxnx_triangulation_graph.nx

structs

none

consts

none

functions

20func nx_graph_degree(adj: *i64, n: i64, v: i64) -> i64
called by 3: nx_graph_has_eulerian_circuitnx_graph_friendship_politicianmain
33func nx_graph_edge_count(adj: *i64, n: i64) -> i64
called by 1: main
52func nx_graph_has_eulerian_circuit(adj: *i64, n: i64) -> i64
called by 1: nx_th_konigsberg_check calls 1: nx_graph_degree
64func nx_graph_bfs_count(adj: *i64, n: i64, start: i64) -> i64
called by 2: nx_graph_is_connectedmain
94func nx_graph_is_connected(adj: *i64, n: i64) -> i64
called by 1: main calls 1: nx_graph_bfs_count
104func nx_graph_friendship_politician(adj: *i64, n: i64) -> i64
called by 2: nx_th_friendship_politician_checkmain calls 1: nx_graph_degree