#include <ogdf/planarity/embedding_inserter/FixEdgeInserterCore.h>
|
virtual void | appendCandidates (Array< SListPure< edge >> &nodesAtDist, EdgeArray< int > &costDual, int maxCost, node v, int currentDist) |
|
virtual void | appendCandidates (QueuePure< edge > &queue, node v) |
|
virtual void | cleanup () |
|
virtual void | constructDual (const CombinatorialEmbedding &E) |
|
int | costCrossed (edge eOrig) const |
|
void | findShortestPath (const CombinatorialEmbedding &E, edge eOrig, SList< adjEntry > &crossed) |
|
void | findWeightedShortestPath (const CombinatorialEmbedding &E, edge eOrig, SList< adjEntry > &crossed) |
|
int | getCost (edge e, int stSubGraph) const |
|
virtual void | init (CombinatorialEmbedding &E) |
|
void | insertEdge (CombinatorialEmbedding &E, edge eOrig, const SList< adjEntry > &crossed) |
|
virtual void | insertEdgesIntoDual (const CombinatorialEmbedding &E, adjEntry adjSrc) |
|
virtual void | insertEdgesIntoDualAfterRemove (const CombinatorialEmbedding &E, face f) |
|
void | removeEdge (CombinatorialEmbedding &E, edge eOrig) |
|
virtual void | storeTypeOfCurrentEdge (edge eOrig) |
|
Definition at line 45 of file FixEdgeInserterCore.h.
◆ FixEdgeInserterCore()
◆ ~FixEdgeInserterCore()
virtual ogdf::FixEdgeInserterCore::~FixEdgeInserterCore |
( |
| ) |
|
|
inlinevirtual |
◆ appendCandidates() [1/2]
virtual void ogdf::FixEdgeInserterCore::appendCandidates |
( |
Array< SListPure< edge >> & |
nodesAtDist, |
|
|
EdgeArray< int > & |
costDual, |
|
|
int |
maxCost, |
|
|
node |
v, |
|
|
int |
currentDist |
|
) |
| |
|
protectedvirtual |
◆ appendCandidates() [2/2]
virtual void ogdf::FixEdgeInserterCore::appendCandidates |
( |
QueuePure< edge > & |
queue, |
|
|
node |
v |
|
) |
| |
|
protectedvirtual |
◆ call()
◆ cleanup()
virtual void ogdf::FixEdgeInserterCore::cleanup |
( |
| ) |
|
|
protectedvirtual |
◆ constructDual()
◆ costCrossed()
int ogdf::FixEdgeInserterCore::costCrossed |
( |
edge |
eOrig | ) |
const |
|
protected |
◆ findShortestPath()
◆ findWeightedShortestPath()
◆ getCost()
int ogdf::FixEdgeInserterCore::getCost |
( |
edge |
e, |
|
|
int |
stSubGraph |
|
) |
| const |
|
protected |
◆ init()
◆ insertEdge()
◆ insertEdgesIntoDual()
◆ insertEdgesIntoDualAfterRemove()
◆ removeEdge()
◆ runsPostprocessing()
int ogdf::FixEdgeInserterCore::runsPostprocessing |
( |
| ) |
const |
|
inline |
◆ storeTypeOfCurrentEdge()
virtual void ogdf::FixEdgeInserterCore::storeTypeOfCurrentEdge |
( |
edge |
eOrig | ) |
|
|
inlineprotectedvirtual |
◆ m_delFaces
FaceSet<false>* ogdf::FixEdgeInserterCore::m_delFaces |
|
protected |
◆ m_dual
Graph ogdf::FixEdgeInserterCore::m_dual |
|
protected |
◆ m_newFaces
FaceSet<false>* ogdf::FixEdgeInserterCore::m_newFaces |
|
protected |
◆ m_nodeOf
◆ m_pCost
const EdgeArray<int>* ogdf::FixEdgeInserterCore::m_pCost |
|
protected |
◆ m_pForbidden
const EdgeArray<bool>* ogdf::FixEdgeInserterCore::m_pForbidden |
|
protected |
◆ m_pr
◆ m_primalAdj
Adjacency entry in primal graph corresponding to edge in dual.
Definition at line 89 of file FixEdgeInserterCore.h.
◆ m_pSubgraph
const EdgeArray<uint32_t>* ogdf::FixEdgeInserterCore::m_pSubgraph |
|
protected |
◆ m_runsPostprocessing
int ogdf::FixEdgeInserterCore::m_runsPostprocessing |
|
protected |
◆ m_vS
node ogdf::FixEdgeInserterCore::m_vS |
|
protected |
◆ m_vT
node ogdf::FixEdgeInserterCore::m_vT |
|
protected |
The documentation for this class was generated from the following file: