Home

This source 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, which is now the fastest and simplest linear-time method for planar graph embedding and planarity obstruction isolation (i.e. Kuratowski subgraph isolation). This project includes implementations of:

• the core Edge Addition Planarity Algorithm (combinatorial planar graph embedder and planarity obstruction isolator)
• a method for drawing planar graphs using visibility representations (as well as an ascii art renderer)
• an outerplanar graph embedder and outerplanar obstruction isolator
• a number of subgraph homeomorphism search algorithms
• several useful low-level methods, such as graph depth first search (DFS), lowpoint, and planar embedding face traversal.

There has been successful technology transfer into other projects of this project's code or algorithms, including:

• Debian Linux (doc) and related including Ubuntu and openSUSE (see repology)
• Gentoo Linux (doc)
• SageMath (bibl)
• Open Graph Drawing Framework (doc)
• Boost (bibl)
• Gleich's MatLab-BGL Package uses Boost to make the planarity algorithm available to MatLab developers
• The RBGL Boost Interface makes the planarity algorithm available to R developers
• Hagberg's Python Wrapper
• LinKnot (bibl)
• Magma (bibl)
• Nauty and Traces (doc, former site)

For more information, please see the sections below:

1. Project Overview

2. Dev Setup

3. Test Support