| addLeaf(pc_tree::PCNode *n, adjEntry adj) | ogdf::sync_plan::NodeSPQRRotation | protected |
| addObserver(Observer *observer) | ogdf::pc_tree::PCTree | inline |
| addPartialNode(PCNode *partial) | ogdf::pc_tree::PCTree | private |
| allNodes() const | ogdf::pc_tree::PCTree | inline |
| apex | ogdf::sync_plan::NodeSPQRRotation | protected |
| changeNodeType(PCNode *node, PCNodeType newType) | ogdf::pc_tree::PCTree | |
| changeRoot(PCNode *newRoot) | ogdf::pc_tree::PCTree | |
| checkTPPartialCNode(PCNode *node) | ogdf::pc_tree::PCTree | private |
| checkValid(bool allow_small_deg=true) const | ogdf::pc_tree::PCTree | |
| children | ogdf::sync_plan::NodeSPQRRotation | protected |
| createCentralNode() | ogdf::pc_tree::PCTree | private |
| currentLeafOrder(Container &container) const | ogdf::pc_tree::PCTree | inline |
| currentLeafOrder() const | ogdf::pc_tree::PCTree | inline |
| destroyLeaf(PCNode *leaf) | ogdf::pc_tree::PCTree | |
| destroyNode(PCNode *&node) | ogdf::pc_tree::PCTree | inline |
| destroyNode(PCNode *const &node) | ogdf::pc_tree::PCTree | |
| edges | ogdf::sync_plan::NodeSPQRRotation | protected |
| findEndOfFullBlock(PCNode *node, PCNode *pred, PCNode *curr, PCNode *&fullEnd, PCNode *&emptyEnd) const | ogdf::pc_tree::PCTree | private |
| 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::PCTree | private |
| findSPQRApex(node n, bool clear=false) | ogdf::sync_plan::NodeSPQRRotation | protected |
| findTerminalPath() | ogdf::pc_tree::PCTree | private |
| FullLeafIter typedef | ogdf::pc_tree::PCTree | |
| generateInnerNodeForGraphNodeMapping(NodeArray< PCNode * > &mapping) const | ogdf::pc_tree::NodePCRotation | inline |
| generateLeafForIncidentEdgeMapping(EdgeArray< PCNode * > &mapping) const | ogdf::pc_tree::NodePCRotation | inline |
| generatePartnerEdgesForIncidentEdge(EdgeArray< const List< edge > * > &mapping) const | ogdf::pc_tree::NodePCRotation | inline |
| getCNodeCount() const | ogdf::pc_tree::PCTree | inline |
| getForest() const | ogdf::pc_tree::PCTree | inline |
| getGraph() const | ogdf::pc_tree::NodePCRotation | inline |
| getGraphNodeForInnerNode(PCNode *n) const | ogdf::pc_tree::NodePCRotation | inline |
| getIncidentEdgeForLeaf(PCNode *n) const | ogdf::pc_tree::NodePCRotation | inline |
| getLeafCount() const | ogdf::pc_tree::PCTree | inline |
| getLeaves() const | ogdf::pc_tree::PCTree | inline |
| getNode() const | ogdf::pc_tree::NodePCRotation | inline |
| getPartnerEdgesForLeaf(PCNode *l) const | ogdf::pc_tree::NodePCRotation | inline |
| getPNodeCount() const | ogdf::pc_tree::PCTree | inline |
| getRestrictions(std::vector< std::vector< PCNode * >> &restrictions, PCNode *fixedLeaf=nullptr) const | ogdf::pc_tree::PCTree | |
| getRootNode() const | ogdf::pc_tree::PCTree | inline |
| getTerminalPathLength() const | ogdf::pc_tree::PCTree | inline |
| 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) const | ogdf::pc_tree::PCTree | |
| getTrivialPartnerPole(const Graph &G, node n) | ogdf::pc_tree::NodePCRotation | static |
| getTrivialPartnerPole() const | ogdf::pc_tree::NodePCRotation | |
| highest_with_edges | ogdf::sync_plan::NodeSPQRRotation | protected |
| innerNodes() const | ogdf::pc_tree::PCTree | inline |
| 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) const | ogdf::pc_tree::NodePCRotation | |
| isTrivial() const | ogdf::pc_tree::PCTree | |
| isTrivialRestriction(int size) const | ogdf::pc_tree::PCTree | |
| isValidOrder(const std::vector< PCNode * > &order) const | ogdf::pc_tree::PCTree | |
| knowsPartnerEdges() const | ogdf::pc_tree::NodePCRotation | inline |
| log | ogdf::sync_plan::NodeSPQRRotation | static |
| m_apexCandidate | ogdf::pc_tree::PCTree | private |
| m_apexCandidateIsFix | ogdf::pc_tree::PCTree | private |
| m_apexTPPred2 | ogdf::pc_tree::PCTree | private |
| m_bundleEdgesForLeaf | ogdf::pc_tree::NodePCRotation | protected |
| m_cNodeCount | ogdf::pc_tree::PCTree | private |
| m_externalForest | ogdf::pc_tree::PCTree | private |
| m_firstPartial | ogdf::pc_tree::PCTree | private |
| m_forest | ogdf::pc_tree::PCTree | private |
| m_G | ogdf::pc_tree::NodePCRotation | protected |
| m_graphNodeForInnerNode | ogdf::pc_tree::NodePCRotation | protected |
| m_incidentEdgeForLeaf | ogdf::pc_tree::NodePCRotation | protected |
| m_lastPartial | ogdf::pc_tree::PCTree | private |
| m_leaves | ogdf::pc_tree::PCTree | private |
| m_n | ogdf::pc_tree::NodePCRotation | protected |
| m_observers | ogdf::pc_tree::PCTree | private |
| m_partialCount | ogdf::pc_tree::PCTree | private |
| m_pNodeCount | ogdf::pc_tree::PCTree | private |
| m_rootNode | ogdf::pc_tree::PCTree | private |
| m_terminalPathLength | ogdf::pc_tree::PCTree | private |
| makeConsecutive(std::initializer_list< PCNode * > consecutiveLeaves) | ogdf::pc_tree::PCTree | inline |
| makeConsecutive(const std::vector< PCNode * > &consecutiveLeaves) | ogdf::pc_tree::PCTree | inline |
| makeConsecutive(It begin, It end) | ogdf::pc_tree::PCTree | inline |
| makeFullNodesConsecutive() | ogdf::pc_tree::PCTree | |
| makePCNode(node t, node t_parent, pc_tree::PCNode *parent) | ogdf::sync_plan::NodeSPQRRotation | protected |
| mapGraph(const Graph *G, const std::function< node(node)> &node_map, const std::function< edge(edge)> &edge_map) | ogdf::sync_plan::NodeSPQRRotation | inline |
| mapPartnerEdges() | ogdf::sync_plan::NodeSPQRRotation | |
| markFull(It begin, It end, std::vector< PCNode * > *fullNodeOrder=nullptr) | ogdf::pc_tree::PCTree | inline |
| markFull(PCNode *full_node, std::vector< PCNode * > *fullNodeOrder=nullptr) | ogdf::pc_tree::PCTree | private |
| markLeavesFull(It begin, It end) | ogdf::pc_tree::PCTree | inline |
| mergeLeaves(const std::vector< PCNode * > &consecutiveLeaves, bool assumeConsecutive=false) | ogdf::pc_tree::PCTree | inline |
| mergeLeaves(It begin, It end, bool assumeConsecutive=false) | ogdf::pc_tree::PCTree | inline |
| newNode(PCNodeType type, PCNode *parent=nullptr, int id=-1) | ogdf::pc_tree::PCTree | |
| NodePCRotation() | ogdf::pc_tree::NodePCRotation | inlineprotected |
| NodePCRotation(const Graph &G, node n, bool mapBundleEdges=true) | ogdf::pc_tree::NodePCRotation | explicit |
| NodeSPQRRotation(const DynamicSPQRForest &_spqr, node n, const NodeArray< GraphCopySimple * > &_rigids) | ogdf::sync_plan::NodeSPQRRotation | inlineexplicit |
| operator const PCTreeRegistry &() const | ogdf::pc_tree::PCTree | inline |
| PCTree() | ogdf::pc_tree::PCTree | inlineexplicit |
| PCTree(PCTreeForest *forest) | ogdf::pc_tree::PCTree | inlineexplicit |
| PCTree(int leafNum, std::vector< PCNode * > *added=nullptr, PCTreeForest *forest=nullptr) | ogdf::pc_tree::PCTree | explicit |
| PCTree(const PCTree &other, PCTreeNodeArray< PCNode * > &nodeMapping, bool keep_ids=false, PCTreeForest *forest=nullptr) | ogdf::pc_tree::PCTree | explicit |
| PCTree(const std::string &str, bool keep_ids=false, PCTreeForest *forest=nullptr) | ogdf::pc_tree::PCTree | explicit |
| possibleOrders() const | ogdf::pc_tree::PCTree | inline |
| registerNode(PCNode *node) | ogdf::pc_tree::PCTree | private |
| removeObserver(std::list< Observer * >::const_iterator it) | ogdf::pc_tree::PCTree | inline |
| removeObserver(Observer *observer) | ogdf::pc_tree::PCTree | inline |
| removePartialNode(PCNode *partial) | ogdf::pc_tree::PCTree | private |
| 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::PCTree | private |
| resetTempData() | ogdf::pc_tree::PCTree | inline |
| restoreSubtrees(PCTreeNodeArray< std::vector< PCNode * >> &blockNodes, PCTreeNodeArray< std::vector< PCNode * >> &subtreeNodes, PCTreeNodeArray< PCNode * > &leafPartner, PCTreeNodeArray< bool > &isFront) | ogdf::pc_tree::PCTree | private |
| rigids | ogdf::sync_plan::NodeSPQRRotation | protected |
| setApexCandidate(PCNode *ac, bool fix=false) | ogdf::pc_tree::PCTree | private |
| setIncidentEdgeForLeaf(PCNode *n, edge e) | ogdf::pc_tree::NodePCRotation | inline |
| setRoot(PCNode *newRoot) | ogdf::pc_tree::PCTree | |
| splitOffFullPNode(PCNode *node, bool skip_parent) | ogdf::pc_tree::PCTree | private |
| spqr | ogdf::sync_plan::NodeSPQRRotation | protected |
| uidComparer() const | ogdf::pc_tree::NodePCRotation | |
| uidPrinter() const | ogdf::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::PCTree | inline |
| unregisterNode(PCNode *node) | ogdf::pc_tree::PCTree | private |
| updateSingletonTerminalPath() | ogdf::pc_tree::PCTree | private |
| updateTerminalPath(PCNode *central, PCNode *tpNeigh) | ogdf::pc_tree::PCTree | private |
| ~PCTree() | ogdf::pc_tree::PCTree | virtual |
