List of all members.
Public Types |
| enum | NodeType {
ntNode,
ntClusterTop,
ntClusterBottom,
ntDummy,
ntClusterTopBottom
} |
| | The type of nodes.
More...
|
Public Member Functions |
| | ExtendedNestingGraph (const ClusterGraph &CG) |
| const ClusterGraphCopy & | getClusterGraph () const |
| const ClusterGraph & | getOriginalClusterGraph () const |
| node | copy (node v) const |
| node | top (cluster cOrig) const |
| node | bottom (cluster cOrig) const |
| int | topRank (cluster c) const |
| int | bottomRank (cluster c) const |
| NodeType | type (node v) const |
| node | origNode (node v) const |
| edge | origEdge (edge e) const |
| cluster | originalCluster (node v) const |
| cluster | parent (node v) const |
| cluster | parent (cluster c) const |
| bool | isVirtual (cluster c) const |
| const List< edge > & | chain (edge e) const |
| bool | isReversed (edge e) const |
| bool | isLongEdgeDummy (node v) const |
| bool | verticalSegment (edge e) const |
| int | numberOfLayers () const |
| int | rank (node v) const |
| int | pos (node v) const |
| const LHTreeNode * | layerHierarchyTree (int i) const |
| const ENGLayer & | layer (int i) const |
| RCCrossings | reduceCrossings (int i, bool dirTopDown) |
| void | storeCurrentPos () |
| void | restorePos () |
| void | permute () |
| void | removeTopBottomEdges () |
| int | aeLevel (node v) const |
Protected Member Functions |
| cluster | lca (node u, node v) const |
| LHTreeNode * | lca (LHTreeNode *uNode, LHTreeNode *vNode, LHTreeNode **uChild, LHTreeNode **vChild) const |
| edge | addEdge (node u, node v, bool addAlways=false) |
| void | assignAeLevel (cluster c, int &count) |
| bool | reachable (node v, node u, SListPure< node > &successors) |
| bool | tryEdge (node u, node v, Graph &G, NodeArray< int > &level) |
| RCCrossings | reduceCrossings (LHTreeNode *cNode, bool dirTopDown) |
| void | assignPos (const LHTreeNode *vNode, int &count) |
Private Member Functions |
| void | computeRanking () |
| void | createDummyNodes () |
| void | createVirtualClusters () |
| void | createVirtualClusters (cluster c, NodeArray< node > &vCopy, ClusterArray< node > &cCopy) |
| void | buildLayers () |
| void | removeAuxNodes () |
Private Attributes |
| ClusterGraphCopy | m_CGC |
| NodeArray< node > | m_copy |
| NodeArray< node > | m_origNode |
| ClusterArray< node > | m_topNode |
| ClusterArray< node > | m_bottomNode |
| ClusterArray< int > | m_topRank |
| ClusterArray< int > | m_bottomRank |
| NodeArray< NodeType > | m_type |
| EdgeArray< List< edge > > | m_copyEdge |
| EdgeArray< edge > | m_origEdge |
| NodeArray< int > | m_rank |
| int | m_numLayers |
| Array< ENGLayer > | m_layer |
| NodeArray< int > | m_pos |
| EdgeArray< bool > | m_vertical |
| NodeArray< int > | m_aeLevel |
| NodeArray< bool > | m_aeVisited |
| ClusterArray< cluster > | m_mark |
| SListPure< cluster > | m_markedClusters |
| cluster | m_secondPath |
| node | m_secondPathTo |
| SListPure< cluster > | m_markedClustersTree |
| ClusterArray< LHTreeNode * > | m_markTree |
Detailed Description
Definition at line 332 of file ExtendedNestingGraph.h.
Member Enumeration Documentation
The type of nodes.
- Enumerator:
| ntNode |
|
| ntClusterTop |
|
| ntClusterBottom |
|
| ntDummy |
|
| ntClusterTopBottom |
|
Reimplemented from ogdf::Graph.
Definition at line 336 of file ExtendedNestingGraph.h.
Constructor & Destructor Documentation
| ogdf::ExtendedNestingGraph::ExtendedNestingGraph |
( |
const ClusterGraph & |
CG |
) |
|
Member Function Documentation
| edge ogdf::ExtendedNestingGraph::addEdge |
( |
node |
u, |
|
|
node |
v, |
|
|
bool |
addAlways = false | |
|
) |
| | [protected] |
| int ogdf::ExtendedNestingGraph::aeLevel |
( |
node |
v |
) |
const [inline] |
| void ogdf::ExtendedNestingGraph::assignAeLevel |
( |
cluster |
c, |
|
|
int & |
count | |
|
) |
| | [protected] |
| void ogdf::ExtendedNestingGraph::assignPos |
( |
const LHTreeNode * |
vNode, |
|
|
int & |
count | |
|
) |
| | [protected] |
| node ogdf::ExtendedNestingGraph::bottom |
( |
cluster |
cOrig |
) |
const [inline] |
| int ogdf::ExtendedNestingGraph::bottomRank |
( |
cluster |
c |
) |
const [inline] |
| void ogdf::ExtendedNestingGraph::buildLayers |
( |
|
) |
[private] |
| const List<edge>& ogdf::ExtendedNestingGraph::chain |
( |
edge |
e |
) |
const [inline] |
| void ogdf::ExtendedNestingGraph::computeRanking |
( |
|
) |
[private] |
| node ogdf::ExtendedNestingGraph::copy |
( |
node |
v |
) |
const [inline] |
| void ogdf::ExtendedNestingGraph::createDummyNodes |
( |
|
) |
[private] |
| void ogdf::ExtendedNestingGraph::createVirtualClusters |
( |
|
) |
[private] |
| const ClusterGraphCopy& ogdf::ExtendedNestingGraph::getClusterGraph |
( |
|
) |
const [inline] |
| const ClusterGraph& ogdf::ExtendedNestingGraph::getOriginalClusterGraph |
( |
|
) |
const [inline] |
| bool ogdf::ExtendedNestingGraph::isLongEdgeDummy |
( |
node |
v |
) |
const [inline] |
| bool ogdf::ExtendedNestingGraph::isReversed |
( |
edge |
e |
) |
const [inline] |
| bool ogdf::ExtendedNestingGraph::isVirtual |
( |
cluster |
c |
) |
const [inline] |
| const ENGLayer& ogdf::ExtendedNestingGraph::layer |
( |
int |
i |
) |
const [inline] |
| const LHTreeNode* ogdf::ExtendedNestingGraph::layerHierarchyTree |
( |
int |
i |
) |
const [inline] |
| cluster ogdf::ExtendedNestingGraph::lca |
( |
node |
u, |
|
|
node |
v | |
|
) |
| | const [protected] |
| int ogdf::ExtendedNestingGraph::numberOfLayers |
( |
|
) |
const [inline] |
| edge ogdf::ExtendedNestingGraph::origEdge |
( |
edge |
e |
) |
const [inline] |
| cluster ogdf::ExtendedNestingGraph::originalCluster |
( |
node |
v |
) |
const [inline] |
| node ogdf::ExtendedNestingGraph::origNode |
( |
node |
v |
) |
const [inline] |
| cluster ogdf::ExtendedNestingGraph::parent |
( |
node |
v |
) |
const [inline] |
| cluster ogdf::ExtendedNestingGraph::parent |
( |
cluster |
c |
) |
const [inline] |
| void ogdf::ExtendedNestingGraph::permute |
( |
|
) |
|
| int ogdf::ExtendedNestingGraph::pos |
( |
node |
v |
) |
const [inline] |
| int ogdf::ExtendedNestingGraph::rank |
( |
node |
v |
) |
const [inline] |
| bool ogdf::ExtendedNestingGraph::reachable |
( |
node |
v, |
|
|
node |
u, |
|
|
SListPure< node > & |
successors | |
|
) |
| | [protected] |
| RCCrossings ogdf::ExtendedNestingGraph::reduceCrossings |
( |
LHTreeNode * |
cNode, |
|
|
bool |
dirTopDown | |
|
) |
| | [protected] |
| RCCrossings ogdf::ExtendedNestingGraph::reduceCrossings |
( |
int |
i, |
|
|
bool |
dirTopDown | |
|
) |
| | |
| void ogdf::ExtendedNestingGraph::removeAuxNodes |
( |
|
) |
[private] |
| void ogdf::ExtendedNestingGraph::removeTopBottomEdges |
( |
|
) |
|
| void ogdf::ExtendedNestingGraph::restorePos |
( |
|
) |
|
| void ogdf::ExtendedNestingGraph::storeCurrentPos |
( |
|
) |
|
| node ogdf::ExtendedNestingGraph::top |
( |
cluster |
cOrig |
) |
const [inline] |
| int ogdf::ExtendedNestingGraph::topRank |
( |
cluster |
c |
) |
const [inline] |
| NodeType ogdf::ExtendedNestingGraph::type |
( |
node |
v |
) |
const [inline] |
| bool ogdf::ExtendedNestingGraph::verticalSegment |
( |
edge |
e |
) |
const [inline] |
Member Data Documentation
The documentation for this class was generated from the following file:
