github graph-algorithms/edge-addition-planarity-suite Version_3.0.1.0
Version 3.0.1.0

latest releases: Version_3.0.2.0, Version_3.0.1.1
3 years ago

This version bundles up two bug fixes (not in core algorithm implementations) and several cosmetic tweaks, mostly to improve usability of the code and project. The version number was increased at the maintenance level, not just the tweak level, due to the bug fixes. In a prior
release, an optimization was implemented to change from 0-based arrays to 1-based arrays. To facilitate comparison,
the code was generalized to allow use of either approach. However, the adjacency matrix writer in the gp_write() method
and the gp_CreateRandomGraphEx() method were not appropriately generalized. These two issues have been fixed.
Cosmetic tweaks include changes made to eliminate compiler warnings, a file added to make the debugger use an external
console, better handling of directories when the user wants to output graphs being generated, and the addition of a
README.md that includes getting started information.

This release tag also includes a compiled version for Windows. Whether this version is used, or whether you build
your own version (e.g. on another platform), you can use ./planarity.exe -test to quickly test that the build is
working for you, and you can use ./planarity.exe -h for more information about both the menu-driven and
command-line behaviors of the program.

This release now also contains a standard "make dist" tar ball, named planarity-3.0.1.0.tar.gz, that can be used to make and install the planarity program using the following command-line: ./configure && make && make install.

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.