You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
v0.3.0 implements several major performance improvements to the Caprara–Salazar–González, Del Corso–Manzini, and Gibbs–Poole–Stockmeyer algorithms. (The original implementations had a few minor discrepancies with the original paper affecting performance, but not correctness.) Furthermore, it changes the default recognition decider from DelCorsoManzini to CapraraSalazarGonzalez (which is now faster)—arguably a breaking change, contributing to the decision to bump to a new minor version.
Switched from recomputing Del Corso–Manzini placement deadlines from scratch each step to maintaining them incrementally as nodes are placed, incorporating the last missing optimization from the paper (Improve DCM performance #216).
Changed the default recognition decider from Del Corso–Manzini to Caprara–Salazar-González, which is now considerably faster after the performance fixes (Refactor CSG and made it the default decider #214).
Updated the _blb_connected helper (used in bandwidth_lower_bound) to avoid unnecessary allocations, now requiring only O(n) auxiliary space instead of O(n^2) (Reduce allocations in '_blb_connected' #213).
Fixed
Fixed minor discrepancy (not affecting correctness, only performance) between the Saxe–Gurari–Sudborough implementation and the original paper; now, candidates are pruned early when a node in the active region is already at its maximum number of allowed dangling edges (and so the next node must be adjacent to it) (Fix minor SGS discrepancy #215).
Significantly refactored the Caprara–Salazar-González logic to fix several bugs severely affecting performance (although not correctness); this also allowed us to remove JuMP.jl and HiGHS.jl as dependencies (Refactor CSG and made it the default decider #214).
Fixed off-by-one bug in the expiration-time pruning of the Del Corso–Manzini algorithm(s) (did not affect correctness, only performance) (Fix minor bug in DCM algorithm(s) #211).
Fixed several discrepancies between the Gibbs–Poole–Stockmeyer minimization algorithm as described in the original paper and its implementation (the README and tutorial examples was also updated accordingly) (Fix discrepancies in GPS minimization algorithm #209).
Removed
Removed nightly CI runs (on pre) from the GitHub Actions CI workflow, since they often fail due to incompatibilities with dependencies in the testing matrix (Remove nightly CI runs from Github Actions #212).
@JuliaRegistrator register
Release notes:
v0.3.0 implements several major performance improvements to the Caprara–Salazar–González, Del Corso–Manzini, and Gibbs–Poole–Stockmeyer algorithms. (The original implementations had a few minor discrepancies with the original paper affecting performance, but not correctness.) Furthermore, it changes the default recognition decider from
DelCorsoManzinitoCapraraSalazarGonzalez(which is now faster)—arguably a breaking change, contributing to the decision to bump to a new minor version.Changed
@replblocks tojldoctestblocks in the docstrings, since Documenter.jl stopped executing@replblocks in the generated documentation (Switch back from @repl to jldoctest blocks in docstrings #217)._blb_connectedhelper (used inbandwidth_lower_bound) to avoid unnecessary allocations, now requiring onlyO(n)auxiliary space instead ofO(n^2)(Reduce allocations in '_blb_connected' #213).Fixed
READMEand tutorial examples was also updated accordingly) (Fix discrepancies in GPS minimization algorithm #209).Removed
pre) from the GitHub Actions CI workflow, since they often fail due to incompatibilities with dependencies in the testing matrix (Remove nightly CI runs from Github Actions #212).