Interface for UML edge insertion algorithms.
More...
#include <ogdf/uml/UMLEdgeInsertionModule.h>
Interface for UML edge insertion algorithms.
UML edge insertion algorithms take care that generalization edges do not cross in the resulting planarzation.
- See also
- SubgraphPlanarizerUML
Definition at line 53 of file UMLEdgeInsertionModule.h.
◆ UMLEdgeInsertionModule() [1/2]
ogdf::UMLEdgeInsertionModule::UMLEdgeInsertionModule |
( |
| ) |
|
|
inline |
◆ UMLEdgeInsertionModule() [2/2]
◆ ~UMLEdgeInsertionModule()
virtual ogdf::UMLEdgeInsertionModule::~UMLEdgeInsertionModule |
( |
| ) |
|
|
inlinevirtual |
◆ call() [1/2]
Inserts all edges in origEdges
into pr
while avoiding crossings between generalizations.
- Parameters
-
pr | is the input planarized representation and will also receive the result. |
origEdges | is the array of original edges (edges in the original graph of pr ) that have to be inserted. |
- Returns
- the status of the result.
Definition at line 74 of file UMLEdgeInsertionModule.h.
◆ call() [2/2]
Inserts all edges in origEdges
with given costs into pr
while avoiding crossings between generalizations.
- Parameters
-
pr | is the input planarized representation and will also receive the result. |
costOrig | is an edge array containing the costs of original edges; edges in pr without an original edge have zero costs. |
origEdges | is the array of original edges (edges in the original graph of pr ) that have to be inserted. |
- Returns
- the status of the result.
Definition at line 86 of file UMLEdgeInsertionModule.h.
◆ callEx()
Inserts all edges in origEdges
into pr
while avoiding crossings between generalizations, optionally costs and subgraphs may be given.
- Parameters
-
pr | is the input planarized representation and will also receive the result. |
origEdges | is the array of original edges (edges in the original graph of pr ) that have to be inserted. |
pCostOrig | is an edge array containing the costs of original edges; edges in pr without an original edge have zero costs. May be a 0-pointer, in which case all edges have cost 1. |
pEdgeSubGraphs | points to an edge array specifying to which subgraph an edge belongs. May be a 0-poiner, in which case no subgraphs / simultaneous embedding is used. |
- Returns
- the status of the result.
Definition at line 101 of file UMLEdgeInsertionModule.h.
◆ clone()
◆ doCall()
Actual algorithm call that has to be implemented by derived classes.
- Parameters
-
pr | is the input planarized representation and will also receive the result. |
origEdges | is the array of original edges (edges in the original graph of pr ) that have to be inserted. |
pCostOrig | is an edge array containing the costs of original edges; edges in pr without an original edge have zero costs. May be a 0-pointer, in which case all edges have cost 1. |
pEdgeSubGraphs | points to an edge array specifying to which subgraph an edge belongs. May be a 0-poiner, in which case no subgraphs / simultaneous embedding is used. |
- Returns
- the status of the result.
Implemented in ogdf::FixedEmbeddingInserterUML, ogdf::VariableEmbeddingInserterDynUML, and ogdf::VariableEmbeddingInserterUML.
The documentation for this class was generated from the following file: