* Initial official release for publication * **Moshiri N** (2025). "CompactTree: A lightweight header-only C++ library for ultra-large phylogenetics." *Gigabyte*. [doi:10.46471/gigabyte.152](https://doi.org/10.46471/gigabyte.152)
0.0.8
* Define `NULL_NODE` as `std::numeric_limits<CT_NODE_T>::max()` instead of `(CT_NODE_T)(-1)` * Since `CT_NODE_T` is either `std::uint32_t` or `std::uint64_t`, this *shouldn't* make a difference, but this might be safer
0.0.7
* Added details about the Python wrapper to CompactTree documentation
0.0.6
* Fixed PyPI deployment: https://pypi.org/project/CompactTree * CompactTree's Python wrapper can now be installed with `pip install CompactTree`
0.0.5
* Added square-bracket operator (`tree[node]`) to extract data related to `node` * Added `add_child` function * Added `get_newick` function * Removed internal use of nested iterator classes * Removed all `auto` statements from `compact_tree.h` * Restructured `calc_distance_matrix` return type * Added Python wrapper * Initial steps towards PyPI package
0.0.4
* Multiple updates thanks to great feedback from lczech * Fixed Clang compilation issues * Updated how string concatenation was being done for error messages * Added explicit copy-assignment operators to the iterator classes * Changed constructors to accept `const` inputs * Added a `levelorder_iterator` class just like the existing `preorder_iterator` and `postorder_iterator` classes * Updated cookbook and documentation to specify visit order in the various traversal iterators