From bfdda18b9cc4f1ad886b120a39b448d96f825635 Mon Sep 17 00:00:00 2001 From: pictuga Date: Mon, 17 Jul 2017 00:08:00 +0200 Subject: [PATCH] readbilite: better explain lowest_common output --- morss/readabilite.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/morss/readabilite.py b/morss/readabilite.py index 36abe42..d02d59f 100644 --- a/morss/readabilite.py +++ b/morss/readabilite.py @@ -198,7 +198,7 @@ def lowest_common_ancestor(nodeA, nodeB, max_depth=None): if ancestorA in ancestorsB: return ancestorA - return nodeA # should always find one tho, at least + return nodeA # should always find one tho, at least , but needed for max_depth def rank_nodes(grades):