Information for RPM planarity-3.0.0.5-7.fc33.src.rpm
| ID | 694230 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Name | planarity | ||||||||||
| Version | 3.0.0.5 | ||||||||||
| Release | 7.fc33 | ||||||||||
| Epoch | |||||||||||
| Arch | src | ||||||||||
| Summary | Implementations of several planarity-related graph algorithms | ||||||||||
| 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. | ||||||||||
| Build Time | 2020-08-14 22:40:56 GMT | ||||||||||
| Size | 170.68 KB | ||||||||||
| c0b1487097ebbb4f90ba282caffcad89 | |||||||||||
| License | BSD | ||||||||||
| Buildroot | f33-build-298515-56143 | ||||||||||
| Provides |
|
||||||||||
| Obsoletes | No Obsoletes | ||||||||||
| Conflicts | No Conflicts | ||||||||||
| Requires |
|
||||||||||
| Recommends | No Recommends | ||||||||||
| Suggests | No Suggests | ||||||||||
| Supplements | No Supplements | ||||||||||
| Enhances | No Enhances | ||||||||||
| Files |
|
||||||||||
| Component of | No Buildroots | ||||||||||
