@@ -1077,7 +1077,7 @@ end
1077
1077
Create all splitting forests and subtrees associated to ordered subtrees of a
1078
1078
rooted tree `t`.
1079
1079
1080
- Seee also [`SplittingIterator`](@ref).
1080
+ See also [`SplittingIterator`](@ref).
1081
1081
1082
1082
# References
1083
1083
@@ -1431,7 +1431,7 @@ function elementary_differential_latexstring(t::RootedTree)
1431
1431
return latexstring (rec_elementary_differential (t))
1432
1432
end
1433
1433
1434
- # Function used to go recursively through the RootedTree
1434
+ # Function used to go recursively through the RootedTree
1435
1435
# to generate the elementary differential of the tree.
1436
1436
function rec_elementary_differential (t:: RootedTree )
1437
1437
subtree_strings = String[]
@@ -1489,7 +1489,7 @@ function elementary_weight_latexstring(t::RootedTree)
1489
1489
return latexstring (join (substrings))
1490
1490
end
1491
1491
1492
- # Function used to go recursively through the RootedTree
1492
+ # Function used to go recursively through the RootedTree
1493
1493
# to generate the elementary weight of the tree.
1494
1494
function elm_weights_rec! (t:: RootedTree , last_index, a)
1495
1495
alphabet = copy (a)
@@ -1523,7 +1523,7 @@ function elm_weights_rec!(t::RootedTree, last_index, a)
1523
1523
indices = vcat (indices, idx)
1524
1524
push! (substrings, substring)
1525
1525
end
1526
- # Specialcase: The identical trees were the last ones
1526
+ # Specialcase: The identical trees were the last ones
1527
1527
if tree_count > 1
1528
1528
if length (prev_tree. level_sequence) == 1
1529
1529
substrings[end ] = " $(substrings[end ]) ^{$tree_count }"
0 commit comments