Manages the matching of P-nodes via pipes in an instance of SyncPlan.
More...
#include <ogdf/cluster/sync_plan/PMatching.h>
Manages the matching of P-nodes via pipes in an instance of SyncPlan.
Definition at line 86 of file PMatching.h.
◆ PMatching()
ogdf::sync_plan::PMatching::PMatching |
( |
const Graph * |
G | ) |
|
|
inlineexplicit |
◆ begin()
List<Pipe>::const_iterator ogdf::sync_plan::PMatching::begin |
( |
| ) |
const |
◆ cleared()
void ogdf::sync_plan::PMatching::cleared |
( |
| ) |
|
|
inlineoverrideprotectedvirtual |
Called by watched graph when its clear function is called, just before things are removed.
Implements ogdf::GraphObserver.
Definition at line 166 of file PMatching.h.
◆ edgeAdded()
void ogdf::sync_plan::PMatching::edgeAdded |
( |
edge |
e | ) |
|
|
inlineoverrideprotectedvirtual |
◆ edgeDeleted()
void ogdf::sync_plan::PMatching::edgeDeleted |
( |
edge |
e | ) |
|
|
inlineoverrideprotectedvirtual |
◆ end()
List<Pipe>::const_iterator ogdf::sync_plan::PMatching::end |
( |
| ) |
const |
◆ getIncidentEdgeBijection() [1/4]
PipeBijRange ogdf::sync_plan::PMatching::getIncidentEdgeBijection |
( |
node |
u | ) |
const |
Get the bijection between the edges incident to the two endpoints of a pipe.
◆ getIncidentEdgeBijection() [2/4]
◆ getIncidentEdgeBijection() [3/4]
void ogdf::sync_plan::PMatching::getIncidentEdgeBijection |
( |
node |
u, |
|
|
EdgeArray< edge > & |
out |
|
) |
| const |
◆ getIncidentEdgeBijection() [4/4]
void ogdf::sync_plan::PMatching::getIncidentEdgeBijection |
( |
node |
u, |
|
|
PipeBij & |
out |
|
) |
| const |
◆ getPipe()
const Pipe* ogdf::sync_plan::PMatching::getPipe |
( |
node |
n | ) |
const |
◆ getPipeCount()
int ogdf::sync_plan::PMatching::getPipeCount |
( |
| ) |
const |
◆ getPipeQueue()
PipeQueue* ogdf::sync_plan::PMatching::getPipeQueue |
( |
| ) |
const |
|
inline |
◆ getPipes()
const List<Pipe>& ogdf::sync_plan::PMatching::getPipes |
( |
| ) |
const |
◆ getPriorityPipeCount()
int ogdf::sync_plan::PMatching::getPriorityPipeCount |
( |
| ) |
const |
|
inline |
◆ getTopPipe()
const Pipe& ogdf::sync_plan::PMatching::getTopPipe |
( |
| ) |
const |
◆ getTwin()
node ogdf::sync_plan::PMatching::getTwin |
( |
node |
n | ) |
const |
For a matched vertex, return the vertex it is matched with.
◆ getTwinOrNull()
node ogdf::sync_plan::PMatching::getTwinOrNull |
( |
node |
n | ) |
const |
◆ isMatchedPVertex()
bool ogdf::sync_plan::PMatching::isMatchedPVertex |
( |
node |
n | ) |
const |
◆ isReduced()
bool ogdf::sync_plan::PMatching::isReduced |
( |
| ) |
const |
Whether there are no pipes left.
◆ makePriority()
void ogdf::sync_plan::PMatching::makePriority |
( |
node |
n | ) |
|
Mark the pipe of this ndoe to be processed before all other pipes, no matter the order in the PipeQueue.
◆ matchNodes()
void ogdf::sync_plan::PMatching::matchNodes |
( |
node |
f, |
|
|
node |
s |
|
) |
| |
◆ nodeAdded()
void ogdf::sync_plan::PMatching::nodeAdded |
( |
node |
v | ) |
|
|
inlineoverrideprotectedvirtual |
◆ nodeDeleted()
void ogdf::sync_plan::PMatching::nodeDeleted |
( |
node |
v | ) |
|
|
overrideprotectedvirtual |
◆ printBijection()
std::function<std::ostream&(std::ostream&)> ogdf::sync_plan::PMatching::printBijection |
( |
node |
u | ) |
const |
◆ rebuildHeap()
void ogdf::sync_plan::PMatching::rebuildHeap |
( |
| ) |
|
Rebuild the PipeQueue, e.g. after priorities were changed externally.
◆ removeMatching()
node ogdf::sync_plan::PMatching::removeMatching |
( |
node |
n, |
|
|
node |
t = nullptr |
|
) |
| |
◆ setPipeQueue() [1/2]
void ogdf::sync_plan::PMatching::setPipeQueue |
( |
PipeQueue * |
q | ) |
|
|
inline |
◆ setPipeQueue() [2/2]
void ogdf::sync_plan::PMatching::setPipeQueue |
( |
std::unique_ptr< PipeQueue > |
q | ) |
|
|
inline |
◆ translateIncidentEdge()
◆ SyncPlanConsistency
◆ nodes
◆ pipes_list
List<Pipe> ogdf::sync_plan::PMatching::pipes_list |
|
private |
◆ priority_pipes
int ogdf::sync_plan::PMatching::priority_pipes = 0 |
|
private |
◆ queue
std::unique_ptr<PipeQueue> ogdf::sync_plan::PMatching::queue |
|
private |
The documentation for this class was generated from the following file: