v0.1.3

Changed

• Updated CITATION.bib (just very minor tweaks) (#62).
• Changed the main header in README.md from 'SDiagonalizability' to the more idiomatic 'SDiagonalizability.jl' (#61).

Fixed

• Fixed a typo in some comments in the Aqua.jl static analysis tests (#60).

v0.1.2

Added

• Added References sections to docstrings for immediate readability in the REPL and in the source code without needing to open the Documenter-generated website (#47, #48).

Changed

• Finished the docstring for _assert_graph_has_defined_s_bandwidth function (#55).
• Made the return type of the _pot_kernel_1neg_eigvecs and _pot_nonkernel_1neg_eigvecs functions consistent regardless of the n parameter passed (#51).
• Finished the docstrings for src/eigenvector_generation.jl, fixing some minor inaccuracies along the way (#51).

Fixed

• Fixed an UndefVarError in the _assert_graph_has_defined_s_bandwidth function (#55).

v0.1.1

Changed

• Bumped compat for DataStructures.jl from 0.18.15 to 0.18.15 - 0.19 (#39).
• Changed check_spectrum_integrality to compute the real integer eigenvalues lazily (comparison was already lazy, but taking the real part and rounding was not) (#37).

Removed

• Removed the unnecessary and redundant _laplacian_1neg_spectra(spec::SSpectra) method from src/laplacian_s_spectra.jl (this method literally did nothing whatsoever; I left it in from a previous design approach) (#38).

v0.1.0

This is the first stable release of SDiagonalizability.jl, implementing the first algorithm beyond mere brute force to minimize the S-bandwidth of an undirected graph with integer edge weights. Capabilities also exist for determining whether a graph has S bandwidth less than or equal to a fixed integer k ≥ 1 without necessarily caring about the true minimum value.

Although a good chunk of documentation and tests is still missing, the core API is fully functional and the package is ready for use. We are currently working on filling in the gaps and aim to release a more polished update (v0.1.1) in the near future.