From e32755d25633634448f2b8e7387f52a9d005c3ff Mon Sep 17 00:00:00 2001 From: devam007 Date: Fri, 23 Oct 2026 20:57:25 +0530 Subject: [PATCH] test: cover topological sort edge cases --- graphs/kahns_algorithm_topo.py | 12 ++++++++++++ 1 file changed, 12 insertions(+) diff --git a/graphs/kahns_algorithm_topo.py b/graphs/kahns_algorithm_topo.py index df5d1d72b9b8..842046d465e3 100644 --- a/graphs/kahns_algorithm_topo.py +++ b/graphs/kahns_algorithm_topo.py @@ -31,6 +31,18 @@ def topological_sort(graph: dict[int, list[int]]) -> list[int] | None: >>> sparse_cycle = {10: [20], 20: [10]} >>> topological_sort(sparse_cycle) + + >>> topological_sort({}) + [] + >>> topological_sort({42: []}) + [42] + >>> order = topological_sort({10: [20], 20: [], 30: [40], 40: []}) + >>> sorted(order) + [10, 20, 30, 40] + >>> order.index(10) < order.index(20) and order.index(30) < order.index(40) + True + >>> topological_sort({7: [7]}) is None + True """ indegree = dict.fromkeys(graph, 0)