readbilite: better explain lowest_common output
This commit is contained in:
parent
2afea497a3
commit
bfdda18b9c
@ -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):
|
||||
|
Loading…
x
Reference in New Issue
Block a user