The first version is implemented in #54. Left to do: - [ ] General ColoredRootedTreeIterator - [x] LaTeX output of (bi-) colored rooted trees - This could be based on https://tex.stackexchange.com/a/673436 - #100 - [ ] filter function to filter out some trees for the iterators, e.g., for Nyström methods - [x] Possible performance improvements are marked with `# TODO: ColoredRootedTree` (#71) - [x] partitions (#69) (required for `substitute`) - [ ] `SplittingIterator` (required for `compose`) See also #28 and ranocha/BSeries.jl#8
The first version is implemented in #54. Left to do:
# TODO: ColoredRootedTree(colored trees performance #71)substitute)SplittingIterator(required forcompose)See also #28 and ranocha/BSeries.jl#8