Common base for embedder algorithms based on BC trees. More...
#include <ogdf/planarity/embedder/EmbedderBCTreeBase.h>
Inheritance diagram for ogdf::embedder::EmbedderBCTreeBase< EnableLayers, IsEmbedderMinDepth >:Protected Member Functions | |
| node | initBCTree (Graph &G) |
Initializes pBCTree and returns the root node of this tree or nullptr if G is biconnected. | |
| virtual adjEntry | trivialInit (Graph &G) |
| Initialization code for biconnected input. Returns an adjacency entry that lies on the external face. | |
Protected Member Functions inherited from ogdf::EmbedderModule | |
| virtual void | doCall (Graph &G, adjEntry &adjExternal)=0 |
Calls the embedder algorithm for graph G. | |
Protected Attributes | |
| adjEntry * | pAdjExternal = nullptr |
| an adjacency entry on the external face | |
| BCTree * | pBCTree = nullptr |
| BC-tree of the original graph. | |
Protected Attributes inherited from ogdf::Timeouter | |
| double | m_timeLimit |
| Time limit for module calls (< 0 means no limit). | |
Private Types | |
| using | BicompEmbedder = typename std::conditional< EnableLayers, EmbedderMaxFaceBiconnectedGraphsLayers< int >, EmbedderMaxFaceBiconnectedGraphs< int > >::type |
Additional Inherited Members | |
Public Types inherited from ogdf::Module | |
| enum class | ReturnType { Feasible , Optimal , NoFeasibleSolution , TimeoutFeasible , TimeoutInfeasible , Error } |
| The return type of a module. More... | |
Public Member Functions inherited from ogdf::EmbedderModule | |
| EmbedderModule () | |
| Initializes an embedder module. | |
| virtual | ~EmbedderModule () |
| void | call (Graph &G, adjEntry &adjExternal) |
Calls the embedder algorithm for graph G. | |
| void | operator() (Graph &G, adjEntry &adjExternal) |
Calls the embedder algorithm for graph G. | |
Public Member Functions inherited from ogdf::Module | |
| Module () | |
| Initializes a module. | |
| virtual | ~Module () |
Public Member Functions inherited from ogdf::Timeouter | |
| Timeouter () | |
| timeout is turned of by default | |
| Timeouter (bool t) | |
| timeout is turned off (false) or on (true) (with 0 second) | |
| Timeouter (const Timeouter &t) | |
| Timeouter (double t) | |
| timeout is set to the given value (seconds) | |
| ~Timeouter () | |
| bool | isTimeLimit () const |
| returns whether any time limit is set or not | |
| Timeouter & | operator= (const Timeouter &t) |
| double | timeLimit () const |
| returns the current time limit for the call | |
| void | timeLimit (bool t) |
| shorthand to turn timelimit off or on (with 0 seconds) | |
| void | timeLimit (double t) |
| sets the time limit for the call (in seconds); <0 means no limit. | |
Static Public Member Functions inherited from ogdf::Module | |
| static bool | isSolution (ReturnType ret) |
Returns true iff ret indicates that the module returned a feasible solution. | |
Common base for embedder algorithms based on BC trees.
Definition at line 49 of file EmbedderBCTreeBase.h.
|
private |
Definition at line 50 of file EmbedderBCTreeBase.h.
|
inlineprotected |
Initializes pBCTree and returns the root node of this tree or nullptr if G is biconnected.
Definition at line 73 of file EmbedderBCTreeBase.h.
|
inlineprotectedvirtual |
Initialization code for biconnected input. Returns an adjacency entry that lies on the external face.
Reimplemented in ogdf::EmbedderMaxFaceLayers, and ogdf::EmbedderMinDepthPiTa.
Definition at line 62 of file EmbedderBCTreeBase.h.
|
protected |
an adjacency entry on the external face
Definition at line 58 of file EmbedderBCTreeBase.h.
|
protected |
BC-tree of the original graph.
Definition at line 55 of file EmbedderBCTreeBase.h.