.. _spkg_planarity:

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).

[1] http://dx.doi.org/10.7155/jgaa.00091

License
-------

New BSD License


Upstream Contact
----------------

-  https://github.com/graph-algorithms/edge-addition-planarity-suite/

-  John Boyer <John.Boyer.PhD@gmail.com>

Dependencies
------------

None


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


Version Information
-------------------

package-version.txt::

    3.0.1.0


Equivalent System Packages
--------------------------

arch:

.. CODE-BLOCK:: bash

    $ sudo pacman -S  planarity

conda:

.. CODE-BLOCK:: bash

    $ conda install planarity

Debian/Ubuntu:

.. CODE-BLOCK:: bash

    $ sudo apt-get install  planarity

Fedora/Redhat/CentOS:

.. CODE-BLOCK:: bash

    $ sudo yum install  planarity

freebsd:

.. CODE-BLOCK:: bash

    $ sudo pkg install planarity

gentoo:

.. CODE-BLOCK:: bash

    $ sudo emerge planarity

nix:

.. CODE-BLOCK:: bash

    $ nix-env --install planarity

opensuse:

.. CODE-BLOCK:: bash

    $ sudo zypper install planarity

See https://repology.org/project/planarity/versions

If the system package is installed, ./configure will check whether it can be used.