v0.4.0

• utilize external DNDTree and IDTree crates
• cleanup Python Ruff lint issues
• add import ordered shortest paths: this is not a true improvement over the GSSP or PD approximations and only helps improve some edge cases but is cheap and can yield the best result when GSSP and PD fail to do so under some circumstances.
• add variables to select which approximation and local improvements to use during compilation
• utilize betweenness ordering of removal candidates within PBS