边缘加平面套房

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, which is now the fastest and simplest linear-time method for planar graph embedding and planarity obstruction isolation (i.e. Kuratowski subgraph isolation). The software in this code project provides a graph algorithm framework and library, including an updated version of the edge addition combinatorial planar graph embedder and planar obstruction isolator (i.e., a Kuratowski subgraph isolator). This code project also includes several extensions that implement planarity-related algorithms such as a planar graph drawing algorithm, an outerplanar graph embedder and outerplanar obstruction isolato

samples
Petersen.txt.PlanarEmbed.out.txt
Petersen.0-based.txt.PlanarEmbed.out.txt
Petersen.0-based.txt.ColorVertices.out.txt
maxPlanar5.0-based.txt.ColorVertices.out.txt
Petersen.txt.K33Search.out.txt
.svn
maxPlanar5.txt.PlanarEmbed.out.txt
Petersen.txt.K23Search.out.txt
maxPlanar5.txt.ColorVertices.out.txt
Petersen.txt.OuterplanarEmbed.out.txt
Petersen.0-based.txt.OuterplanarEmbed.out.txt
Petersen.0-based.txt.K23Search.out.txt
Petersen.0-based.txt.K33Search.out.txt
drawExample.txt.DrawPlanar.out.txt.render.txt
maxPlanar5.0-based.txt.DrawPlanar.out.txt.render.txt
drawExample.0-based.txt.DrawPlanar.out.txt.render.txt
Petersen.txt
Petersen.0-based.txt
maxPlanar5.txt.DrawPlanar.out.txt.render.txt
Petersen.0-based.txt.K4Search.out.txt
drawExample.txt.DrawPlanar.out.txt
Petersen.txt.K4Search.out.txt
drawExample.txt
drawExample.txt.ColorVertices.out.txt
drawExample.0-based.txt.DrawPlanar.out.txt
maxPlanar5.0-based.txt
Petersen.txt.ColorVertices.out.txt
maxPlanar5.0-based.txt.PlanarEmbed.out.txt
drawExample.0-based.txt
maxPlanar5.0-based.txt.DrawPlanar.out.txt
maxPlanar5.txt.DrawPlanar.out.txt
drawExample.0-based.txt.ColorVertices.out.txt
maxPlanar5.txt
planarity.exe