|
|||
|
|
|
|||
|
|
Classes | |
| class | EdgePairPartition |
| A partial solution for a 1-Planarity instance, representing a node in the backtracking tree. More... | |
| class | FreeEdgesDensityFilter |
| Rejects partial solutions for 1-Planarity if the crossable edges violate the density for 1-Planarity. More... | |
| class | OnePlanarityBacktracking |
| A backtracking implementation for the 1-Planarity problem. More... | |
| class | OnePlanarization |
| The graph corresponding to a partial solution for the 1-Planarity problem. More... | |
| class | OrderedPair |
| A pair of distinct graph elements, ordered by their index. More... | |
| class | PartialSolutionFilter |
| Interface of filters for partial solutions for 1-Planarity. More... | |
| class | PlanarizationDensityFilter |
| Rejects partial solutions for 1-Planarity if they are too dense. More... | |
| class | SaturatedSubgraphPlanarityFilter |
| Rejects partial solutions for 1-Planarity if the uncrossable edges induce a non-planar graph. More... | |
| class | SeparatingCycleFilter |
| Rejects partial solutions for 1-Planarity if a separating cycle with too few crossable edges is found. More... | |
Typedefs | |
| using | EdgePair = OrderedPair< edge > |
| using | VertexPair = OrderedPair< node > |
Enumerations | |
| enum class | OneplanMode { Normal , NIC , IC } |
| The different modes for 1-Planarity. More... | |
| using ogdf::oneplan_backtracking::EdgePair = typedef OrderedPair<edge> |
Definition at line 103 of file EdgePairPartition.h.
| using ogdf::oneplan_backtracking::VertexPair = typedef OrderedPair<node> |
Definition at line 102 of file EdgePairPartition.h.
|
strong |
The different modes for 1-Planarity.
| Enumerator | |
|---|---|
| Normal | 1-Planarity |
| NIC | 1-Planarity, where two crossed edge pairs may share at most one vertex (NIC-Planarity) |
| IC | 1-Planarity, where no two crossed edges may share a vertex (IC-Planarity) |
Definition at line 106 of file EdgePairPartition.h.
