Helper class for SeparatorDual and SeparatorDualFC. More...
#include <ogdf/graphalg/planar_separator/SeparatorDualHelper.h>
Classes | |
struct | CycleData |
Auxiliary lightweight data structure to represent cycles. More... | |
Public Member Functions | |
SeparatorDualHelper (std::shared_ptr< GraphCopy > pGraph, std::shared_ptr< BFSTree > pTree) | |
CycleData | dfs () |
Recursive Depth First Search over the faces of the dual of the graph. | |
List< std::pair< face, adjEntry > > | getUnmarkedNeighbours (face f, adjEntry adj) |
Finds all unmarked neighbours of a face. | |
CycleData | process (face f, adjEntry adj) |
Processes a face: One step of the recursion in the DFS. | |
Public Attributes | |
CombinatorialEmbedding | embedding |
std::shared_ptr< GraphCopy > | graph |
FaceArray< bool > | marked |
std::shared_ptr< BFSTree > | tree |
Helper class for SeparatorDual and SeparatorDualFC.
Definition at line 47 of file SeparatorDualHelper.h.
|
inline |
Definition at line 49 of file SeparatorDualHelper.h.
CycleData ogdf::planar_separator::SeparatorDualHelper::dfs | ( | ) |
Recursive Depth First Search over the faces of the dual of the graph.
List< std::pair< face, adjEntry > > ogdf::planar_separator::SeparatorDualHelper::getUnmarkedNeighbours | ( | face | f, |
adjEntry | adj | ||
) |
Finds all unmarked neighbours of a face.
f | the face to be examined |
adj | the adjEntry via which the face was entered |
Processes a face: One step of the recursion in the DFS.
f | the face to be processed |
adj | the adjEntry via which the face was entered |
CombinatorialEmbedding ogdf::planar_separator::SeparatorDualHelper::embedding |
Definition at line 206 of file SeparatorDualHelper.h.
std::shared_ptr<GraphCopy> ogdf::planar_separator::SeparatorDualHelper::graph |
Definition at line 202 of file SeparatorDualHelper.h.
Definition at line 207 of file SeparatorDualHelper.h.
std::shared_ptr<BFSTree> ogdf::planar_separator::SeparatorDualHelper::tree |
Definition at line 203 of file SeparatorDualHelper.h.