Answers are grounded in this paper and cite their sources.
Software report demonstrates linear-time planarity testing and embedding across complex networks, highlighting accessible high-performance graph processing in C and Python.
The Edge Addition Planarity Suite is an open source software package that was originally developed to implement a new planarity algorithm by Boyer and Myrvold (see DOI:10.7155/jgaa.00091 in Related Works). For a given graph, the algorithm creates either a planar embedding or a minimal subgraph obstructing planarity. The Edge Addition Planarity Algorithm is currently regarded as one of two state-of-the-art planarity algorithms due to it conceptual simplicity as well as its speed of execution (for example, see this page and DOI:10.1007/978-3-540-24595-7_3 in Related Works). Subsequent to developing the Edge Addition Planarity Algorithm, the underlying graph library was extended to enable development of other planarity-related algorithms. The software package also includes an implementation of a planar graph drawing algorithm (see DOI:10.1007/11618058_47 in Related Works) as well as outerplanarity and subgraph homeomorphism search algorithms (see DOI:10.7155/jgaa.00268 in Related Works). The generalized graph library within the Edge Addition Planarity Suite can now be easily extended to provide a high-performance solution for processing and analyzing graphs, digraphs, and networks. In addition to the uploaded software package supporting graph application development in C/C++, the Edge Addition Planarity Suite has also been made available to Python application developers via the Planarity PyPI package. To build the uploaded software package, extract the tar.gz file into a folder and then, in bash, run ./configure and then make. Once these have finished running, a quick test can be performed using ./planarity.exe -test ./c/samples. A menu mode can be accessed by typing ./planarity.exe. The header files and generalized graph library (libPlanarity) can also be incorporated into the user's own C/C++ graph processing applications. The software is also available from the package managers of numerous variants of Linux (see repology/edge-addition-planarity-suite [web archive] and repology/planarity [web archive]). Python developers need only run pip install planarity to get the software from the Python package installer. For the one month preceding August 1, 2026, the planarity Python package was downloaded over 700 thousand times (see web archive). The planarity Python package is also available within numerous variants of Linux (see repology/python:planarity] [web archive]).
No takes yet. Share an insight, caveat, or question.
Boyer et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: