Base class for UML crossing minimization algorithms.
More...
#include <ogdf/uml/UMLCrossingMinimizationModule.h>
Base class for UML crossing minimization algorithms.
Definition at line 41 of file UMLCrossingMinimizationModule.h.
◆ UMLCrossingMinimizationModule() [1/2]
ogdf::UMLCrossingMinimizationModule::UMLCrossingMinimizationModule 
( 
 ) 


inline 
◆ UMLCrossingMinimizationModule() [2/2]
◆ ~UMLCrossingMinimizationModule()
virtual ogdf::UMLCrossingMinimizationModule::~UMLCrossingMinimizationModule 
( 
 ) 


inlinevirtual 
◆ call()
ReturnType ogdf::UMLCrossingMinimizationModule::call 
( 
PlanRepUML & 
prUML, 


int 
cc, 


int & 
crossingNumber, 


const EdgeArray< int > * 
pCostOrig = nullptr 

) 
 

inline 
Computes a planarized representation of the input graph.
 Parameters

prUML  represents the input graph as well as the computed planarized representation after the call. prUML has to be initialzed as a PlanRep of the input graph and is modified to obatain the planarized representation (crossings are replaced by dummy vertices with degree four). 
cc  is the index of the connected component in prUML that is considered. 
crossingNumber  is assigned the number of crossings. 
pCostOrig  points to an edge array (of the original graph) that gives the cost of each edge. May be a 0pointer, in which case all edges have cost 1. 
 Returns
 the status of the result.
Definition at line 67 of file UMLCrossingMinimizationModule.h.
◆ checkCrossingGens()
static bool ogdf::UMLCrossingMinimizationModule::checkCrossingGens 
( 
const PlanRepUML & 
prUML  ) 


static 
Checks if the planarized represenation contains crossing generalizations.
◆ clone()
Returns a new instance of the UML crossing minimization module with the same option settings.
Implemented in ogdf::SubgraphPlanarizerUML.
◆ doCall()
virtual ReturnType ogdf::UMLCrossingMinimizationModule::doCall 
( 
PlanRepUML & 
prUML, 


int 
cc, 


const EdgeArray< int > * 
pCostOrig, 


int & 
crossingNumber 

) 
 

protectedpure virtual 
Actual algorithm call that needs to be implemented by derived classes.
 Parameters

prUML  represents the input graph as well as the computed planarized representation after the call. prUML has to be initialzed as a PlanRep of the input graph and is modified to obatain the planarized representation (crossings are replaced by dummy vertices with degree four). 
cc  is the index of the connected component in prUML that is considered. 
crossingNumber  is assigned the number of crossings. 
pCostOrig  points to an edge array (of the original graph) that gives the cost of each edge. May be a 0pointer, in which case all edges have cost 1. 
 Returns
 the status of the result.
Implemented in ogdf::SubgraphPlanarizerUML.
◆ operator()()
ReturnType ogdf::UMLCrossingMinimizationModule::operator() 
( 
PlanRepUML & 
prUML, 


int 
cc, 


int & 
crossingNumber, 


const EdgeArray< int > * 
pCostOrig = nullptr 

) 
 

inline 
Computes a planarized representation of the input graph.
 Parameters

prUML  represents the input graph as well as the computed planarized representation after the call. prUML has to be initialzed as a PlanRep of the input graph and is modified to obatain the planarized representation (crossings are replaced by dummy vertices with degree four). 
cc  is the index of the connected component in prUML that is considered. 
crossingNumber  is assigned the number of crossings. 
pCostOrig  points to an edge array (of the original graph) that gives the cost of each edge. May be a 0pointer, in which case all edges have cost 1. 
 Returns
 the status of the result.
Definition at line 84 of file UMLCrossingMinimizationModule.h.
The documentation for this class was generated from the following file: