|
|||
|
|
|
|||
|
|
Algorithms for computing planar subgraphs. More...
Classes | |
| class | ogdf::MaximalPlanarSubgraphSimple< TCost, typename std::enable_if< std::is_integral< TCost >::value >::type > |
| Naive maximal planar subgraph approach that extends a configurable non-maximal subgraph heuristic. More... | |
| class | ogdf::MaximumPlanarSubgraph< TCost > |
| Exact computation of a maximum planar subgraph. More... | |
| class | ogdf::PlanarSubgraphBoyerMyrvold |
| Maximum planar subgraph heuristic based on the Boyer-Myrvold planarity test. More... | |
| class | ogdf::PlanarSubgraphCactus< TCost > |
| Maximum planar subgraph approximation algorithm by Calinescu et al. More... | |
| class | ogdf::PlanarSubgraphEmpty< TCost > |
| Dummy implementation for maximum planar subgraph that returns an empty graph. More... | |
| class | ogdf::PlanarSubgraphFast< TCost > |
| Computation of a planar subgraph using PQ-trees. More... | |
| class | ogdf::PlanarSubgraphTree< TCost > |
| Maximum planar subgraph heuristic that yields a spanning tree. More... | |
| class | ogdf::PlanarSubgraphTriangles< TCost > |
| Maximum planar subgraph approximation algorithms by Chalermsook/Schmid and Calinescu et al. More... | |
Algorithms for computing planar subgraphs.
