Helper class for SeparatorDual and SeparatorDualFC.
More...
#include <ogdf/graphalg/planar_separator/SeparatorDualHelper.h>
|
struct | CycleData |
| Auxiliary lightweight data structure to represent cycles. More...
|
|
Helper class for SeparatorDual and SeparatorDualFC.
Definition at line 47 of file SeparatorDualHelper.h.
◆ SeparatorDualHelper()
ogdf::planar_separator::SeparatorDualHelper::SeparatorDualHelper |
( |
std::shared_ptr< GraphCopy > |
pGraph, |
|
|
std::shared_ptr< BFSTree > |
pTree |
|
) |
| |
|
inline |
◆ dfs()
CycleData ogdf::planar_separator::SeparatorDualHelper::dfs |
( |
| ) |
|
Recursive Depth First Search over the faces of the dual of the graph.
- Returns
- a data structure that holds information on the cycle
◆ getUnmarkedNeighbours()
Finds all unmarked neighbours of a face.
- Parameters
-
f | the face to be examined |
adj | the adjEntry via which the face was entered |
- Returns
- a list containing the unmarked neighbouring faces and the entries that lead to them
◆ process()
Processes a face: One step of the recursion in the DFS.
- Parameters
-
f | the face to be processed |
adj | the adjEntry via which the face was entered |
- Returns
- the next CycleData
◆ embedding
◆ graph
std::shared_ptr<GraphCopy> ogdf::planar_separator::SeparatorDualHelper::graph |
◆ marked
FaceArray<bool> ogdf::planar_separator::SeparatorDualHelper::marked |
◆ tree
std::shared_ptr<BFSTree> ogdf::planar_separator::SeparatorDualHelper::tree |
The documentation for this class was generated from the following file: