原題與已知條件
bounded finite simple graph的全部vertex subsets與all-edge cover audit。操作=mincover-empty-multiple-boundary;資料={"mode":"multiple_minima","vertices":["v0","v1","v2"],"edges":[["v0","v1"],["v1","v2"],["v2","v0"]]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
G001 — bounded finite simple graph的全部vertex subsets與all-edge cover audit。操作=mincover-empty-multiple-boundary;資料={"mode":"multiple_minima","vertices":["v0","v1","v2"],"edges":[["v0","v1"],["v1","v2"],["v2","v0"]]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
逐步推導
S001 · implies
操作前
source roles = [mincover-empty-multiple-boundary]
操作後
derived = [[mode, edges, minimum_size, minimum_covers, mode_certificate, boundary]]
條件:無
本頁直接列完整來源欄序,不需JavaScript;contract的6/4/6/6與IVT的8/7/8由原mode選,不補欄也不由答案形狀猜。
步驟識別與依賴
規則:source_ordered_fields_without_JS · 依賴:G001
S002 · implies
操作前
source roles = [[v0, v1, v2], [[v0, v1], [v1, v2], [v2, v0]], null]
操作後
derived = [[v0, v1, v2], [[v0, v1], [v0, v2], [v1, v2]], null]
條件:無
非空carrier至多12;端點UTF16排序後edge族English排序,loop/反向duplicate拒絕。未提供candidate時保持null,不擅補空candidate。
步驟識別與依賴
規則:Mincover_complete_simple_graph_UTF16_English_and_optional_candidate · 依賴:G001, S001
S003 · implies
操作前
source roles = [[v0, v1, v2], [[v0, v1], [v0, v2], [v1, v2]], 8]
操作後
derived = [[3, 5, 6, 7], [[0, 0], [1, 2], [2, 1], [4, 0]], [[v0, v1], [v0, v2], [v1, v2], [v0, v1, v2]], [0, 0, 3, 1], 2, [[v0, v1], [v0, v2], [v1, v2]]]
條件:無
逐全部mask核所有edges;每個失敗mask保首uncovered edge index反例,通過者全列source順序。較小size計數0給下界,實際最小解給上界;全部ties依numeric mask保留,不改English/大小序。
步驟識別與依賴
規則:Mincover_ALL_masks_acceptance_refutations_ALLcovers_ALLminimizers · 依賴:G001, S002
S004 · implies
操作前
source roles = [multiple_minima, [v0, v1, v2], [[v0, v1], [v0, v2], [v1, v2]]]
操作後
derived = [2, [[v0, v1], [v0, v2], [v1, v2]], 是]
條件:無
empty_graph指無邊而非空vertices;唯一minimum是空集。multiple_minima列全部至少兩個解,不把一個witness當唯一解,也不引König/weighted/directed版本。
步驟識別與依賴
規則:Mincover_original_empty_OR_multiple_boundary_not_uniqueness_guess · 依賴:G001, S003
結論
(multiple_minima, [[v0, v1], [v0, v2], [v1, v2]], 2, [[v0, v1], [v0, v2], [v1, v2]], 是, empty_graph_has_unique_empty_minimum_cover_while_other_graphs_may_have_multiple_minima_without_Konig_or_weighted_claims)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。