Implementations of several planarity-related graph algorithms
354.00 KB
built 2026-10-17 04:48:40 GMT
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, 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 isolator,
and a number of subgraph homeomorphism search algorithms.
Dependencies
10 totalRequires7
- autoconf
- automake
- gcc
- libtool
- make
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
Provides3
- planarity = 5.0.0.0-2.fc45
- planarity-devel = 5.0.0.0-2.fc45
- planarity-samples = 5.0.0.0-2.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
2Name ![]() |
Size |
|---|---|
| planarity-5.0.0.0.tar.gz | 332.30 KB |
| planarity.spec | 7.90 KB |
Files 1–2 of 2
Component of
buildroots that installed this RPMNo Buildroots
