Open
Graph Drawing
Framework

  v. 2023.09 (Elderberry)
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files

ogdf::pc_tree::NodePCRotation Member List

This is the complete list of members for ogdf::pc_tree::NodePCRotation, including all inherited members.

addObserver(Observer *observer)ogdf::pc_tree::PCTreeinline
addPartialNode(PCNode *partial)ogdf::pc_tree::PCTreeprivate
allNodes() constogdf::pc_tree::PCTreeinline
changeNodeType(PCNode *node, PCNodeType newType)ogdf::pc_tree::PCTree
changeRoot(PCNode *newRoot)ogdf::pc_tree::PCTree
checkTPPartialCNode(PCNode *node)ogdf::pc_tree::PCTreeprivate
checkValid(bool allow_small_deg=true) constogdf::pc_tree::PCTree
createCentralNode()ogdf::pc_tree::PCTreeprivate
currentLeafOrder(Container &container) constogdf::pc_tree::PCTreeinline
currentLeafOrder() constogdf::pc_tree::PCTreeinline
destroyLeaf(PCNode *leaf)ogdf::pc_tree::PCTree
destroyNode(PCNode *&node)ogdf::pc_tree::PCTreeinline
destroyNode(PCNode *const &node)ogdf::pc_tree::PCTree
findEndOfFullBlock(PCNode *node, PCNode *pred, PCNode *curr, PCNode *&fullEnd, PCNode *&emptyEnd) constogdf::pc_tree::PCTreeprivate
findNodeRestrictions(PCTree &applyTo, PCTreeNodeArray< PCNode * > &mapping, PCTreeNodeArray< std::vector< PCNode * >> &blockNodes, PCTreeNodeArray< std::vector< PCNode * >> &subtreeNodes, PCTreeNodeArray< PCNode * > &leafPartner, PCTreeNodeArray< bool > &isFront)ogdf::pc_tree::PCTreeprivate
findTerminalPath()ogdf::pc_tree::PCTreeprivate
FullLeafIter typedefogdf::pc_tree::PCTree
generateInnerNodeForGraphNodeMapping(NodeArray< PCNode * > &mapping) constogdf::pc_tree::NodePCRotationinline
generateLeafForIncidentEdgeMapping(EdgeArray< PCNode * > &mapping) constogdf::pc_tree::NodePCRotationinline
generatePartnerEdgesForIncidentEdge(EdgeArray< const List< edge > * > &mapping) constogdf::pc_tree::NodePCRotationinline
getCNodeCount() constogdf::pc_tree::PCTreeinline
getForest() constogdf::pc_tree::PCTreeinline
getGraph() constogdf::pc_tree::NodePCRotationinline
getGraphNodeForInnerNode(PCNode *n) constogdf::pc_tree::NodePCRotationinline
getIncidentEdgeForLeaf(PCNode *n) constogdf::pc_tree::NodePCRotationinline
getLeafCount() constogdf::pc_tree::PCTreeinline
getLeaves() constogdf::pc_tree::PCTreeinline
getNode() constogdf::pc_tree::NodePCRotationinline
getPartnerEdgesForLeaf(PCNode *l) constogdf::pc_tree::NodePCRotationinline
getPNodeCount() constogdf::pc_tree::PCTreeinline
getRestrictions(std::vector< std::vector< PCNode * >> &restrictions, PCNode *fixedLeaf=nullptr) constogdf::pc_tree::PCTree
getRootNode() constogdf::pc_tree::PCTreeinline
getTerminalPathLength() constogdf::pc_tree::PCTreeinline
getTree(ogdf::Graph &tree, ogdf::GraphAttributes *g_a, PCTreeNodeArray< ogdf::node > &pc_repr, ogdf::NodeArray< PCNode * > *g_repr=nullptr, bool mark_full=false, bool show_sibs=false) constogdf::pc_tree::PCTree
getTrivialPartnerPole(const Graph &G, node n)ogdf::pc_tree::NodePCRotationstatic
getTrivialPartnerPole() constogdf::pc_tree::NodePCRotation
innerNodes() constogdf::pc_tree::PCTreeinline
insertLeaves(int count, PCNode *parent, std::vector< PCNode * > *added=nullptr)ogdf::pc_tree::PCTree
insertTree(PCNode *at, PCTree *tree)ogdf::pc_tree::PCTree
intersect(PCTree &other, PCTreeNodeArray< PCNode * > &mapping)ogdf::pc_tree::PCTree
isEqual(const NodePCRotation &pc) constogdf::pc_tree::NodePCRotation
isTrivial() constogdf::pc_tree::PCTree
isTrivialRestriction(int size) constogdf::pc_tree::PCTree
isValidOrder(const std::vector< PCNode * > &order) constogdf::pc_tree::PCTree
knowsPartnerEdges() constogdf::pc_tree::NodePCRotationinline
m_apexCandidateogdf::pc_tree::PCTreeprivate
m_apexCandidateIsFixogdf::pc_tree::PCTreeprivate
m_apexTPPred2ogdf::pc_tree::PCTreeprivate
m_bundleEdgesForLeafogdf::pc_tree::NodePCRotationprotected
m_cNodeCountogdf::pc_tree::PCTreeprivate
m_externalForestogdf::pc_tree::PCTreeprivate
m_firstPartialogdf::pc_tree::PCTreeprivate
m_forestogdf::pc_tree::PCTreeprivate
m_Gogdf::pc_tree::NodePCRotationprotected
m_graphNodeForInnerNodeogdf::pc_tree::NodePCRotationprotected
m_incidentEdgeForLeafogdf::pc_tree::NodePCRotationprotected
m_lastPartialogdf::pc_tree::PCTreeprivate
m_leavesogdf::pc_tree::PCTreeprivate
m_nogdf::pc_tree::NodePCRotationprotected
m_observersogdf::pc_tree::PCTreeprivate
m_partialCountogdf::pc_tree::PCTreeprivate
m_pNodeCountogdf::pc_tree::PCTreeprivate
m_rootNodeogdf::pc_tree::PCTreeprivate
m_terminalPathLengthogdf::pc_tree::PCTreeprivate
makeConsecutive(std::initializer_list< PCNode * > consecutiveLeaves)ogdf::pc_tree::PCTreeinline
makeConsecutive(const std::vector< PCNode * > &consecutiveLeaves)ogdf::pc_tree::PCTreeinline
makeConsecutive(It begin, It end)ogdf::pc_tree::PCTreeinline
makeFullNodesConsecutive()ogdf::pc_tree::PCTree
markFull(It begin, It end, std::vector< PCNode * > *fullNodeOrder=nullptr)ogdf::pc_tree::PCTreeinline
markFull(PCNode *full_node, std::vector< PCNode * > *fullNodeOrder=nullptr)ogdf::pc_tree::PCTreeprivate
markLeavesFull(It begin, It end)ogdf::pc_tree::PCTreeinline
mergeLeaves(const std::vector< PCNode * > &consecutiveLeaves, bool assumeConsecutive=false)ogdf::pc_tree::PCTreeinline
mergeLeaves(It begin, It end, bool assumeConsecutive=false)ogdf::pc_tree::PCTreeinline
newNode(PCNodeType type, PCNode *parent=nullptr, int id=-1)ogdf::pc_tree::PCTree
NodePCRotation()ogdf::pc_tree::NodePCRotationinlineprotected
NodePCRotation(const Graph &G, node n, bool mapBundleEdges=true)ogdf::pc_tree::NodePCRotationexplicit
operator const PCTreeRegistry &() constogdf::pc_tree::PCTreeinline
PCTree()ogdf::pc_tree::PCTreeinlineexplicit
PCTree(PCTreeForest *forest)ogdf::pc_tree::PCTreeinlineexplicit
PCTree(int leafNum, std::vector< PCNode * > *added=nullptr, PCTreeForest *forest=nullptr)ogdf::pc_tree::PCTreeexplicit
PCTree(const PCTree &other, PCTreeNodeArray< PCNode * > &nodeMapping, bool keep_ids=false, PCTreeForest *forest=nullptr)ogdf::pc_tree::PCTreeexplicit
PCTree(const std::string &str, bool keep_ids=false, PCTreeForest *forest=nullptr)ogdf::pc_tree::PCTreeexplicit
possibleOrders() constogdf::pc_tree::PCTreeinline
registerNode(PCNode *node)ogdf::pc_tree::PCTreeprivate
removeObserver(std::list< Observer * >::const_iterator it)ogdf::pc_tree::PCTreeinline
removeObserver(Observer *observer)ogdf::pc_tree::PCTreeinline
removePartialNode(PCNode *partial)ogdf::pc_tree::PCTreeprivate
replaceLeaf(int leafCount, PCNode *leaf, std::vector< PCNode * > *added=nullptr)ogdf::pc_tree::PCTree
replaceTPNeigh(PCNode *central, PCNode *oldTPNeigh, PCNode *newTPNeigh, PCNode *newFullNeigh, PCNode *otherEndOfFullBlock)ogdf::pc_tree::PCTreeprivate
resetTempData()ogdf::pc_tree::PCTreeinline
restoreSubtrees(PCTreeNodeArray< std::vector< PCNode * >> &blockNodes, PCTreeNodeArray< std::vector< PCNode * >> &subtreeNodes, PCTreeNodeArray< PCNode * > &leafPartner, PCTreeNodeArray< bool > &isFront)ogdf::pc_tree::PCTreeprivate
setApexCandidate(PCNode *ac, bool fix=false)ogdf::pc_tree::PCTreeprivate
setIncidentEdgeForLeaf(PCNode *n, edge e)ogdf::pc_tree::NodePCRotationinline
setRoot(PCNode *newRoot)ogdf::pc_tree::PCTree
splitOffFullPNode(PCNode *node, bool skip_parent)ogdf::pc_tree::PCTreeprivate
uidComparer() constogdf::pc_tree::NodePCRotation
uidPrinter() constogdf::pc_tree::NodePCRotation
uniqueID(std::ostream &os, const std::function< void(std::ostream &os, PCNode *, int)> &printNode=uid_utils::nodeToID, const std::function< bool(PCNode *, PCNode *)> &compareNodes=uid_utils::compareNodesByID)ogdf::pc_tree::PCTree
uniqueID(const std::function< void(std::ostream &os, PCNode *, int)> &printNode=uid_utils::nodeToID, [[maybe_unused]] const std::function< bool(PCNode *, PCNode *)> &compareNodes=uid_utils::compareNodesByID)ogdf::pc_tree::PCTreeinline
unregisterNode(PCNode *node)ogdf::pc_tree::PCTreeprivate
updateSingletonTerminalPath()ogdf::pc_tree::PCTreeprivate
updateTerminalPath(PCNode *central, PCNode *tpNeigh)ogdf::pc_tree::PCTreeprivate
~PCTree()ogdf::pc_tree::PCTreevirtual