planarity: Planarity-related graph algorithms¶
Description¶
This code project provides a library for implementing graph algorithms as well as implementations of several planarity-related graph algorithms. The origin of this project is the reference implementation for the Edge Addition Planarity Algorithm [1], which is now the fastest and simplest linear-time method for planar graph embedding and planarity obstruction isolation (i.e. Kuratowski subgraph isolation).
License¶
New BSD License
Upstream Contact¶
Special Update/Build Instructions¶
The tarballs can be found at, https://github.com/graph-algorithms/edge-addition-planarity-suite/releases sage tarball is repackaged after running autogen.sh
Type¶
standard
Dependencies¶
Version Information¶
package-version.txt:
3.0.1.0
Equivalent System Packages¶
$ sudo pacman -S planarity
$ conda install planarity
$ sudo apt-get install libplanarity-dev planarity
$ sudo yum install planarity planarity-devel
$ sudo pkg install math/planarity
$ sudo emerge sci-mathematics/planarity
$ nix-env --install planarity
$ sudo zypper install edge-addition-planarity-suite edge-addition-planarity-suite-devel
$ sudo xbps-install planarity-devel
See https://repology.org/project/planarity/versions
If the system package is installed, ./configure will check if it can be used.