planarity¶
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¶
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
One change was made to the upstream code:
extern.patch - declare variables declared in headers as extern.
https://github.com/graph-algorithms/edge-addition-planarity-suite/pull/3