The local biconnected merger for multilevel layout.
More...
#include <ogdf/energybased/multilevel_mixer/LocalBiconnectedMerger.h>
|
bool | buildOneLevel (MultilevelGraph &MLG) override |
| Creates the next level in the hierarchy by merging vertices based on matching, edge cover, and local biconnectivity check.
|
|
bool | canMerge (Graph &G, node parent, node mergePartner) |
|
bool | canMerge (Graph &G, node parent, node mergePartner, int testStrength) |
|
bool | doMerge (MultilevelGraph &MLG, node parent, node mergePartner, int level) |
|
bool | doMergeIfPossible (Graph &G, MultilevelGraph &MLG, node parent, node mergePartner, int level) |
|
void | initCuts (Graph &G) |
|
int | realNodeMark (int index) |
|
The local biconnected merger for multilevel layout.
Definition at line 43 of file LocalBiconnectedMerger.h.
◆ LocalBiconnectedMerger()
ogdf::LocalBiconnectedMerger::LocalBiconnectedMerger |
( |
| ) |
|
◆ buildOneLevel()
Creates the next level in the hierarchy by merging vertices based on matching, edge cover, and local biconnectivity check.
Implements ogdf::MultilevelBuilder.
◆ canMerge() [1/2]
bool ogdf::LocalBiconnectedMerger::canMerge |
( |
Graph & |
G, |
|
|
node |
parent, |
|
|
node |
mergePartner |
|
) |
| |
|
private |
◆ canMerge() [2/2]
bool ogdf::LocalBiconnectedMerger::canMerge |
( |
Graph & |
G, |
|
|
node |
parent, |
|
|
node |
mergePartner, |
|
|
int |
testStrength |
|
) |
| |
|
private |
◆ doMerge()
◆ doMergeIfPossible()
◆ initCuts()
void ogdf::LocalBiconnectedMerger::initCuts |
( |
Graph & |
G | ) |
|
|
private |
◆ realNodeMark()
int ogdf::LocalBiconnectedMerger::realNodeMark |
( |
int |
index | ) |
|
|
private |
◆ setFactor()
void ogdf::LocalBiconnectedMerger::setFactor |
( |
double |
factor | ) |
|
Specifies the ratio between two consecutive level sizes up to which merging is done.
◆ m_isCut
◆ m_levelSizeFactor
double ogdf::LocalBiconnectedMerger::m_levelSizeFactor |
|
private |
◆ m_realNodeMarks
◆ m_substituteNodes
The documentation for this class was generated from the following file: