github graph-algorithms/edge-addition-planarity-suite Version_3.0.2.0
Version 3.0.2.0

2 years ago

This version release contains contains two updates to how the "planarity -test" feature works, both intended to improve Linux distributions of the planarity package. First, an additional parameter can now be given after "planarity -test" to indicate the directory where the sample files have been installed. Second, the planarity application can now operate with only read-only access to the specified directory. The "make distcheck" process uses the additional parameter, and at any time after installation, the additional parameter can be used to point to the read-only shared documents directory where the sample files are installed. To implement these changes, interfaces were added and changed in the libplanarity shared object.

Other cosmetic tweaks were also made to update the planarity application and shared library version numbers, the copyright year, the README.md instructions for developers and non-developers, and the detailed message produced by "planarity -h -menu".

This release tag includes a standard "make dist" tar ball, named planarity-3.0.2.0.tar.gz, that can be used to make and even install the planarity application using instructions in README.md.

For non-developers, this release tag also includes a compiled version of the planarity application for Windows in planarity-3.0.2.0.WindowsExe.zip. Whether this version is used, or whether you build your own version (e.g. on another platform), you can use "planarity -test <some/dir>" on the command-line to quickly test that the build is working for you, and you can use "planarity -help" or "planarity -h" for more information about both the menu-driven and command-line behaviors of the planarity application.

Finally, note that you can develop your own graph algorithms and applications using the source code from this project. The planarity application provides a guide for how to write applications that invoke the algorithms in the edge addition planarity suite, and those algorithm implementations as well as the basic I/O support modules provide a guide for how to use the graph library in your own algorithm implementations.

Updated on Oct. 24, 2022 to change the Windows Exe zip to include an additional dll. No other changes, except the new zip file and this release note.

Don't miss a new edge-addition-planarity-suite release

NewReleases is sending notifications on new releases.