Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

Algorithms for inserting edges or stars into planar graphs with few crossings. More...

Classes

class  ogdf::FixedEmbeddingInserter
 Inserts edges optimally into an embedding. More...
 
class  ogdf::MMFixedEmbeddingInserter
 Minor-monotone edge insertion with fixed embedding. More...
 
class  ogdf::MMVariableEmbeddingInserter
 Minor-monotone edge insertion with variable embedding. More...
 
class  ogdf::MultiEdgeApproxInserter
 Multi edge inserter with approximation guarantee. More...
 
class  ogdf::StarInserter
 
class  ogdf::VariableEmbeddingInserter
 Optimal edge insertion module. More...
 
class  ogdf::VariableEmbeddingInserterDyn
 Optimal edge insertion module. More...
 

Enumerations

enum  ogdf::RemoveReinsertType { ogdf::RemoveReinsertType::None, ogdf::RemoveReinsertType::Inserted, ogdf::RemoveReinsertType::MostCrossed, ogdf::RemoveReinsertType::All, ogdf::RemoveReinsertType::Incremental, ogdf::RemoveReinsertType::IncInserted }
 The postprocessing method for edge insertion algorithms. More...
 

Detailed Description

Algorithms for inserting edges or stars into planar graphs with few crossings.

Enumeration Type Documentation

◆ RemoveReinsertType

The postprocessing method for edge insertion algorithms.

Enumerator
None 

No postprocessing.

Inserted 

Postprocessing only with the edges that have to be inserted.

MostCrossed 

Postprocessing with the edges involved in the most crossings.

All 

Postproceesing with all edges.

Incremental 

Full postprocessing after each edge insertion.

IncInserted 

Postprocessing for (so far) inserted edges after each edge insertion.

Definition at line 41 of file RemoveReinsertType.h.