From 1414a714115b291c3bd64e3a574a4fcaca82c044 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Stefan=20Z=C3=B6rner?= Date: Sat, 5 Sep 2026 08:37:18 +0200 Subject: [PATCH] Log leaf-node reduction at INFO level --- codewiki/src/be/dependency_analyzer/topo_sort.py | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) diff --git a/codewiki/src/be/dependency_analyzer/topo_sort.py b/codewiki/src/be/dependency_analyzer/topo_sort.py index da9ae3a0..99d9249e 100644 --- a/codewiki/src/be/dependency_analyzer/topo_sort.py +++ b/codewiki/src/be/dependency_analyzer/topo_sort.py @@ -310,13 +310,17 @@ def concise_node(leaf_nodes: Set[str]) -> Set[str]: concise_leaf_nodes = concise_node(leaf_nodes) if len(concise_leaf_nodes) >= LEAF_REDUCTION_THRESHOLD: - logger.debug(f"Leaf nodes are too many ({len(concise_leaf_nodes)}), removing dependencies of other nodes") + count_before = len(concise_leaf_nodes) + logger.info("Leaf nodes are too many (%d >= %d); reducing to components " + "that nothing else depends on.", + count_before, LEAF_REDUCTION_THRESHOLD) # Remove nodes that are dependencies of other nodes for node, deps in acyclic_graph.items(): for dep in deps: leaf_nodes.discard(dep) - + concise_leaf_nodes = concise_node(leaf_nodes) + logger.info("Reduced from %d to %d leaf nodes.", count_before, len(concise_leaf_nodes)) if not leaf_nodes: logger.warning("No leaf nodes found in the graph")