readbilite: better explain lowest_common output

2017-07-17 00:08:00 +02:00
parent 2afea497a3
commit bfdda18b9c
1 changed files with 1 additions and 1 deletions
--- 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 <html/>
+    return nodeA # should always find one tho, at least <html/>, but needed for max_depth


 def rank_nodes(grades):