This class represents a triple used by various contraction-based minimum Steiner tree approximations. More...
#include <ogdf/graphalg/steiner_tree/common_algorithms.h>
Public Member Functions | |
Triple (const node s0=nullptr, const node s1=nullptr, const node s2=nullptr, const node z=nullptr, T cost=0, double win=0) | |
T | cost () const |
void | cost (T c) |
node | s0 () const |
void | s0 (node u) |
node | s1 () const |
void | s1 (node u) |
node | s2 () const |
void | s2 (node u) |
double | win () const |
void | win (double w) |
node | z () const |
void | z (node u) |
Private Attributes | |
T | m_cost |
edge costs of the triple in the original graph More... | |
node | m_s0 |
node | m_s1 |
node | m_s2 |
terminal nodes More... | |
double | m_win |
the win of the triple at some point of time (used as cache) More... | |
node | m_z |
center node of the triple More... | |
This class represents a triple used by various contraction-based minimum Steiner tree approximations.
Definition at line 48 of file common_algorithms.h.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
private |
|
private |
|
private |
|
private |
|
private |
|
private |