/dports/math/ogdf/OGDF/include/ogdf/planarity/embedder/ |
H A D | EmbedderMaxFaceBiconnectedGraphsLayers.h | 59 adjEntry& adjExternal, 134 adjEntry& adjExternal, 301 adjEntry& ae, 335 adjEntry& adjExternal, in embed() 426 adjEntry& ae, in adjEntryForNode() 440 adjEntry& adjExternal) in adjEntryForNode() 532 adjEntry& adjExternal, in expandEdge() 786 adjEntry ae; in expandEdgePNode() 1085 adjEntry start_ae; in expandEdgeRNode() 1130 adjEntry m_start_ae; in expandEdgeRNode() [all …]
|
H A D | LayersBlockEmbedder.h | 56 ListIterator<adjEntry> &after) { in internalEmbedBlock() 57 adjEntry m_adjExternal = nullptr; in internalEmbedBlock() 70 for (adjEntry ae : on->adjEntries) { in internalEmbedBlock() 92 adjEntry ae = nSG->firstAdj(); in internalEmbedBlock() 94 ListIterator<adjEntry>* pAfter; in internalEmbedBlock() 157 List<adjEntry> newFace; in internalEmbedBlock() 158 adjEntry adj2 = adj; in internalEmbedBlock() 182 for (adjEntry adj2 : Li) { in internalEmbedBlock() 189 for (adjEntry adj4 : Lj) { in internalEmbedBlock() 238 List<adjEntry> optFace; in internalEmbedBlock() [all …]
|
H A D | EmbedderMaxFaceBiconnectedGraphs.h | 64 adjEntry& adjExternal, 273 adjEntry& adjExternal, 415 adjEntry& ae, 433 adjEntry& adjExternal, in embed() 523 adjEntry& ae, in adjEntryForNode() 534 adjEntry& adjExternal) in adjEntryForNode() 622 adjEntry& adjExternal, in expandEdge() 661 adjEntry& adjExternal) in expandEdgeSNode() 826 adjEntry ae; in expandEdgePNode() 1086 adjEntry start_ae; in expandEdgeRNode() [all …]
|
/dports/math/ogdf/OGDF/include/ogdf/basic/ |
H A D | CombinatorialEmbedding.h | 49 adjEntry m_adj; 50 adjEntry m_adjFirst; 55 FaceAdjIterator(adjEntry adjFirst, adjEntry adj) : m_adj(adj), m_adjFirst(adjFirst) { } in FaceAdjIterator() 93 adjEntry m_adjFirst; 128 adjEntry adjFirst, in FaceElement() 157 adjEntry nextFaceEdge(adjEntry adj) const { in nextFaceEdge() 370 adjEntry adj; 384 adjEntry findCommonFace(const node v, const node w, adjEntry &adjW, bool left = true) const; 524 node splitNode(adjEntry adjStartLeft, adjEntry adjStartRight); 544 edge splitFace(adjEntry adjSrc, adjEntry adjTgt); [all …]
|
H A D | Graph_d.h | 71 using adjEntry = AdjElement*; variable 126 bool isBetween(adjEntry adjBefore, adjEntry adjAfter) const; 148 adjEntry succ() const { return static_cast<adjEntry>(m_next); } in succ() 150 adjEntry pred() const { return static_cast<adjEntry>(m_prev); } in pred() 400 inline bool AdjElement::isBetween(adjEntry adjBefore, adjEntry adjAfter) const { in isBetween() 927 node splitNode(adjEntry adjStartLeft, adjEntry adjStartRight); 1084 void moveAdj(adjEntry adjMove, Direction dir, adjEntry adjPos) { in moveAdj() 1100 void moveAdjAfter(adjEntry adjMove, adjEntry adjAfter) { in moveAdjAfter() 1115 void moveAdjBefore(adjEntry adjMove, adjEntry adjBefore) { in moveAdjBefore() 1133 void swapAdjEdges(adjEntry adj1, adjEntry adj2) { in swapAdjEdges() [all …]
|
H A D | GraphCopy.h | 109 adjEntry original(adjEntry adj) const { in original() 141 adjEntry copy(adjEntry adj) const { in copy() 317 adjEntry original(adjEntry adj) const { in original() 363 adjEntry copy(adjEntry adj) const { in copy() 488 void insertEdgePath(edge eOrig, const SList<adjEntry> &crossedEdges); 543 edge newEdge(node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E); 575 const SList<adjEntry> &crossedEdges); 708 adjEntry adjA1, 709 adjEntry adjA2, 710 adjEntry adjB1, [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/upward/ |
H A D | UpwardPlanRep.cpp | 60 adjEntry adj; in UpwardPlanRep() 197 List<adjEntry> switches; in augment() 211 List<Tuple2<adjEntry, adjEntry>> list; in augment() 213 adjEntry adj_top; in augment() 222 Tuple2<adjEntry, adjEntry> pair(adj, adj_top); in augment() 262 Tuple2<adjEntry, adjEntry> pair = list.popFrontRet(); in augment() 293 adjEntry adj = *it; in removeSinkArcs() 319 adjEntry adjSrc, adjTgt; in insertEdgePathEmbedded() 328 adjEntry adj = *it; in insertEdgePathEmbedded() 416 List<adjEntry> srcList; in constructSinkArcs() [all …]
|
H A D | FixedEmbeddingUpwardEdgeInserter.cpp | 100 SList<adjEntry> path; in insertAll() 276 SList<adjEntry> path; in insertAll() 330 SList<adjEntry> &path, in getPath() 357 List<adjEntry> adjOut; in getPath() 516 adjEntry adjCurrent, in isConstraintFeasible() 517 adjEntry adjNext, in isConstraintFeasible() 521 SList<adjEntry> path; in isConstraintFeasible() 540 SList<adjEntry> path_M; in isConstraintFeasible() 577 SList<adjEntry> &path) in isConstraintFeasible() 583 SList<adjEntry> path_M; in isConstraintFeasible() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/decomposition/ |
H A D | PlanarSPQRTree.cpp | 100 adjEntry adj) in setPosInEmbedding() 198 adjEntry adjVirt, in expandVirtualEmbed() 206 adjEntry adj; in expandVirtualEmbed() 287 void PlanarSPQRTree::swap(node vT, adjEntry adj1, adjEntry adj2) in swap() 359 adjEntry adj; in randomEmbed() 448 List<adjEntry> order; in embed() 531 List<adjEntry> order; in firstEmbedding() 547 void PlanarSPQRTree::reverse(node &vP, adjEntry &first, adjEntry &last) in reverse() 551 adjEntry it_l = last; in reverse() 553 adjEntry temp = it_f; in reverse() [all …]
|
/dports/math/ogdf/OGDF/include/ogdf/upward/ |
H A D | FixedEmbeddingUpwardEdgeInserter.h | 82 void dynamicLock(UpwardPlanRep &UPR, EdgeArray<bool> &locked, face f, adjEntry e_cur); 84 …void nextFeasibleEdges(UpwardPlanRep &UPR, List<adjEntry> &nextEdges, face f, adjEntry e_cur, Edge… 91 SList<adjEntry> &path) { getPath(UPR, origEdges, cost, e_orig, path, false); } in minFIP() 100 SList<adjEntry> &path) { getPath(UPR, origEdges, cost, e_orig, path, true); } in constraintFIP() 107 SList<adjEntry> &path, 121 adjEntry adj, // current adjEntry, right face muss be f 123 List<adjEntry> &feasible, // the list of feasible edges in f with respect to e 130 adjEntry adjCurrent, 131 adjEntry adjNext, // the next adjEntry of the current insertion path 132 EdgeArray<adjEntry> &predAdj //Array to reconstruction the insertion path [all …]
|
H A D | UpwardPlanRep.h | 71 adjEntry adj_ext); // the right face of this adjEntry is the external face 89 SList<adjEntry> crossedEdges, 121 adjEntry sinkSwitchOf(node v) {return m_sinkSwitchOf[v];} in sinkSwitchOf() 124 adjEntry getAdjEntry(const CombinatorialEmbedding &Gamma, node v, face f) const; 127 adjEntry leftInEdge(node v) const in leftInEdge() 132 adjEntry adjFound = nullptr; in leftInEdge() 133 for(adjEntry adj : v->adjEntries) { in leftInEdge() 147 adjEntry adjNext = f->firstAdj(); in outputFaces() 180 NodeArray<adjEntry> m_sinkSwitchOf; 182 adjEntry extFaceHandle; // the right face of this adjEntry is always the ext. face [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/orthogonal/ |
H A D | OrthoRep.cpp | 310 List<adjEntry> faceCycle; in dissect() 321 ListIterator<adjEntry> it; in dissect() 445 List<adjEntry> faceCycle; in dissect2() 523 adjEntry& adEnd = *itEnd; in dissect2() 688 adjEntry& adToe = *itToe; in dissect2() 689 adjEntry adjHeadSucc; in dissect2() 773 ListIterator<adjEntry> it; in dissect2() 995 List<adjEntry> faceCycle; in gridDissect() 1209 adjEntry adjHeadSucc; in gridDissect() 1289 ListIterator<adjEntry> it; in gridDissect() [all …]
|
H A D | OrthoShaper.cpp | 239 for(adjEntry adj : f->entries) in call() 246 for(adjEntry adj : f->entries) in call() 315 adjEntry gen1 = nullptr; in call() 316 adjEntry gen2 = nullptr; in call() 374 adjEntry assClassAdj = nullptr; in call() 709 adjEntry adjFound = nullptr; in call() 907 adjEntry splitter = nullptr; in call() 1720 for(adjEntry adj : f->entries) in call() 1727 for(adjEntry adj : f->entries) in call() 1789 adjEntry gen1 = nullptr; in call() [all …]
|
/dports/math/ogdf/OGDF/include/ogdf/planarlayout/ |
H A D | FPPLayout.h | 60 adjEntry adjExternal, 68 NodeArray<adjEntry> &e_wp, 69 NodeArray<adjEntry> &e_wq, 70 adjEntry e_12, 71 adjEntry e_2n, 72 adjEntry e_n1 ); 79 NodeArray<adjEntry> &e_wp, 80 NodeArray<adjEntry> &e_wq );
|
/dports/math/ogdf/OGDF/src/ogdf/planarity/ |
H A D | EmbedderMinDepthPiTa.cpp | 138 for(adjEntry ae : n->adjEntries) in doCall() 151 List<adjEntry> newFace; in doCall() 152 adjEntry adj2 = adj; in doCall() 393 for(adjEntry ae : f->entries) in doCall() 432 adjEntry ae = nullptr; in doCall() 956 ListIterator<adjEntry> after; in embedCutVertex() 998 for (adjEntry aeNode = ae; in embedCutVertex() 1190 ListIterator<adjEntry> after; in embedBlockVertex() 1198 adjEntry ae_G_cT = nullptr; in embedBlockVertex() 1218 adjEntry adjE; in embedBlockVertex() [all …]
|
H A D | SimpleIncNodeInserter.cpp | 68 adjEntry adjOrig = v->firstAdj(); in insertCopyNode() 125 adjEntry adExternal = nullptr; in insertCopyNode() 168 List<adjEntry> &insertAfterAdj) in getInsertionFace() 243 adjEntry &adExternal) in insertFaceEdges() 264 adjEntry behindAdj = nullptr; in insertFaceEdges() 296 List<adjEntry> faceAdj; in insertFaceEdges() 297 adjEntry adFace = f->firstAdj(); in insertFaceEdges() 402 SList<adjEntry> crossedEdges; in insertCrossingEdges() 460 SList<adjEntry> &crossed) in findShortestPath() 529 adjEntry adj; in findShortestPath() [all …]
|
H A D | MultiEdgeApproxInserter.cpp | 161 int findBestFaces(node s, node t, adjEntry &adj_s, adjEntry &adj_t); 389 node s, node t, adjEntry &adj_s, adjEntry &adj_t) in findBestFaces() 434 adjEntry adj; in findBestFaces() 455 adjEntry adj; in findBestFaces() 1164 adjEntry adjP, in recFlipPref() 1198 void appendToList(SListPure<adjEntry> &adjList, adjEntry adj1, in appendToList() 1202 adjEntry adj = adj1; in appendToList() 1210 void insertAfterList(SListPure<adjEntry> &adjList, SListIterator<adjEntry> itBefore, adjEntry adj1, in insertAfterList() 1214 adjEntry adj = adj1; in insertAfterList() 1620 adjEntry adj; in findShortestPath() [all …]
|
H A D | EmbedderMinDepth.cpp | 128 for(adjEntry adj : bT->adjEntries) { in computeBlockGraphs() 166 for(adjEntry adj : bT->adjEntries) { in bottomUpTraversal() 234 for(adjEntry adj : bT->adjEntries) { in topDownTraversal() 535 ListIterator<adjEntry> after; in embedBlock() 544 ListIterator<adjEntry>& after) in embedBlock() 568 adjEntry m_adjExternal = nullptr; in embedBlock() 583 adjEntry ae1 = on->firstAdj(); in embedBlock() 598 adjEntry ae = nSG->firstAdj(); in embedBlock() 599 ListIterator<adjEntry>* pAfter; in embedBlock() 628 adjEntry aeFace = f->firstAdj(); in embedBlock() [all …]
|
/dports/math/ogdf/OGDF/include/ogdf/decomposition/ |
H A D | PlanarSPQRTree.h | 100 void swap(node vT, adjEntry adj1, adjEntry adj2); 147 NodeArray<SListPure<adjEntry> > &adjEdges, 149 NodeArray<adjEntry> &lastAdj, 152 adjEntry adj); 156 adjEntry adjVirt, 157 SListPure<adjEntry> &adjEdges); 163 adjEntry &first, 164 adjEntry &last);
|
/dports/math/ogdf/OGDF/include/ogdf/planarity/boyer_myrvold/ |
H A D | FindKuratowskis.h | 69 ArrayBuffer<adjEntry>* highestXYPath; 70 ArrayBuffer<adjEntry>* zPath; 143 ArrayBuffer<adjEntry> highestFacePath; 146 SListPure<ArrayBuffer<adjEntry>> highestXYPaths; 149 SListPure<adjEntry> externalFacePath; 160 SListPure<ArrayBuffer<adjEntry>> zPaths; 252 const NodeArray<adjEntry>(& m_link)[2]; 255 const NodeArray<adjEntry>& m_adjParent; 303 SListPure<adjEntry>& externalFacePath, 304 const ArrayBuffer<adjEntry>& highestFacePath, [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/basic/graph_generators/ |
H A D | operations.cpp | 94 for (adjEntry adj2 : v2->adjEntries) { in cartesianProduct() 103 for (adjEntry adj1 : v1->adjEntries) { in cartesianProduct() 118 for (adjEntry adj1 : v1->adjEntries) { in tensorProduct() 119 for (adjEntry adj2 : v2->adjEntries) { in tensorProduct() 139 for (adjEntry adj1 : v1->adjEntries) { in lexicographicalProduct() 149 for (adjEntry adj2 : v2->adjEntries) { in lexicographicalProduct() 166 for (adjEntry adj2 : v2->adjEntries) { in strongProduct() 174 for (adjEntry adj1 : v1->adjEntries) { in strongProduct() 183 for (adjEntry adj1 : v1->adjEntries) { in strongProduct() 234 for (adjEntry adj1 : v1->adjEntries) { in modularProduct() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/basic/ |
H A D | CombinatorialEmbedding.cpp | 127 for(adjEntry adj : v->adjEntries) { in computeFaces() 138 adjEntry adj2 = adj; in computeFaces() 214 node CombinatorialEmbedding::splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) in splitNode() 241 adjEntry adjSrc = e->adjSource(); in contract() 242 adjEntry adjTgt = e->adjTarget(); in contract() 269 edge CombinatorialEmbedding::splitFace(adjEntry adjSrc, adjEntry adjTgt) in splitFace() 279 adjEntry adj = adjSrc; in splitFace() 399 void CombinatorialEmbedding::moveBridge(adjEntry adjBridge, adjEntry adjBefore) in moveBridge() 410 adjEntry adj; in moveBridge() 437 adjEntry adj = v->firstAdj(); in removeDeg1() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/cluster/ |
H A D | ClusterOrthoShaper.cpp | 229 for(adjEntry adj : f->entries) in call() 236 for(adjEntry adj : f->entries) in call() 300 adjEntry gen1 = nullptr; in call() 301 adjEntry gen2 = nullptr; in call() 316 for(adjEntry adj : v->adjEntries) in call() 364 for(adjEntry adj : v->adjEntries) in call() 404 for(adjEntry adj : f->entries) in call() 454 adjEntry adjFound = nullptr; in call() 550 adjEntry splitter = nullptr; in call() 662 for(adjEntry adj : f->entries) in call() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/planarity/embedding_inserter/ |
H A D | VarEdgeInserterDynCore.cpp | 130 adjEntry a; in insertEdgePath() 146 adjEntry a; in insertEdgePath() 178 adjEntry a; in insertEdgePath() 196 adjEntry a; in insertEdgePath() 678 SList<adjEntry> eip; in call() 725 SList<adjEntry> eip; in call() 792 SList<adjEntry> eip; in call() 887 List<adjEntry> L; in insert() 953 List<adjEntry> &L, in buildSubpath() 965 List<adjEntry> subpath; in buildSubpath() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/planarlayout/ |
H A D | BitonicOrdering.cpp | 39 BitonicOrdering::BitonicOrdering(Graph& G, adjEntry adj_st_edge) in BitonicOrdering() 108 adjEntry BitonicOrdering::getAdjST(node v_T) const in getAdjST() 115 adjEntry adj_st = e_ref->adjSource(); in getAdjST() 135 adjEntry adj_st = getAdjST(v_T); in handleSerialCase() 141 for (adjEntry adj = adj_st->cyclicSucc(); in handleSerialCase() 175 adjEntry adj_st = getAdjST(v_T); in handleParallelCase() 178 adjEntry adj_real = nullptr; in handleParallelCase() 255 adjEntry adj_st = getAdjST(v_T); in handleRigidCase() 288 for (adjEntry adj = w->firstAdj(); adj; adj = adj->succ()) { in handleRigidCase() 354 adjEntry adj_first_succ = nullptr; in consistencyCheck() [all …]
|