|
|||
|
|
|
|||
|
|
Heuristics and optimal algorithms for crossing minimization. More...
Classes | |
| class | ogdf::MMSubgraphPlanarizer |
| Planarization approach for minor-monotone crossing minimization. More... | |
| class | ogdf::PlanarizerChordlessCycle |
| Starts with a chordless cycle of the graph and then inserts each original node that is adjacent to already inserted ones via the StarInserter. More... | |
| class | ogdf::PlanarizerMixedInsertion |
| Computes a planar subgraph of the graph and then re-inserts each original node that is incident to at least one edge not in the subgraph via the StarInserter. More... | |
| class | ogdf::PlanarizerStarReinsertion |
| The star (re-)insertion approach for crossing minimization. More... | |
| class | ogdf::SubgraphPlanarizer |
| The planarization approach for crossing minimization. More... | |
Heuristics and optimal algorithms for crossing minimization.
