#include <ogdf/upward/LayerBasedUPRLayout.h>
Public Member Functions | |
| OrderComparer (const UpwardPlanRep &_UPR, Hierarchy &_H) | |
| bool | less (node vH1, node vH2) const |
Private Member Functions | |
| void | dfs_LR (edge e, NodeArray< bool > &visited, NodeArray< int > &dfsNum, int &num) |
| bool | left (node vUPR1, List< edge > chain1, node vUPR2, List< edge > chain2) const |
| bool | left (edge e1UPR, edge e2UPR) const |
| bool | left (List< edge > &chain1, List< edge > &chain2, int level) const |
| bool | checkUp (node vUPR, int level) const |
Private Attributes | |
| const UpwardPlanRep & | UPR |
| Hierarchy & | H |
| NodeArray< int > | dfsNum |
| NodeArray< bool > | crossed |
Definition at line 62 of file LayerBasedUPRLayout.h.
| ogdf::OrderComparer::OrderComparer | ( | const UpwardPlanRep & | _UPR, |
| Hierarchy & | _H | ||
| ) |
| bool ogdf::OrderComparer::checkUp | ( | node | vUPR, |
| int | level | ||
| ) | const [private] |
| void ogdf::OrderComparer::dfs_LR | ( | edge | e, |
| NodeArray< bool > & | visited, | ||
| NodeArray< int > & | dfsNum, | ||
| int & | num | ||
| ) | [private] |
| bool ogdf::OrderComparer::left | ( | node | vUPR1, |
| List< edge > | chain1, | ||
| node | vUPR2, | ||
| List< edge > | chain2 | ||
| ) | const [private] |
| bool ogdf::OrderComparer::left | ( | edge | e1UPR, |
| edge | e2UPR | ||
| ) | const [private] |
| bool ogdf::OrderComparer::left | ( | List< edge > & | chain1, |
| List< edge > & | chain2, | ||
| int | level | ||
| ) | const [private] |
| bool ogdf::OrderComparer::less | ( | node | vH1, |
| node | vH2 | ||
| ) | const |
NodeArray<bool> ogdf::OrderComparer::crossed [mutable, private] |
Definition at line 75 of file LayerBasedUPRLayout.h.
NodeArray<int> ogdf::OrderComparer::dfsNum [private] |
Definition at line 73 of file LayerBasedUPRLayout.h.
Hierarchy& ogdf::OrderComparer::H [private] |
Definition at line 72 of file LayerBasedUPRLayout.h.
const UpwardPlanRep& ogdf::OrderComparer::UPR [private] |
Definition at line 71 of file LayerBasedUPRLayout.h.