| /dports/math/ogdf/OGDF/src/ogdf/basic/ |
| H A D | Graph.cpp | 226 adjTgt->m_node = w; in constructInitByCC()
539 adjSrc->m_twin = adjTgt; in newEdge()
540 adjTgt->m_twin = adjSrc; in newEdge()
585 adjSrc->m_twin = adjTgt; in newEdge()
586 adjTgt->m_twin = adjSrc; in newEdge()
683 adjEntry adjTgt, in move() argument
776 adjTgt->m_edge = e; in split()
797 e->m_adjTgt = adjTgt; in split()
840 eIn->m_adjTgt = adjTgt; in unsplit()
845 adjTgt->m_edge = eIn; in unsplit()
[all …]
|
| H A D | CombinatorialEmbedding.cpp | 242 adjEntry adjTgt = e->adjTarget(); in contract() local
245 face fTgt = m_rightFace[adjTgt]; in contract()
252 if (fTgt->entries.m_adjFirst == adjTgt) { in contract()
253 adjEntry adj = adjTgt->faceCycleSucc(); in contract()
269 edge CombinatorialEmbedding::splitFace(adjEntry adjSrc, adjEntry adjTgt) in splitFace() argument
271 OGDF_ASSERT(m_rightFace[adjSrc] == m_rightFace[adjTgt]); in splitFace()
272 OGDF_ASSERT(adjSrc != adjTgt); in splitFace()
274 edge e = m_pGraph->newEdge(adjSrc,adjTgt); in splitFace()
276 face f1 = m_rightFace[adjTgt]; in splitFace()
286 f1->entries.m_adjFirst = adjTgt; in splitFace()
[all …]
|
| H A D | GraphCopy.cpp | 422 adjEntry adjSrc, adjTgt; in insertEdgePathEmbedded() local
436 adjTgt = u->firstAdj(); in insertEdgePathEmbedded()
437 adjEntry adjSrcNext = adjTgt->succ(); in insertEdgePathEmbedded()
439 if (adjTgt != adj->twin()) in insertEdgePathEmbedded()
440 std::swap(adjTgt,adjSrcNext); in insertEdgePathEmbedded()
443 edge eNew = E.splitFace(adjSrc,adjTgt); in insertEdgePathEmbedded()
|
| /dports/math/ogdf/OGDF/src/ogdf/upward/ |
| H A D | UpwardPlanRep.cpp | 242 e_new = m_Gamma.splitFace(adj, adjTgt); in augment()
271 e_new = m_Gamma.splitFace(pair.x1(), adjTgt); in augment()
319 adjEntry adjSrc, adjTgt; in insertEdgePathEmbedded() local
347 adjTgt = u->firstAdj(); in insertEdgePathEmbedded()
348 adjEntry adjSrcNext = adjTgt->succ(); in insertEdgePathEmbedded()
350 if (adjTgt != adj->twin()) in insertEdgePathEmbedded()
351 std::swap(adjTgt, adjSrcNext); in insertEdgePathEmbedded()
363 edge eNew = m_Gamma.splitFace(adjSrc,adjTgt); in insertEdgePathEmbedded()
437 eNew = m_Gamma.splitFace(adjSrc, adjTgt); in constructSinkArcs()
455 adjEntry adjTgt; in constructSinkArcs() local
[all …]
|
| H A D | FixedEmbeddingUpwardEdgeInserter.cpp | 383 adjEntry adjTgt = UPR.getAdjEntry(UPR.getEmbedding(), y_1, UPR.getEmbedding().rightFace(adj)); in getPath() local
398 adjTgt = tgtRight; // *it->theEdge() is on the right face side in getPath()
400 adjTgt = tgtLeft; // *it->theEdge() is on the left face side in getPath()
403 if (Gamma.rightFace(adj) != Gamma.rightFace(adjTgt)) in getPath()
404 adjTgt = adjTgt->cyclicPred(); in getPath()
406 path.pushBack(adjTgt); in getPath()
408 OGDF_ASSERT(Gamma.rightFace(adj) == Gamma.rightFace(adjTgt)); in getPath()
|
| /dports/math/ogdf/OGDF/src/ogdf/hypergraph/ |
| H A D | EdgeStandardRep.cpp | 168 for (adjHypergraphEntry adjTgt = adjSrc->succ(); adjTgt; adjTgt = adjTgt->succ()) { in hyperedgeToClique() local
171 m_nodeMap[reinterpret_cast<hypernode>(adjTgt->element())]); in hyperedgeToClique()
|
| /dports/math/ogdf/OGDF/include/ogdf/basic/ |
| H A D | Graph_d.h | 310 EdgeElement(node src, node tgt, AdjElement *adjSrc, AdjElement *adjTgt, int id) : in EdgeElement() argument
311 m_src(src), m_tgt(tgt), m_adjSrc(adjSrc), m_adjTgt(adjTgt), m_id(id) { } in EdgeElement()
722 edge newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir = Direction::after);
735 edge newEdge(node v, adjEntry adjTgt);
953 adjEntry adjTgt, Direction dirTgt);
973 void moveTarget(edge e, adjEntry adjTgt, Direction dir);
1392 edge createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt);
|
| H A D | CombinatorialEmbedding.h | 544 edge splitFace(adjEntry adjSrc, adjEntry adjTgt);
554 edge addEdgeToIsolatedNode(node v, adjEntry adjTgt);
|
| /dports/math/ogdf/OGDF/test/src/basic/ |
| H A D | graphcopy.cpp | 206 adjEntry adjTgt = graphCopy->copy(e->adjTarget()); in describeGraphCopySimple() local
209 AssertThat(adjTgt->isSource(), IsFalse()); in describeGraphCopySimple()
211 AssertThat(adjTgt->theEdge() == f, IsTrue()); in describeGraphCopySimple()
213 AssertThat(graphCopy->original(adjTgt) == e->adjTarget(), IsTrue()); in describeGraphCopySimple()
353 adjEntry adjTgt = graphCopy->copy(e->adjTarget()); in __anondcfebcf61302() local
356 AssertThat(adjTgt == f2->adjTarget(), IsTrue()); in __anondcfebcf61302()
359 AssertThat(graphCopy->original(adjTgt) == e->adjTarget(), IsTrue()); in __anondcfebcf61302()
|
| H A D | graph.cpp | 103 adjEntry adjTgt = e->adjTarget(); in __anonab0991db0402() local
105 AssertThat(adjSrc == adjTgt, IsFalse()); in __anonab0991db0402()
107 AssertThat(adjTgt->isSource(), IsFalse()); in __anonab0991db0402()
|
| /dports/math/ogdf/OGDF/src/ogdf/planarity/ |
| H A D | MMVariableEmbeddingInserter.cpp | 662 adjEntry adjSrc = nullptr, adjTgt = nullptr; in insertWithCommonDummy() local
684 adjTgt = adj; in insertWithCommonDummy()
692 OGDF_ASSERT(adjTgt != nullptr); in insertWithCommonDummy()
694 if(adjSrc == adjTgt->cyclicPred() || adjSrc == adjTgt->cyclicSucc()) in insertWithCommonDummy()
697 tgt = preparePath(vTgt, adjTgt, bOrigEdgeTgt, eOrig->target()); in insertWithCommonDummy()
705 findPseudos(vDummy,adjTgt,infoTgt,pseudos); in insertWithCommonDummy()
724 adjEntry adjTgt_2 = adjTgt->cyclicSucc()->cyclicSucc(); in insertWithCommonDummy()
725 OGDF_ASSERT(PG.nodeSplitOf(adjTgt->theEdge()) == PG.nodeSplitOf(adjTgt_2->theEdge())); in insertWithCommonDummy()
726 OGDF_ASSERT(PG.originalEdge(adjTgt->theEdge()) == PG.originalEdge(adjTgt_2->theEdge())); in insertWithCommonDummy()
728 edge e = PG.insertBySepDummy(eOrig, vSrc, vTgt, adjSrc, adjTgt, adjTgt_2); in insertWithCommonDummy()
|
| H A D | PlanRepExpansion.cpp | 279 adjEntry adjSrc, adjTgt; in insertEdgePathEmbedded() local
313 adjTgt = u->firstAdj(); in insertEdgePathEmbedded()
314 adjEntry adjSrcNext = adjTgt->succ(); in insertEdgePathEmbedded()
316 if (adjTgt != adj->twin()) in insertEdgePathEmbedded()
317 std::swap(adjTgt, adjSrcNext); in insertEdgePathEmbedded()
319 OGDF_ASSERT(adjTgt == adj->twin()); in insertEdgePathEmbedded()
322 edge eNew = E.splitFace(adjSrc,adjTgt); in insertEdgePathEmbedded()
|
| /dports/math/ogdf/OGDF/src/ogdf/orthogonal/ |
| H A D | OrthoRep.cpp | 1509 adjEntry adjTgt = e->adjTarget(); in undissect() local
1510 m_angle[adjTgt->cyclicPred()] += m_angle[adjTgt]; in undissect()
1514 node tv = adjTgt->theNode(); in undissect()
|