原題與已知條件
有限簡單無向圖 V={-11, -10, -9, -8}、E={{-11, -10}, {-10, -9}, {-9, -8}},邊無方向、沒有自環或重邊。頂點 v=-9 已屬於 V,求遞增且不重複的鄰居集合 N(v)。
G001 — 有限簡單無向圖 V={-11, -10, -9, -8}、E={{-11, -10}, {-10, -9}, {-9, -8}},邊無方向、沒有自環或重邊。頂點 v=-9 已屬於 V,求遞增且不重複的鄰居集合 N(v)。
逐步推導
S001 · implies
操作前
source roles = [qf-simple-graph-neighbors, [E, V, operation, v]]
操作後
derived = [neighbors, no-invented-domain]
條件:無
各bank的keys/operation/domain獨立:LDL/PULSE/function legacy為表內underscore,TREE是完整tree_*與明定domain,BASE signed較寬不偷加op/domain。所有算術保持binary primitive契約。
步驟識別與依賴
規則:R69_SOURCE_specific_keys_operation_domain_AND_binary_contract · 依賴:G001
S002 · implies
操作前
source roles = [LDL graph vertices ORIGINAL, 100, [-11, -10, -9, -8]]
操作後
derived = [[-11, -10, -9, -8]]
條件:無
先驗全部raw SAFE元素、不重複及此bank個數界,空集合法;只把衍生表示排序,原JSON不修改。TREE與LDL的上限不可互搬。
步驟識別與依賴
規則:Finite_RAW_ALL_SAFE_distinct_labels_then_derived_sort · 依賴:G001, S001
S003 · implies
操作前
source roles = [LDL raw edges ORIGINAL, 0, [-11, -10]]
操作後
derived = [[-11, -10]]
條件:無
去重之前逐raw pair驗恰兩個SAFE分量;相同row可作表示重複,但不能先丟掉未驗欄位。
步驟識別與依賴
規則:Pairs_EVERY_RAW_two_SAFE_cells_BEFORE_any_dedup · 依賴:G001, S002
S004 · implies
操作前
source roles = [LDL raw edges ORIGINAL, 1, [-10, -9]]
操作後
derived = [[-10, -9]]
條件:無
去重之前逐raw pair驗恰兩個SAFE分量;相同row可作表示重複,但不能先丟掉未驗欄位。
步驟識別與依賴
規則:Pairs_EVERY_RAW_two_SAFE_cells_BEFORE_any_dedup · 依賴:G001, S003
S005 · implies
操作前
source roles = [LDL raw edges ORIGINAL, 2, [-9, -8]]
操作後
derived = [[-9, -8]]
條件:無
去重之前逐raw pair驗恰兩個SAFE分量;相同row可作表示重複,但不能先丟掉未驗欄位。
步驟識別與依賴
規則:Pairs_EVERY_RAW_two_SAFE_cells_BEFORE_any_dedup · 依賴:G001, S004
S006 · implies
操作前
source roles = [[-11, -10, -9, -8], [[-11, -10], [-10, -9], [-9, -8]], 否]
操作後
derived = [[[-11, -10], [-10, -9], [-9, -8]], [[-11, [-10]], [-10, [-11, -9]], [-9, [-10, -8]], [-8, [-9]]]]
條件:無
完整raw edges先型別檢查、再作無向正規化/去重,反向重複合法;輸入edge不准loop或carrier外端點,孤立頂點仍留在V。TREE raw E不借用LDL的200界。
步驟識別與依賴
規則:Graph_WHOLE_simple_undirected_edges_normalized_NO_loops_or_outside · 依賴:G001, S005
S007 · implies
操作前
source roles = [-9, [-11, -10, -9, -8]]
操作後
derived = [[-10, -8], 2]
條件:無
degree/neighbor query先要求v在V,逐全部edge找異於v的鄰點並去重;不是數圖上交點或raw duplicate rows。
步驟識別與依賴
規則:Graph_QUERY_vertex_must_belong_V_complete_distinct_neighbors · 依賴:G001, S006